12 search results - page 1 / 3 » Succinct Dynamic Dictionaries and Trees |
73
Voted
ICALP
2003
Springer
15 years 3 months ago
2003
Springer
103
click to vote
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
100
Voted
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
SODA
2001
ACM
14 years 11 months ago
2001
ACM
We introduce a new updatable representation ofbinary trees. The structure requires the information theoretic minimum 2n + o(n) bits and supports basic navigational operations in c...
CPM
2008
Springer
15 years 3 days ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...