"Approximating Longest Common Subsequence in Linear Time: Beating the ..."

MohammadTaghi Hajiaghayi et al. (2022)

> Home

Details and statistics

DOI: 10.1137/19M1272068

access: closed

type: Journal Article

metadata version: 2024-05-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/HajiaghayiSSS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/HajiaghayiSSS22
MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeedreza Seddighin, Xiaorui Sun:
Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier. SIAM J. Comput. 51(4): 1341-1367 (2022)

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.