Static dictionaries supporting rank

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

Volumn 1741, Issue , 1999, Pages 18-26

  Raman, Venkatesh ^a   Rao, S Srinivasa ^a  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY;

CONSTANT TIME; MEMBERSHIP QUERY; SPACE EFFICIENT;

URANIUM;

EID: 84958062438     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46632-0_3     Document Type: Conference Paper

References (14)

1. M. Ajtai, “A lower bound for finding predecessors in Yao’s cell probe model”, Combinatorica 8 (1988) 235-247.
2. D. Benoit, “Compact Tree Representations”, Master’s Thesis, Department of Computer Science, University of Waterloo, Canada (1998).
3. D. Benoit, E. D. Demaine, J. I. Munro and V. Raman “Representing Trees of Higher Degree”, The Proceedings of the 6th International Workshop on Algorithms and Data Structures, Springer Verlag Lecture Notes in Computer Science 1663 (1999) 169-180.
4. A. Brodnik and J. I. Munro, “Membership in constant time and almost minimum space”, to appear in SIAM Journal on Computing.
5. D. R. Clark, “Compact Pat Trees”, Ph.D. Thesis, University of Waterloo, 1996.
6. D. R. Clark and J. I. Munro, “Efficient Suffix Trees on Secondary Storage”, Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms (1996) 383-391.
7. A. Fiat, M. Noar, J. P. Schmidt and A. Siegel, “Non-oblivious hashing”, Journal of the Association for Computing Machinery, 39(4) (1992) 764-782.
8. M. L. Fredman, J. Komlos and E. Szemerédi, “Storing a sparse table with 0(1) access time”, Journal of the Association for Computing Machinery, 31 (1984) 538-544.
9. G. Jacobson, “Space-efficient Static Trees and Graphs”, Proceedings of the IEEE Symposium on Foundations of Computer Science (1989) 549-554.
10. J. I. Munro, “Tables”, Proceedings of the 16th FST & TCS conference, Springer Verlag Lecture Notes in Computer Science 1180 (1996) 37-42.
11. J. I. Munro and V. Raman, “Succinct representation of balanced parentheses, static trees and planar graphs”, Proceedings of the IEEE Symposium on Foundations of Computer Science (1997) 118-126.
12. Rasmus Pagh, “Low redundancy in dictionaries with O(1) worst case lookup time”, to appear in Proceedings of the International Colloquium on Automata, Languages and Programming (1999).
13. J. P. Schmidt and A. Siegel, “The spatial complexity of oblivious k-probe hash functions”, SIAM Journal on Computing 19(5) (1990) 775-786.
14. D. E. Willard, “Log-Logarithmic worst case range queries are possible in space Θ (n)”, Information Processing Letters 17 (1983) 81-89.