Author:
Belazzougui Djamal,Boldi Paolo,Vigna Sebastiano
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Andersson, A., Thorup, M.: Dynamic ordered sets with exponential search trees. J. Assoc. Comput. Mach. 54(3), 1–40 (2007)
2. Belazzougui, D., Boldi, P., Pagh, R., Vigna, S.: Monotone minimal perfect hashing: Searching a sorted table with O(1) accesses. In: Proceedings of the 20th Annual ACM-SIAM Symposium On Discrete Mathematics (SOD), pp. 785–794. ACM Press, New York (2009)
3. Dietzfelbinger, M., Karlin, A.R., Mehlhorn, K., auf der Heide, F.M., Rohnert, H., Tarjan, R.E.: Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput. 23(4), 738–761 (1994)
4. Ferragina, P., Grossi, R.: The string B-tree: A new data structure for string search in external memory and its applications. J. Assoc. Comput. Mach. 46(2), 236–280 (1999)
5. Fredman, M.L., Willard, D.E.: Surpassing the information theoretic bound with fusion trees. J. Comput. System Sci. 47(3), 424–436 (1993)
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. CoCo-trie: Data-aware compression and indexing of strings;Information Systems;2024-02
2. Predecessor on the Ultra-Wide Word RAM;Algorithmica;2024-01-10
3. String Indexing with Compressed Patterns;ACM Transactions on Algorithms;2023-09-26
4. PIM-trie: A Skew-resistant Trie for Processing-in-Memory;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17
5. Applying burst-tries for error-tolerant prefix search;Information Retrieval Journal;2022-10-18