Succinct dynamic dictionaries and trees

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

Volumn 2719, Issue , 2003, Pages 357-368

  Raman, Rajeev ^a   Rao, Satti Srinivasa ^b  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; INFORMATION THEORY;

DYNAMIC DATA; DYNAMIC DICTIONARIES; HASH TABLE; LOG FACTORS; MEMBERSHIP QUERY; SATELLITE DATA; SEARCH TREES; SPACE EFFICIENT;

TREES (MATHEMATICS);

EID: 21144449026     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_30     Document Type: Article

References (20)

1. A. Brodnik, S. Carlsson, E. D. Demaine, J. I. Munro and R. Sedgewick. Resizable arrays in optimal time and space. In Proc. WADS '99, LNCS 1663, 37-48.
2. A. Brodnik and J. I. Munro. Membership in constant time and almost minimum space. SIAM J. Computing 28 (1999), 1628-1640.
3. J. G. Cleary. Compact hash tables using bidirectional linear probing. IEEE Trans. Comput. 9 (1984), 828-834.
4. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms, The MIT Press, Cambridge, MA, 1990.
5. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert and R. E. Tarjan. Dynamic perfect hashing: upper and lower bounds. SIAM J. Computing, 23 (1994), 738-761.
6. D. Fotakis, R. Pagh, P. Sanders and P. Spirakis. Space efficient hash tables with worst case constant access time. In Proc. 20th STACS, LNCS 2607, 271-282, 2003.
7. M. L. Fredman, J. Komlós and E. Szemerédi. Storing a sparse table with O(1) worst case access time. J. ACM, 31 (1984), 538-544.
8. M. L. Fredman and M. Saks. The cell probe complexity of dynamic data structures. In Proc. 21st ACM STOC, 345-354, 1989.
9. R. Grossi and J. Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. Proc. 32nd ACM STOC, 397-406, 2000.
10. T. Hagerup. Sorting and searching on the word RAM. In Proc. 15th STACS, LNCS 1373, 366-398, 1998.
11. T. Hagerup, K. Mehlhorn and J. I. Munro. Maintaining discrete probability distributions optimally. In Proc. 20th ICALP, LNCS 700, 253-264, 1993.
12. T. Hagerup and R. Raman. An efficient quasidictionary. In Proc. 8th SWAT, LNCS 2368, 1-18, 2002.
13. G. Jacobson. Space efficient static trees and graphs. In Proc. 30th IEEE Symp. FOCS, 549-554, 1989.
14. J. I. Munro and V. Raman. Succinct representation of balanced parentheses, static trees and planar graphs. In Proc. 37th IEEE Symp. FOCS, 118-126, 1997.
15. J. I. Munro, V. Raman and A. Storm. Representing dynamic binary trees succinctly. In Proc. 12th ACM-SIAM SODA, 529-536, 2001.
16. R. Pagh. Low redundancy in static dictionaries with constant query time. SIAM J. Comput, 31 (2001), 353-363.
17. R. Pagh and F. F. Rodler. Cuckoo Hashing. Proc. 9th ESA, LNCS 2161, 121-133, 2001.
18. R. Raman, V. Raman and S. S. Rao. Succinct indexable dictionaries, with applications to representing k-ary trees and multisets. In Proc. 13th ACM-SIAM SODA, 233-242, 2002.
19. R. Raman, V. Raman and S. S. Rao. Succinct dynamic data structures. In Proc. 7th WADS, LNCS 2125, 426-437, 2001.
20. A. Silberschatz, P. B. Galvin and G. Gagne. Operating System Concepts, 6th ed. John Wiley & Sons, 2001.