n^0.4-Approximation for Longest Common Subsequence.">n^0.4-Approximation for Longest Common Subsequence., dblp, computer science, bibliography, knowledge graph, author, editor, publication, conference, journal, book, thesis, database, collection, open data, bibtex">

default search action

combined dblp search
author search
venue search
publication search

ask others

"A Linear-Time n0.4-Approximation for Longest Common ..."

Karl Bringmann, Vincent Cohen-Addad, Debarati Das (2023)

> Home

Details and statistics

DOI: 10.1145/3568398

access: closed

type: Journal Article

metadata version: 2023-04-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/BringmannCD23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/BringmannCD23
Karl Bringmann, Vincent Cohen-Addad, Debarati Das:
A Linear-Time n^0.4-Approximation for Longest Common Subsequence. ACM Trans. Algorithms 19(1): 9:1-9:24 (2023)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.