Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "Approximating edit distance in near-linear time"
@article{DBLP:journals/siamcomp/AndoniO12, author = {Alexandr Andoni and Krzysztof Onak}, title = {Approximating Edit Distance in Near-Linear Time}, journal = {{SIAM} J. Comput.}, volume = {41}, number = {6}, pages = {1635--1648}, year = {2012}, url = {https://doi.org/10.1137/090767182}, doi = {10.1137/090767182}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/AndoniO12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1109-5635, author = {Alexandr Andoni and Krzysztof Onak}, title = {Approximating Edit Distance in Near-Linear Time}, journal = {CoRR}, volume = {abs/1109.5635}, year = {2011}, url = {http://arxiv.org/abs/1109.5635}, eprinttype = {arXiv}, eprint = {1109.5635}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1109-5635.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AndoniO09, author = {Alexandr Andoni and Krzysztof Onak}, editor = {Michael Mitzenmacher}, title = {Approximating edit distance in near-linear time}, booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing, {STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009}, pages = {199--204}, publisher = {{ACM}}, year = {2009}, url = {https://doi.org/10.1145/1536414.1536444}, doi = {10.1145/1536414.1536444}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AndoniO09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.