Optimal lower bounds for rank and select indexes

Theoretical Computer Science

Volumn 387, Issue 3, 2007, Pages 348-359

  Golynski, Alexander ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Fully indexable dictionary; Lower bounds; Succinct data structures

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; QUERY PROCESSING;

FULLY INDEXABLE DICTIONARY; LOWER BOUNDS; SUCCINCT DATA STRUCTURES;

DATA STRUCTURES;

EID: 35448969317     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.07.041     Document Type: Article

References (7)

1. David R. Clark, Compact pat trees, Ph.D. Thesis, University of Waterloo, 1996
2. Guy Jacobson, Succinct static data structures, Ph.D. 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, 2005, pp. 11-12
4. Ian Munro J., Raman V., and Srinivasa Rao S. Space efficient suffix trees. Proceedings of the 18th Conference on the Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science vol. 1530 (1998), Springer 186-196
5. Ian Munro J., Raman V., and Srinivasa Rao S. Space efficient suffix trees. Journal of Algorithms 39 2 (2001) 205-222
6. Rajeev Raman, Venkatesh Raman, 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, 2002, pp. 233-242
7. Peter Widmayer, Personal communication, 2006