Lower bounds on the size of selection and rank indexes

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 11-12

  Miltersen, Peter Bro ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CONDITIONAL PROBABILITY; LOWER BOUNDS; SELECTION INDEX PROBLEMS; VECTOR ADDITION;

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SIMULATION; DATA STRUCTURES; PROBABILITY; QUERY LANGUAGES; RANDOM PROCESSES; SET THEORY; VECTORS;

BOUNDARY VALUE PROBLEMS;

EID: 20744445976     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. David R. Clark. "Compact Pat Trees". PhD-thesis. Department of Computer Science, University of Waterloo, Canada, 1996.
2. Erik D. Demaine, Alejandro López-Ortiz. A linear lower bound on the index size for text retrieval. J. Algorithms 48(1), pages 2-15 (2003).
3. Anna Gál, Peter Bro Miltersen. The cell probe complexity of succinct data structures. ICALP 2003, pages 332-344.
4. Guy Jacobson. Space-efficient Static Trees and Graphs. FOCS 1989, pages 549-554.
5. J. Ian Munro: Tables. FSTTCS 1996, pages 37-40.
6. J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao. Space Efficient Suffix Trees. J. Algorithms 39(2), pages 205-222 (2001)
7. R. Raman, V. Raman and S. S. Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. SODA 2002, pages 233-242.