Succinct dynamic data structures

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

Volumn 2125, Issue , 2001, Pages 426-437

  Raman, Rajeev ^a   Raman, Venkatesh ^b   Srinivasa Rao, S ^b  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES;

AMORTIZED TIME; BIT VECTOR; DYNAMIC ARRAYS; DYNAMIC DATA STRUCTURE; NONNEGATIVE INTEGERS; PARTIAL SUMS; SUCCINCT DATA STRUCTURE; TIME BOUND;

STRUCTURAL OPTIMIZATION;

EID: 84958037743     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44634-6_39     Document Type: Conference Paper

References (13)

1. A. Brodnik, S. Carlsson, E. D. Demaine, J. I. Munro and R. Sedgewick, Resizable Arrays in Optimal Time and Space, Proceedings of Workshop on Algorithms and Data Structures, LNCS 1663, 37-48 (1999).
2. A. Brodnik and J. I. Munro, Membership in Constant Time and Almost Minimum Space, SIAM Journal on Computing, 28(5), 1628-1640 (1999).
3. D. R. Clark, Compact Pat Trees, Ph.D. Thesis, University of Waterloo, 1996.
4. Paul F. Dietz, Optimal Algorithms for List Indexing and Subset Rank, Proceedings of Workshop on Algorithms and Data Structures, LNCS 382, 39-46 (1989).
5. M. L. Fredman and M. Saks, The Cell Probe Complexity of Dynamic Data Structures, Proceedings of the 21st ACM Symposium on Theory of Computing, 345-354 (1989).
6. M. L. Fredman and D. E. Willard, Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths, Journal of Computer Systems Science, 48, 533-551 (1994).
7. G. N. Fredrickson, Implicit Data Structures for the Dictionary Problem, Journal of Association of the Computing Machinery, 30, 80-94 (1983).
8. M. T. Goodrich and J. G. Kloss II, Tiered Vectors: Efficient Dynamic Array for JDSL, Proceedings of Workshop on Algorithms and Data Structures, LNCS 1663, 205-216 (1999).
9. R. Grossi and J. S. Vitter, Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching, Proceedings of Symposium on Theory of Computing, 397-406 (2000).
10. G. Jacobson, Space Efficient Static Trees and Graphs, Proceedings of the IEEE Symposium on Foundations of Computer Science, 549-554 (1989).
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. J. I. Munro, V. Raman and S. S. Rao, Space Efficient Suffix trees, Proceedings of the conference on Foundations of Software Technology and Theoretical Computer Science, LNCS 1530, 186-196 (1998).
13. J. I. Munro, V. Raman and A. Storm, Representing Dynamic Binary Trees Succinctly, Proceedings of Symposium on Discrete Algorithms, 529-536 (2001).