A simple optimal representation for balanced parentheses

Theoretical Computer Science

Volumn 368, Issue 3, 2006, Pages 231-246

  Geary, Richard F ^a   Rahman, Naila ^a   Raman, Rajeev ^a   Raman, Venkatesh ^b  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

Compressed dictionaries; Parentheses representation of trees; Succinct data structures; XML DOM

Indexed keywords

ALGORITHMS; DATA STRUCTURES; MATHEMATICAL MODELS; PROBLEM SOLVING; TREES (MATHEMATICS); XML;

COMPRESSED DICTIONARIES; PARENTHESES REPRESENTATION OF TREES; SUCCINCT DATA STRUCTURES; XML DOM;

COMPUTATIONAL GEOMETRY;

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

References (24)

1. Apache Xindice Project, Frequently asked Questions 10, 〈http://xml.apache.org/xindice/faq.html#faq-N10084〉.
2. D.A. Benoit, E.D. Demaine, J.I. Munro, R. Raman, V. Raman, S.S. Rao, Representing trees of higher degree, TR 2001/46, Department of Maths and Computer Science, University of Leicester, 2001.
3. D.A. Benoit, E.D. Demaine, J.I. Munro, V. Raman, Representing trees of higher degree, in: Proc. Sixth WADS, Lecture Notes in Computer Science, Vol. 1663, Springer, Berlin, 1999, pp. 169-180.
4. Centerpoint XML, 〈http://www.cpointc.com/XML〉.
5. K. Chupa. MMath Thesis, University of Waterloo, 1997.
6. Clark D., and Munro J.I. Efficient suffix trees on secondary storage. Proc. Seventh ACM-SIAM SODA (1996) 383-391
7. Darragh J.J., Cleary J.G., and Witten I.H. Bonsai: a compact representation of trees. Software-Practice and Experience Vol. 23 (1993) 277-291
8. Ferragina P., and Manzini G. An experimental study of a compressed index. Inform. Sci. 135 (2001) 13-28
9. Fredman M.L., Komlós J., and Szemerédi E. Storing a sparse table with O (1) worst case access time. J. ACM 31 (1984) 538-544
10. Geary R.F., Raman R., and Raman V. Succinct ordinal trees with level-ancestor queries. Proc. 15th ACM-SIAM SODA (2004) 1-10
11. Grossi R., Gupta A., and Vitter J.S. When indexing equals compression: experiments on suffix arrays and trees. Proc. 15th ACM-SIAM SODA (2004) 629-638
12. Hagerup T., Miltersen P.B., and Pagh R. Deterministic dictionaries. J. Algorithms 41 1 (2001) 69-85
13. Jacobson G. Space-efficient static trees and graphs. Proc. 30th FOCS (1989) 549-554
14. A. Le Hors, P. Le Hégaret, L. Wood, G. Nicol, J. Robie, M. Champion, S. Byrne, Document Object Model (DOM) Level 2 Core Specification Version 1.0. W3C Recommendation 13 November, 2000, 〈http://www.w3.org/TR/DOM-Level-2-Core〉, W3C Consortium, 2000.
15. Martin H.W., and Orr B.J. A random binary tree generator. Computer Trends in the 1990s, Proc. 1989 ACM 17th Annu. Computer Science Conference (1989), ACM Press, New York 33-38
16. I. Munro, R. Raman, V. Raman, S.S. Rao, Succinct representation of permutations, in: Proc. 30th ICALP, Lecture Notes in Computer Science, Vol. 2719, Springer, Berlin, 2003, pp. 345-356.
17. Munro I., Raman V., and Rao S.S. Space efficient suffix trees. J. Algorithms 39 (2001) 205-222
18. J.I. Munro, Tables, in: Proc. 16th FST&TCS Conference, Lecture Notes in Computer Science, Vol. 1180, Springer, Berlin, 1996, pp. 37-42.
19. Munro J.I., and Raman V. Succinct representation of balanced parentheses and static trees. SIAM J. Computing 31 (2001) 762-776
20. Raman R., Raman V., and Rao S.S. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. Proc. 13th ACM-SIAM SODA (2002) 233-242
21. Sadakane K. Succinct representations of lcp information and improvements in the compressed suffix arrays. Proc. 13th ACM-SIAM SODA (2002) 225-232
22. University of Washington XML Repository, 〈http://www.cs.washington.edu/research/xmldatasets/〉.
23. Valgrind-A GPL'd system for debugging and profiling x86-Linux programs, 〈http://valgrind.kde.org/〉.
24. VOTable Documentation, 〈http://www.us-vo.org/VOTable/〉.