A simple optimal representation for balanced parentheses

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

Volumn 3109, Issue , 2004, Pages 159-172

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

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; FORESTRY; PATTERN MATCHING; RANDOM ACCESS STORAGE; XML;

DOCUMENT OBJECT MODEL; FUNDAMENTAL TOOLS; MEMORY USAGE; NATURAL OPERATION; ORDERS OF MAGNITUDE; SPACE CONSTRUCTIONS; SPACE EFFICIENT; SUCCINCT REPRESENTATION;

TREES (MATHEMATICS);

EID: 33244487580     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27801-6_12     Document Type: Article

References (23)

1. D. A. Benoit, E. D. Demaine, J. I. Munro and V. Raman. Representing trees of higher degree. In Proc. 6th WADS, LNCS 1663, 169-180, 1999.
2. D. A. Benoit, E. D. Demaine, J. I. Munro, R. Raman, V. Raman and S. S. Rao. Representing trees of higher degree. TR 2001/46, Dept. of Maths & CS, University of Leicester, 2001.
3. Centerpoint XML, http://www.cpointc.com/XML.
4. J. Cheney. Compressing XML with multiplexed hierarchical PPM models. In Proc. Data Compression Conference (DCC S001), IEEE Computer Society, pp. 163-172, 2001.
5. K. Chupa. MMath Thesis, University of Waterloo (1997).
6. D. Clark and J. I. Munro. Efficient suffix trees on secondary storage. In Proc. 7th ACM-SIAM SODA, pp. 383-391, 1996.
7. J. J. Darragh, J. G. Cleary and I. H. Witten. Bonsai: a compact representation of trees. In Software-Practice and Experience, 23 (1993), pp. 277-291.
8. 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.
9. P. Ferragina, G. Manzini. An experimental study of a compressed index. Information Sciences, 135 (2001) pp. 13-28.
10. M. L. Fredman, J. Komlos, and E. Szemerédi. Storing a sparse table with O(1) worst case access time. J. ACM, 31 (1984), pp. 538-544.
11. R. F. Geary, R. Raman and V. Raman. Succinct ordinal trees with level-ancestor queries. In Proc. 15th ACM-SIAM SODA, pp. 1-10, 2004.
12. Roberto Grossi, Ankur Gupta and Jeffrey Scott Vitter. When indexing equals compression: Experiments on suffix arrays and trees. In Proc. 15th ACM-SIAM SODA, pp. 629-638, 2004.
13. T. Hagerup, P. B. Miltersen and R. Pagh. deterministic dictionaries. Journal of Algorithms 41 (1): 69-85 (2001).
14. G. Jacobson. Space-efficient static trees and graphs. In Proc. 30th FOCS, 549-554, 1989.
15. J. I. Munro. Tables. In Proc. 16th FST&TCS conference, LNCS 1180, 37-42, 1996.
16. J. I. Munro and V. Raman. Succinct representation of balanced parentheses and static trees. SIAM J. Computing, 31 (2001), pp. 762-776.
17. I.Munro, R. Raman, V. Raman and S. S. Rao. Succinct representation of Permutations. In Proc. 30th ICALP, LNCS 2719, 345-356, 2003.
18. I.Munro, V. Raman and S. S. Rao. Space Efficient Suffix Trees In J. of Algorithms, 39 (2001), pp. 205-222.
19. R. Raman, V. Raman and S. S. Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In Proc. 13th ACM-SIAM SODA, pp. 233-242, 2002.
20. K. Sadakane. Succinct representations of lcp information and improvements in the .compressed suffix arrays. In Proc. 13th ACM-SIAM SODA, pp. 225-232, 2002.
21. UW XML Repository, http://www.cs.washington.edu/research/xmldatasets/.
22. http://cdsweb.u-strasbg.fr/doc/V0Table/.
23. http://xml.apache.org/xindice/FAQ.