3 search results - page 1 / 1 » Succinct ordinal trees with level-ancestor queries |
SODA
2004
ACM
13 years 6 months ago
2004
ACM
CORR
2010
Springer
12 years 11 months ago
2010
Springer
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
ICALP
2009
Springer
14 years 5 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...