On the Communication Complexity of Approximate Pattern Matching

Kociumaka, Tomasz; Nogler, Jakob; Wellnitz, Philip

doi:10.1145/3618260.3649604

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

On the Communication Complexity of Approximate Pattern Matching

MPS-Authors

/persons/resource/persons284929

Kociumaka, Tomasz
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons229250

Wellnitz, Philip
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)

3618260.3649604.pdf
(Publisher version), 464KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Kociumaka, T., Nogler, J., & Wellnitz, P. (2024). On the Communication Complexity of Approximate Pattern Matching. In B. Moha, I. Shinkar, & R. O'Donnell (Eds.), STOC '24 (pp. 1758-1768). New York, NY: ACM. doi:10.1145/3618260.3649604.

Cite as: https://hdl.handle.net/21.11116/0000-0010-33F0-5

Abstract

There is no abstract available