On hardness of several string indexing problems-Reference-Cited by-同舟云学术

On hardness of several string indexing problems

Author:

Larsen Kasper Green,Munro J. Ian,Nielsen Jesper Sindahl,Thankachan Sharma V.^ORCID

Funder

NSERC

Danish National Research Foundation

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference21 articles.

1. On hardness of several string indexing problems;Larsen,2014

2. Augmenting suffix trees, with applications;Matias,1998

3. Efficient algorithms for document retrieval problems;Muthukrishnan,2002

4. Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences;Navarro;ACM Comput. Surv.,2013

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

1. Space-Time Tradeoffs for Conjunctive Queries with Access Patterns;Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2023-06-18

2. Hardness Self-Amplification: Simplified, Optimized, and Unified;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

5. Tight dynamic problem lower bounds from generalized BMM and OMv;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09