Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence

Kuan Cheng, Alireza Farhadi 0001, MohammadTaghi Hajiaghayi, Zhengzhong Jin, Xin Li 0006, Aviad Rubinstein, Saeed Seddighin, Yu Zheng. Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence. In Nikhil Bansal, Emanuela Merelli, James Worrell 0001, editors, 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference). Volume 198 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]

@inproceedings{Cheng0HJ0RSZ21,
  title = {Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence},
  author = {Kuan Cheng and Alireza Farhadi 0001 and MohammadTaghi Hajiaghayi and Zhengzhong Jin and Xin Li 0006 and Aviad Rubinstein and Saeed Seddighin and Yu Zheng},
  year = {2021},
  doi = {10.4230/LIPIcs.ICALP.2021.54},
  url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.54},
  researchr = {https://researchr.org/publication/Cheng0HJ0RSZ21},
  cites = {0},
  citedby = {0},
  booktitle = {48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
  editor = {Nikhil Bansal and Emanuela Merelli and James Worrell 0001},
  volume = {198},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-195-5},
}