On the Communication Complexity of Approximate Pattern Matching
OPEN ACCESS
Loading...
Author / Producer
Date
2024-06
Publication Type
Conference Paper
ETH Bibliography
yes
Citations
Altmetric
OPEN ACCESS
Data
Rights / License
Permanent link
Publication status
published
External links
Editor
Book title
STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of Computing
Journal / series
Volume
Pages / Article No.
1758 - 1768
Publisher
Association for Computing Machinery
Event
56th Annual ACM Symposium on Theory of Computing (STOC 2024)
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Pattern Matching with Edits; Communication Complexity; Quantum Algorithms
Organisational unit
Notes
Conference lecture held on June 28, 2024.