Representing dynamic binary trees succinctly

Authors:
J. Ian Munro;Venkatesh Raman;Adam J. Storm
Affiliations:
Department of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada;Institute of Mathematical Sciences, Chennai, India 600 113;Department of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada
Venue:
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Year:
2001

Citing 3
Cited 18

Surpassing the information theoretic bound with fusion trees

Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Efficient suffix trees on secondary storage

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Succinct representation of balanced parentheses, static trees and planar graphs

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science

Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Succinct Dynamic Data Structures

WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Squeezing succinct data structures into entropy bounds

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Optimal succinct representations of planar maps

Proceedings of the twenty-second annual symposium on Computational geometry
Querying and maintaining a compact XML storage

Proceedings of the 16th international conference on World Wide Web
An Improved Succinct Representation for Dynamic k-ary Trees

CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
A Uniform Approach Towards Succinct Representation of Trees

SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Succinct representations of planar maps

Theoretical Computer Science
Dynamic Succinct Ordered Trees

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Universal Succinct Representations of Trees?

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Succinct dynamic dictionaries and trees

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Fully-functional succinct trees

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Succinct representation of dynamic trees

Theoretical Computer Science
An empirical evaluation of extendible arrays

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Succinct dynamic cardinal trees with constant time operations for small alphabet

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Succinct representation of triangulations with a boundary

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Succinct geometric indexes supporting point location queries

ACM Transactions on Algorithms (TALG)
Dynamizing succinct tree representations

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new updatable representation of binary trees. The structure requires the information theoretic minimum 2n + &Ogr;(n) bits and supports basic navigational operations in constant time and subtree size in &Ogr;(lg n). In contrast to the linear update costs of previously proposed succinct representations, our representation supports updates in &Ogr;(lg2 n) amortized time.