Succinct ordinal trees with level-ancestor queries

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 1-10

  Geary, Richard F ^a   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

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; QUERY LANGUAGES; RANDOM ACCESS STORAGE; SET THEORY; TREES (MATHEMATICS); XML;

LOCAL PATH EXPRESSIONS (LPE); QUERY PROCESSING;

COMPUTER SCIENCE;

EID: 1842421216     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. S. Alstrup and J. Holm. Improved algorithms for finding level ancestors in dynamic trees. In Proc. 27th ICALP, LNCS 1853, pp. 73-84, 2000.
2. M. A. Bender and M. Farach-Colton. The level ancestor problem simplified. In Proc. LATIN 2008, LNCS 2286, pp. 508-515.
3. D. A. Benoit, E. D. Demaine, J. I. Munro and V. Raman. Representing trees of higher degree. In Proc. 6th WADS, LNCS 1663, pp. 169-180, 1999.
4. 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.
5. O. Berkman and U. Vishkin. Finding level-ancestors in trees. J. Comput. Sys. Sci., 48 (1994), PP. 214-230.
6. B. Chazelle. Computing on a free tree via complexity-preserving mappings. Algorithmica 2 (1987), pp. 337-361.
7. D. Clark and J. I. Munro. Efficient suffix trees on secondary storage. In Proceedings of the ACM-SIAM SODA, pp 383-391, 1996.
8. J. Clark and S. DeRose. XML Path Language (XPath) Version 1.0. W3C Recommendation 16 November 1999. http://www.w3.org/TR/xpath. W3C Consortium, 1999.
9. P. F. Dietz. Finding level-ancestors in dynamic trees. In Proc. 2nd WADS, LNCS 519, pp. 32-40, 1991.
10. M. Farach and S. Muthukrishnan. Perfect hashing for strings: formalization and algorithms. In Proc. 7th CPM Symposium, LNCS 1075, pp. 130-140, 1996.
11. 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.
12. G. Jacobson. Space-efficient static trees and graphs. In Proc. 30th FOCS, pp. 549-554, 1989.
13. J. I. Munro. Tables. In Proc. 16th FST&TCS conference, LNCS 1180, pp. 37-42, 1996.
14. J. I. Munro and V. Raman. Succinct representation of balanced parentheses and static trees. SIAM J. Computing, 31(3): 762-776, 2001.
15. J. I. Munro and S. S. Rao. Succinct representations of functions. Manuscript, 2003.
16. 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.