Succinct representation of dynamic trees

Theoretical Computer Science

Volumn 412, Issue 24, 2011, Pages 2668-2678

  Farzan, Arash ^a   Munro, J Ian ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Dynamic trees; Ordered trees; Succinct data structures

Indexed keywords

CONSTANT AMORTIZED TIME; CONSTANT TIME; DYNAMIC TREES; FIXED SIZE; ON DYNAMICS; ORDERED TREE; QUERY TIME; RESTRICTED MODELS; SATELLITE DATA; SUBLINEAR; SUBTREES; SUCCINCT DATA STRUCTURE; SUCCINCT REPRESENTATION;

BINARY TREES; NAVIGATION;

TREES (MATHEMATICS);

EID: 79954703766     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.10.030     Document Type: Conference Paper

References (21)

1. L. Arge, C. Cachin, T. Jurdzinski, and A. Tarlecki Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 913, 2007, Proceedings Lecture Notes in Computer Science vol. 4596 2007 Springer
2. D. Benoit, E.D. Demaine, J.I. Munro, R. Raman, V. Raman, and S.S. Rao Representing trees of higher degree Algorithmica 43 4 2005 275 292 (Pubitemid 43018037)
3. H.-L. Chan, W.-K. Hon, T.-W. Lam, and K. Sadakane Compressed indexes for dynamic text collections ACM Trans. Algorithms 3 2 2007 21
4. D.R. Clark, J.I. Munro, Efficient suffix trees on secondary storage (extended abstract), in: ACMSIAM Symposium on Discrete Algorithms, SODA, 1996, pp. 383391.
5. A. Farzan, Succinct representation of trees and graphs, Ph.D. Thesis, School of Computer Science, University of Waterloo, 2009.
6. A. Farzan, and J.I. Munro A uniform approach towards succinct representation of trees SWAT (11th Scandinavian Workshop on Algorithm Theory) Lecture Notes in Computer Science 2008 Springer 173 184
7. Fredman M., and Saks M. The cell probe complexity of dynamic data structures STOC'89: Proceedings of the Twenty-first Annual ACM Symposium on Theory of Computing 1989 ACM New York, NY, USA 345 354
8. R.F. Geary, R. Raman, and V. Raman Succinct ordinal trees with level-ancestor queries ACM Trans. Algorithms 2 4 2006 510 534 (Pubitemid 46174059)
9. A. Golynski Optimal lower bounds for rank and select indexes M. Bugliesi, B. Preneel, V. Sassone, I. Wegener, International Colloquium on Automata, Languages, and Programming, ICALP (1) Lecture Notes in Computer Science vol. 4051 2006 Springer 370 381 (Pubitemid 44113313)
10. A. Golynski, R. Grossi, A. Gupta, R. Raman, and S.S. Rao On the size of succinct indices L. Arge, M. Hoffmann, E. Welzl, European Symposium on Algorithms, ESA Lecture Notes in Computer Science vol. 4698 2007 Springer 371 382
11. A. Gupta, W.-K. Hon, R. Shah, J.S. Vitter, A framework for dynamizing succinct data structures, in: Arge et al. [1], 2007, pp. 521532.
12. M. He, J.I. Munro, S.S. Rao, Succinct ordinal trees based on tree covering, in: Arge et al. [1], 2007, pp. 509520.
13. W.-K. Hon, K. Sadakane, and W.-K. Sung Succinct data structures for searchable partial sums T. Ibaraki, N. Katoh, H. Ono, ISAAC Lecture Notes in Computer Science vol. 2906 2003 Springer 505 516
14. G.J. Jacobson, Space-efficient static trees and graphs, in: 30th Annual Symposium on Foundations of Computer Science, 1989, pp. 549554.
15. J.I. Munro Succinct data structures Electron. Notes Theor. Comput. Sci. 91 2004 3
16. J.I. Munro, V. Raman, Succinct representation of balanced parentheses, static trees and planar graphs, in: IEEE Symposium on Foundations of Computer Science, 1997, pp. 118126.
17. J.I. Munro, V. Raman, A.J. Storm, Representing dynamic binary trees succinctly, in: ACMSIAM Symposium on Discrete Algorithms, SODA, 2001, pp. 529536.
18. M. Patrascu Succincter IEEE Annual Symposium on Foundations of Computer Science, FOCS 2008 IEEE Computer Society 305 313
19. R. Raman, and S.S. Rao Succinct dynamic dictionaries and trees J.C.M. Baeten, J.K. Lenstra, J. Parrow, G.J. Woeginger, International Colloquium on Automata, Languages, and Programming, ICALP Lecture Notes in Computer Science vol. 2719 2003 Springer 357 368
20. K. Sadakane, and G. Navarro Fully-functional succinct trees M. Charikar, SODA 2010 SIAM 134 149
21. A.J. Storm, Representing dynamic binary trees succinctly, Master's Thesis, School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada, 2000.