Representing trees of higher degree

Algorithmica (New York)

Volumn 43, Issue 4, 2005, Pages 275-292

  Benoit, David ^a   Demaine, Erik D ^b   Munro, J Ian ^c   Raman, Rajeev ^d   Raman, Venkatesh ^e   Rao, S Srinivasa ^c  

^a Invio Bioinformatics Inc   (Canada)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF WATERLOO   (Canada)

^d UNIVERSITY OF LEICESTER   (United Kingdom)

^e INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

Analysis of algorithms; Cardinal trees; Data compression; Data structures; Dictionary; Digital search trees; Hashing; Information theory; Ordinal trees; Succinct data structures; Tries

Indexed keywords

DATA COMPRESSION; DATA STRUCTURES; GLOSSARIES; INFORMATION THEORY; MAPPING; SATELLITES;

CARDINAL TREES; DIGITAL SEARCH TREES; SUCCINIC DATA STRUCTURES;

TREES (MATHEMATICS);

EID: 29544442998     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-004-1146-6     Document Type: Article

References (32)

1. Paul Beame and Faith Fich. Optimal bounds for the predecessor problem. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 295-304, Atlanta, Georgia, May 1999.
2. David A. Benoit. Compact Tree Representations. M.Math, thesis, University of Waterloo, 1998.
3. David A. Benoit, Erik D. Demaine, J. Ian Munro, and Venkatesh Raman. Representing trees of higher degree. In F. Dehne, A. Gupta, J.-R. Sack, and R. Tamassia, editors, proceedings of the 6th International Workshop on Algorithms and Data Structures, pages 169-180, Vancouver. August 1999. Volume 1663 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1999.
4. Andrej Brodnik and J. Ian Munro. Membership in constant time and almost-minimum space. SIAM Journal on Computing, 28(5):1627-1640, 1999.
5. Yi-Ting Chiang, Ching-Chi Lin, and Hsueh-I. Lu. Orderly spanning trees with applications to graph encoding and graph drawing. in Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, pages 506-515, January 2001.
6. David Clark. Compact Pat Trees. Ph.D. thesis, University of Waterloo, 1996.
7. David R. Clark and J. Ian Munro. Efficient suffix trees on secondary storage. In proceedings of the 77th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 383-391, Atlanta, Georgia, January 1996.
8. JohnJ. Darragh, John G. Cleary, and Ian H. Witten. Bonsai: a compact representation of trees. Software-Practice and Experience, 23(3):277-291, March 1993.
9. Amos Fiat and Moni Naor. Implicit O(1) probe search. SIAM Journal on Computing, 22(1):1-10, February 1993.
10. Amos Fiat, Moni Naor, Jeanette P. Schmidt, and Alan Siegel. Nonoblivious hashing. Journal of the ACM, 39(4):764-782, October 1992.
11. Michael L. Fredman, János Komlós, and Endre Szemerédi. Storing a sparse table with O(1) worst case access time. Journal of the ACM, 31(3):538-544, July 1984.
12. Michael L. Fredman and Dan E. Willard. Surpassing the information theoretic bound with fusion trees. Journal of Computer and System Sciences, 47(3):424-436, December 1993.
13. Michael L. Fredman and Dan E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences, 48(3):533-551, June 1994.
14. Gaston H. Gonnet, Ricardo A. Baeza-Yates, and T. Snider. New indices for text: PAT trees and PAT arrays. In W.Frakes and R. Baeza-Yates, editors, Information Retrieval: Data Structures and Algorithms, pages 66-82. Prentice-Hall, Englewood Cliffs, NJ, 1992.
15. Ronald L. Graham, Donald E. Knuth, and Oren Patashnik. Concrete Mathematics. Addison-Wesley, Reading, MA, 1989.
16. Guy Jacobson. Space-efficient static trees and graphs. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pages 549-554, Research Triangle Park, North Carolina, October-November 1989.
17. Guy Jacobson. Succinct Static Data Structures. Ph.D. thesis, Carnegie Mellon University, 1989.
18. Guy Jacobson and Vo Kiem-Phong. Heaviest increasing/common subsequence problems. In A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors, Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching, pages 52-66, Tucson, Arizona, April-May 1992. Volume 644 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1992.
19. Donald E. Knuth. The Art of Computer Programming, Vol. 1: Fundamental Algorithms, 2nd edn. Addison-Wesley, Reading, MA, 1974.
20. Donald E. Knuth. The Art of Computer Programming, Vol. 3: Sorting and Searching, 2nd edn. Addison-Wesley, Reading, MA, 1998.
21. Udi Manber and Gene Myers. Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing, 22(5):935-948, October 1993.
22. Kurt Mehlhorn. Data Structures and Algorithms 1: Sorting and Searching. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, New York, 1984.
23. J. Ian Munro. Tables. In V. Chandru and V. Vinay, editors, Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science, pages 37-42, Hyderabad, December 1996. Volume 1180 of Lecture Notes in Computer Science. Spring-Verlag, Berlin, 1996.
24. J. Ian Munro and Venkatesh Raman. Succinct representation of balanced parentheses and static trees. SIAM Journal on Computing, 31(3):762-776, 2001.
25. Preliminary version in Proceedings of the 3&th Annual IEEE Computer Society Conference on Foundations of Computer Science, pages 118-126, Miami Beach, Florida, October 1997.
26. J. Ian Munro, Venkatesh Raman and S. Srinivasa Rao. Space efficient suffix trees. Journal of Algorithms, 39(2):205-222, 2001.
27. J. Ian Munro, Venkatesh Raman, and Adam Storm. Representing dynamic binary trees succinctly. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 529-536, January 2001.
28. Rasmus Pagh. Low redundancy in static dictionaries with constant query time. SIAM Journal on Computing, 31(2):353-363, 2001.
29. Rajeev Raman, Venkatesh Raman, and S. Srinivasa Rao. Succinct dynamic data structures. In F. Dehne, J.-R. Sack, and R. Tamassia, editors, Proceedings of the 7th International Workshop on Algorithms and Data Structures, pages 426-437, Providence, RI, August 2001. Volume 2125 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2001.
30. Rajeev Raman, Venkatesh Raman, and S. Srinivasa Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms, pp. 233-242, 2002.
31. Venkatesh Raman and S. Srinivasa Rao. Static dictionaries supporting rank. In A. Aggarwal and C. Pandu Rangan, editors, Proceedings of the 10th International Symposium on Algorithms and Computation, pages 18-26, Chennai, December 1999. Volume 1741 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1999.
32. Jeanette P. Schmidt and Alan Siegel. The spatial complexity of oblivious k-probe hash functions. SIAM Journal on Computing, 19(5):775-786, October 1990.