Author:
Fischer Johannes,Gawrychowski Paweł
Publisher
Springer International Publishing
Reference15 articles.
1. Amir, A., Franceschini, G., Grossi, R., Kopelowitz, T., Lewenstein, M., Lewenstein, N.: Managing unbounded-length keys in comparison-driven data structures with applications to online indexing. SIAM J. Comput. 43(4), 1396–1416 (2014)
2. Andersson, A., Thorup, M.: Dynamic ordered sets with exponential search trees. J. ACM 53(3) (2007). Article No. 13
3. Beame, P., Fich, F.E.: Optimal bounds for the predecessor problem and related problems. J. Comput. Syst. Sci. 65(1), 38–72 (2002)
4. Lecture Notes in Computer Science;MA Bender,2002
5. Breslauer, D., Italiano, G.F.: Near real-time suffix tree construction via the fringe marked ancestor problem. J. Discrete Algorithms 18, 32–48 (2013)
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Linear time online algorithms for constructing linear-size suffix trie;Theoretical Computer Science;2024-11
2. Text Indexing for Long Patterns: Anchors are All you Need;Proceedings of the VLDB Endowment;2023-05
3. Bamboo Trimming Revisited;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11
4. Dynamic suffix array with polylogarithmic queries and updates;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
5. Subsequences in Bounded Ranges: Matching and Analysis Problems;Lecture Notes in Computer Science;2022