Optimal lower bounds for rank and select indexes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4051 LNCS, Issue , 2006, Pages 370-381

  Golynski, Alexander ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC LANGUAGES; BIT ERROR RATE; ERROR ANALYSIS; INDEXING (OF INFORMATION); MATHEMATICAL MODELS; QUERY LANGUAGES; RANDOM ACCESS STORAGE;

BIT VECTOR B; OPTIMAL LOWER BOUNDS; RAM MODEL; SELECT INDEX;

DATA STRUCTURES;

EID: 33746329339     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786986_33     Document Type: Conference Paper

References (7)

1. David R. Clark. Compact Pat Trees. PhD thesis, University of Waterloo, 1996.
2. Guy Jacobson, Succinct Static Data Structures. PhD thesis, Carnegie Mellon University, January 1989.
3. Peter Bro Miltersen. Lower bounds on the size of selection and rank indexes. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 11-12, 2005.
4. J. Ian Munro, Venkatesh Raman, and S. Srinivasa Rao. Space efficient suffix trees. In Proceedings of the 18th Conference on the Foundations of Software Technology and Theoretical Computer Science, volume 1530 of Lecture Notes in Computer Science, pages 186-196. Springer, 1998.
5. J. Ian Munro, Venkatesh Raman, and S. Srinivasa Rao. Space efficient suffix trees. Journal of Algorithms, 39(2):205-222, 2001.
6. Rajeev Raman, Venkatesh Raman, and S. Srinivasa Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 233-242, 2002.
7. Peter Widmayor. Personal communication. 2006.