Universal succinct representations of trees?

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

Volumn 5555 LNCS, Issue PART 1, 2009, Pages 451-462

  Farzan, Arash ^a   Raman, Rajeev ^b   Rao, S Srinivasa ^c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF LEICESTER   (United Kingdom)

^c Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

DEGREE SEQUENCE; DEPTH FIRST; FOLLOWING OPERATION; SPACE COMPLEXITY; SUBSTRING; SUCCINCT REPRESENTATION; TREE OPERATIONS; TREE REPRESENTATION; TREE-PARTITION;

ASYMPTOTIC ANALYSIS; DATA STRUCTURES; HELIUM; LABELS; TRANSLATION (LANGUAGES);

LINGUISTICS;

DATA PROCESSING; HELIUM; LOGARITHMS; MATHEMATICAL ANALYSIS; TRANSLATION;

EID: 70449097664     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02927-1_38     Document Type: Conference Paper

References (18)

1. Benoit, D., Demaine, E.D., Munro, J.I., Raman, R., Raman, V., Rao, S.S.: Representing trees of higher degree. Algorithmica 43(4), 275-292 (2005)
2. Chuang, R.C., Garg, A., He, X., Kao, M., Lu, H.: Compact encodings of planar graphs via canonical orderings and multiple parentheses. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 118-129. Springer, Heidelberg (1998)
3. Delpratt, O., Raman, R., Rahman, N.: Engineering succinct DOM. In: EDBT. ACM Intl. Conference Proceeding Series, vol. 261, pp. 49-60. ACM Press, New York (2008)
4. Farzan, A., Munro, J.I.: A uniform approach towards succinct representation of trees. In: Gudmundsson, J. (ed.) SWAT 2008. LNCS, vol. 5124, pp. 173-184. Springer, Heidelberg (2008)
5. Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Structuring labeled trees for optimal succinctness, and beyond. In: FOCS, pp. 184-196. IEEE Computer Society Press, Los Alamitos (2005)
6. Geary, R.F., Raman, R., Raman, V.: Succinct ordinal trees with level-ancestor queries. ACM Transactions on Algorithms 2(4), 510-534 (2006)
7. Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley Longman Publishing Co., Inc., Boston (1994)
8. He, M., Munro, J.I., Rao, S.S.: Succinct ordinal trees based on tree covering. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 509-520. Springer, Heidelberg (2007)
9. Jacobson, G.J.: Succinct static data structures. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, USA (1988)
10. Jacobson, G.J.: Space-efficient static trees and graphs. In: IEEE Symposium on Foundations of Computer Science, 1989, pp. 549-554 (1989)
11. Jansson, J., Sadakane, K., Sung, W.: Ultra-succinct representation of ordered trees. In: SODA, pp. 575-584. SIAM, Philadelphia (2007)
12. Lu, H., Yeh, C.: Balanced parentheses strike back. ACM Trans. Algorithms 4(3), 1-13 (2008)
13. Munro, J.I., Raman, V.: Succinct representation of balanced parentheses, static trees and planar graphs. In: IEEE Symposium on Foundations of Computer Science, pp. 118-126 (1997)
14. Munro, J.I., Raman, V., Storm, A.J.: Representing dynamic binary trees succinctly. In: SODA, pp. 529-536. SIAM, Philadelphia (2001)
15. Munro, J.I., Rao, S.S.: Succinct Representation of Data Structures. In: Handbook of Data Structures and Applications, ch. 37, Chapman & Hall/CRC (2004)
16. Munro, J.I., Rao, S.S.: Succinct representations of functions. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 1006-1015. Springer, Heidelberg (2004)
17. Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Transactions on Algorithms 3(4), 43 (2002); Preliminary version in SODA 2002
18. Raman, R., Rao, S.S.: Succinct dynamic dictionaries and trees. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 357-368. Springer, Heidelberg (2003)