English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. View item / 
  2. Item Summary

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime

MPS-Authors
/persons/resource/persons44182

Bringmann,  Karl       
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons263580

Cassis,  Alejandro
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons242908

Fischer,  Nick
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

3519935.3519990.pdf
(Publisher version), 347KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Bringmann, K., Cassis, A., Fischer, N., & Nakos, V. (2022). Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime. In S. Leonardi, & A. Gupta (Eds.), STOC '22 (pp. 1102-1115). New York, NY: ACM. doi:10.1145/3519935.3519990.


Cite as: https://hdl.handle.net/21.11116/0000-000B-588D-4
Abstract
There is no abstract available