Representing dynamic binary trees succinctly

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 529-536

  Munro, J Ian ^a   Raman, Venkatesh ^b   Storm, Adam J ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

^b INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

Algorithms; Theory; Verification

Indexed keywords

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

References (8)

1. David Benoit , Erik D. Demaine , J. Ian Munro , Venkatesh Raman, Representing Trees of Higer Degree, Proceedings of the 6th International Workshop on Algorithms and Data Structures, p.169-180, August 11-14, 1999
2. Andrej Brodnik , Svante Carlsson , Erik D. Demaine , J. Ian Munro , Robert Sedgewick, Resizable Arrays in Optimal Time and Space, Proceedings of the 6th International Workshop on Algorithms and Data Structures, p.37-48, August 11-14, 1999
3. David R. Clark , J. Ian Munro, Efficient suffix trees on secondary storage, Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, p.383-391, January 28-30, 1996, Atlanta, Georgia, United States
4. Michael L. Fredman , Dan E. Willard, Surpassing the information theoretic bound with fusion trees, Journal of Computer and System Sciences, v.47 n.3, p.424-436, Dec. 1993 [doi〉10.1016/0022-0000(93)90040-4]
5. G. Jacobson, "Space-efficient Static Trees and Graphs", Proceedings of the IEEE Symposium on the Foundations of Computer Science (FOCS) (1989) 549- 554.
6. R. J. Lipton, and R. E. Tarjan, "A Separator Theorem For Planar Graphs", SIAM Journal of Applied Mathematics, 36(2) (1979) 177-189.
7. J. I. Munro , V. Raman, Succinct representation of balanced parentheses, static trees and planar graphs, Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS '97), p.118, October 19-22, 1997
8. A. J. Storm, Representing Dynamic Binary Trees Succinctly, MMath thesis, U. Waterloo, 2000.