BibTeX record conf/soda/RubinsteinS20

download as .bib file

@inproceedings{DBLP:conf/soda/RubinsteinS20,
  author    = {Aviad Rubinstein and
               Zhao Song},
  title     = {Reducing approximate Longest Common Subsequence to approximate Edit
               Distance},
  booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
               {SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
  pages     = {1591--1600},
  year      = {2020},
  crossref  = {DBLP:conf/soda/2020},
  url       = {https://doi.org/10.1137/1.9781611975994.98},
  doi       = {10.1137/1.9781611975994.98},
  timestamp = {Sat, 05 Dec 2020 12:59:44 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/RubinsteinS20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2020,
  editor    = {Shuchi Chawla},
  title     = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
               {SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
  publisher = {{SIAM}},
  year      = {2020},
  url       = {https://doi.org/10.1137/1.9781611975994},
  doi       = {10.1137/1.9781611975994},
  isbn      = {978-1-61197-599-4},
  timestamp = {Wed, 23 Jun 2021 06:26:01 +0200},
  biburl    = {https://dblp.org/rec/conf/soda/2020.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics