Lower Bounds and Improved Algorithms for Asymmetric Streaming Edit Distance and Longest Common Subsequence
- Award ID(s):
- 1845349
- NSF-PAR ID:
- 10326437
- Date Published:
- Journal Name:
- Leibniz international proceedings in informatics
- Volume:
- 213
- Issue:
- 27
- ISSN:
- 1868-8969
- Page Range / eLocation ID:
- 1-23
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
No document suggestions found
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.4230/LIPIcs.FSTTCS.2021.27
