Dynamic suffix array with polylogarithmic queries and updates-Reference-Cited by-同舟云学术

Dynamic suffix array with polylogarithmic queries and updates

Published:2022-06-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Kempa Dominik¹,Kociumaka Tomasz²

Affiliation:

1. Stony Brook University, USA

2. University of California at Berkeley, USA

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3519935.3520061

Reference66 articles.

1. The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching

2. Near-Optimal Quantum Algorithms for String Problems

3. Stephen Alstrup , Gerth Stølting Brodal , and Theis Rauhe . 2000 . Pattern matching in dynamic texts . In Proc. SODA. 819–828 . http://dl.acm.org/citation.cfm?id=338219.338645 Stephen Alstrup, Gerth Stølting Brodal, and Theis Rauhe. 2000. Pattern matching in dynamic texts. In Proc. SODA. 819–828. http://dl.acm.org/citation.cfm?id=338219.338645

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Near-Optimal Search Time in $$\delta $$-Optimal Space, and Vice Versa;Algorithmica;2023-11-06

2. Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. Approximating Edit Distance in the Fully Dynamic Model;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

4. Data Structures for Computing Unique Palindromes in Static and Non-Static Strings;Algorithmica;2023-08-30

5. Dynamic suffix array with polylogarithmic queries and updates;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09