Fully-functional succinct trees

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 134-149

  Sadakane, Kunihiko ^a   Navarro, Gonzalo ^b  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; FORESTRY;

CONSTANT TIME; DYNAMIC TREES; INSERTIONS AND DELETIONS; LOWER ORDER TERMS; STATIC TREES; SUCCINCT REPRESENTATION; THEORY AND PRACTICE; TREE OPERATIONS;

TREES (MATHEMATICS);

EID: 77951686861     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.13     Document Type: Conference Paper

References (35)

1. D. Arroyuelo. An improved succinct representation for dynamic k-ary trees. In Proc. 19th Annual Symposium on Combinatorial Pattern Matching (CPM), LNCS 5029, pages 277-289, 2008.
2. J. Barbay, J. I. Munro, M. He, and S. S. Rao. Succinct indexes for strings, binary relations and multi-labeled trees. In Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 680-689, 2007.
3. M. Bender and M. Farach-Colton. The LCA problem revisited. In Proc. 4th Latin American Symposium on Theoretical Informatics (LATIN), LNCS 1776, pages 88-94, 2000.
4. M. Bender and M. Farach-Colton. The level ancestor problem simplified. Theoretical Computer Science, 321(1):5-12, 2004.
5. D. Benoit, E. D. Demaine, J. I. Munro, R. Raman, V. Raman, and S. S. Rao. Representing trees of higher degree. Algorithmica, 43(4):275-292, 2005.
6. H.-L. Chan, W.-K. Hon, T.-W. Lam, and K. Sadakane. Compressed indexes for dynamic text collections. ACM Transactions on Algorithms, 3(2):article 21, 2007.
7. Y.-T. Chiang, C.-C. Lin, and H.-I. Lu. Orderly spanning trees with applications. SIAM Journal on Computing, 34(4):924-945, 2005.
8. O. Delpratt, N. Rahman, and R. Raman. Engineering the LOUDS succinct tree representation. In Proc. 5th Workshop on Efficient and Experimental Algorithms (WEA), pages 134-145. LNCS 4007, 2006.
9. A. Farzan and J. I. Munro. A uniform approach towards succinct representation of trees. In Proc. 11th Scandinavian Workshop on Algorithm Theory (SWAT), LNCS 5124, pages 173-184, 2008.
10. P. Ferragina, F. Luccio, G. Manzini, and S. Muthukrishnan. Structuring labeled trees for optimal succinctness, and beyond. In Proc. 46th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 184-196, 2005.
11. J. Fischer. Optimal succinctness for range minimum queries. CoRR, abs/0812.2775, 2008.
12. J. Fischer and V. Heun. A new succinct representation of RMQ-information and improvements in the enhanced suffix array. In Proc. 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE), LNCS 4614, pages 459-470, 2007.
13. J. Fischer and V. Heun. Range median of minima queries, super-cartesian trees, and text indexing. In Proc. 19th International Workshop on Combinatorial Algorithms (IWOCA), pages 239-252, 2008.
14. M. Fredman and M. Saks. The Cell Probe Complexity of Dynamic Data Structures. In Proc. 21st Annual ACM Symposium on Theory of Computing (STOC), pages 345-354, 1989.
15. M. Fredman and D. Willard. Surpassing the information theoretic bound with fusion trees. Journal of Computer and Systems Science, 47(3):424-436, 1993.
16. R. F. Geary, N. Rahman, R. Raman, and V. Raman. A simple optimal representation for balanced parentheses. In Proc. 15th Annual Symposium on Combinatorial Pattern Matching (CPM), LNCS 3109, pages 159-172, 2004. (Pubitemid 38945542)
17. R. F. Geary, R. Raman, and V. Raman. Succinct ordinal trees with level-ancestor queries. In Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1-10, 2004.
18. A. Golynski, R. Grossi, A. Gupta, R. Raman, and S. S. Rao. On the size of succinct indices. In Proc. 15th Annual European Symposium on Algorithms (ESA), pages 371-382. LNCS 4698, 2007.
19. M. He, J. I. Munro, and S. S. Rao. Succinct ordinal trees based on tree covering. In Proc. 34th International Colloquium on Automata, Languages and Programming (ICALP), LNCS 4596, pages 509-520, 2007.
20. G. Jacobson. Space-efficient static trees and graphs. In Proc. 30th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 549-554, 1989.
21. J. Jansson, K. Sadakane, and W.-K. Sung. Ultrasuccinct representation of ordered trees. In Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 575-584, 2007.
22. H.-I. Lu and C.-C. Yeh. Balanced parentheses strike back. ACM Transactions on Algorithms (TALG), 4(3):article 28, 2008.
23. V. Mäkinen and G. Navarro. Dynamic entropy-compressed sequences and full-text indexes. ACM Transactions on Algorithms (TALG), 4(3):article 32, 2008.
24. J. I. Munro. An implicit data structure supporting insertion, deletion, and search in O(log n) time. Journal of Computer System Sciences, 33(1):66-74, 1986.
25. J. I. Munro. Tables. In Proc. 16th Foundations of Software Technology and Computer Science (FSTTCS), LNCS 1180, pages 37-42, 1996.
26. J. I. Munro and V. Raman. Succinct representation of balanced parentheses and static trees. SIAM Journal on Computing, 31(3):762-776, 2001.
27. J. I. Munro, V. Raman, and S. S. Rao. Space efficient suffix trees. Journal of Algorithms, 39(2):205-222, 2001.
28. J. I. Munro, V. Raman, and A. J. Storm. Representing dynamic binary trees succinctly. In Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 529-536, 2001.
29. J. I. Munro and S. S. Rao. Succinct representations of functions. In Proc. 31th International Colloquium on Automata, Languages and Programming (ICALP), LNCS 3142, pages 1006-1015, 2004.
30. M. Pǎtraşcu. Succincter. In Proc. 49th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 305-313, 2008.
31. M. Pǎtraşcu and M. Thorup. Time-space trade-offs for predecessor search. In Proc. 38th Annual ACM Symposium on Theory of Computing (STOC), pages 232-240, 2006.
32. R. Raman, V. Raman, and S. S. Rao. Succinct dynamic data structures. In Proc. 7th Annual Workshop on Algorithms and Data Structures (WADS), LNCS 2125, pages 426-437, 2001.
33. R. Raman, V. Raman, and S. S. Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 233-242, 2002.
34. R. Raman and S. S. Rao. Succinct dynamic dictionaries and trees. In Proc. 30th International Colloquium on Automata, Languages and Programming (ICALP), LNCS 2719, pages 357-368, 2003. (Pubitemid 36905085)
35. K. Sadakane. Compressed Suffix Trees with Full Functionality. Theory of Computing Systems, 41(4):589-607, 2007.