A sublinear algorithm for weakly approximating edit distance

Batu, T.ORCID logo, Ergun, F., Kilian, J., Magen, A., Raskhodnikova, S., Rubinfeld, R. & Sami, R. (2003-06-09 - 2003-06-11) A sublinear algorithm for weakly approximating edit distance [Paper]. 35th ACM Symposium on Theory of Computing (STOC), California, United States, USA.
Copy
Item Type Conference or Workshop Item (Paper)
Copyright holders © 2003 the authors
Departments LSE > Academic Departments > Mathematics
Date Deposited 09 Dec 2008
URI https://researchonline.lse.ac.uk/id/eprint/8145

Explore Further

Full text not available from this repository.

Export as

EndNote BibTeX Reference Manager Refer Atom Dublin Core JSON Multiline CSV
Export

Downloads
View more statistics