Fast Prefix Search in Little Space, with Applications-Reference-Cited by-同舟云学术

Fast Prefix Search in Little Space, with Applications

Published:2010 Issue: Volume: Page:427-438
ISSN:0302-9743
Container-title:Algorithms – ESA 2010
language:
Short-container-title:

Author:

Belazzougui Djamal,Boldi Paolo,Pagh Rasmus,Vigna Sebastiano

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-15775-2_37

Reference16 articles.

1. Alstrup, S., Brodal, G.S., Rauhe, T.: Optimal static range reporting in one dimension. In: STOC 2001, pp. 476–482 (2001)

2. Belazzougui, D., Boldi, P., Pagh, R., Vigna, S.: Monotone minimal perfect hashing: Searching a sorted table with O(1) accesses. In: SODA 2009, pp. 785–794. ACM Press, New York (2009)

3. Belazzougui, D., Boldi, P., Pagh, R., Vigna, S.: Theory and practise of monotone minimal perfect hashing. In: ALENEX 2009. SIAM, Philadelphia (2009)

4. Bender, M.A., Farach-Colton, M., Kuszmaul, B.C.: Cache-oblivious string B-trees. In: PODS 2006, pp. 233–242. ACM, New York (2006)

5. Brodal, G.S., Fagerberg, R.: Cache-oblivious string dictionaries. In: SODA 2006, pp. 581–590 (2006)

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

1. Space-Efficient Conversions from SLPs;Lecture Notes in Computer Science;2024

2. A Hierarchical Namespace Approach for Multi-Tenancy in Distributed Clouds;IEEE Access;2024

3. Parallel and External-Memory Construction of Minimal Perfect Hash Functions with PTHash;IEEE Transactions on Knowledge and Data Engineering;2023

4. Indexing Highly Repetitive String Collections, Part II;ACM Computing Surveys;2022-03-31

5. KATKA: A KRAKEN-Like Tool with k Given at Query Time;String Processing and Information Retrieval;2022