Simple and efficient fully-functional succinct trees

Theoretical Computer Science

Volumn 656, Issue , 2016, Pages 135-145

  Cordova, Joshimar ^a   Navarro, Gonzalo ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

Ordinal trees; Succinct data structures

Indexed keywords

FORESTRY;

CONSTANT TIME; OPERATION TIME; ORDINAL TREES; SUCCINCT DATA STRUCTURE; TREE REPRESENTATION;

TREES (MATHEMATICS);

EID: 84964850604     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2016.04.031     Document Type: Article

References (19)

1. [1] Jacobson, G., Space-efficient static trees and graphs. Proc. 30th IEEE Symposium on Foundations of Computer Science (FOCS), 1989, 549–554.
2. [2] Munro, J.I., Raman, V., Succinct representation of balanced parentheses and static trees. SIAM J. Comput. 31:3 (2001), 762–776.
3. [3] Geary, R.F., Rahman, N., Raman, R., Raman, V., A simple optimal representation for balanced parentheses. Theoret. Comput. Sci. 368:3 (2006), 231–246.
4. [4] Chiang, Y.T., Lin, C.C., Lu, H.I., Orderly spanning trees with applications. SIAM J. Comput. 34:4 (2005), 924–945.
5. [5] Munro, J.I., Raman, R., Raman, V., Rao, S.S., Succinct representations of permutations and functions. Theoret. Comput. Sci. 438 (2012), 74–88.
6. [6] Lu, H., Yeh, C., Balanced parentheses strike back. ACM Trans. Algorithms 4:3 (2008), 1–13.
7. [7] Benoit, D., Demaine, E.D., Munro, J.I., Raman, R., Raman, V., Rao, S.S., Representing trees of higher degree. Algorithmica 43:4 (2005), 275–292.
8. [8] Geary, R.F., Raman, R., Raman, V., Succinct ordinal trees with level-ancestor queries. ACM Trans. Algorithms 2:4 (2006), 510–534.
9. [9] Jansson, J., Sadakane, K., Sung, W.-K., Ultra-succinct representation of ordered trees with applications. J. Comput. System Sci. 78:2 (2012), 619–631.
10. [10] Navarro, G., Sadakane, K., Fully-functional static and dynamic succinct trees. ACM Trans. Algorithms, 10(3), 2014, 16.
11. [11] Arroyuelo, D., Cánovas, R., Navarro, G., Sadakane, K., Succinct trees in practice. Proc. 12th Workshop on Algorithm Engineering and Experiments (ALENEX), 2010, 84–97.
12. [12] Joannou, S., Raman, R., Dynamizing succinct tree representations. Proc. 11th International Symposium on Experimental Algorithms (SEA) Lecture Notes in Comput. Sci., vol. 7276, 2012, 224–235.
13. [13] Fredman, M., Willard, D., Surpassing the information theoretic bound with fusion trees. J. Comput. Syst. Sci. 47:3 (1993), 424–436.
14. [14] Pătraşcu, M., Succincter. Proc. 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2008, 305–313.
15. [15] Clark, D., Compact PAT trees. Ph.D. thesis, 1996, University of Waterloo, Canada.
16. [16] Bender, M., Farach-Colton, M., The level ancestor problem simplified. Theoret. Comput. Sci. 321:1 (2004), 5–12.
17. [17] Okanohara, D., Sadakane, K., Practical entropy-compressed rank/select dictionary. Proc. 9th Workshop on Algorithm Engineering and Experiments (ALENEX), 2007, 60–70.
18. [18] Bender, M., Farach-Colton, M., The LCA problem revisited. Proc. 4th Latin American Theoretical Informatics Symposium (LATIN) Lecture Notes in Comput. Sci., vol. 1776, 2000, 88–94.
19. [19] Yuan, H., Atallah, M.J., Data structures for range minimum queries in multidimensional arrays. Proc. 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2010, 150–160.