53 search results - page 2 / 11 » Fully-Functional Succinct Trees |
ICALP
2009
Springer
15 years 9 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...
ALENEX
2010
14 years 11 months ago
2010
We implement and compare the major current techniques for representing general trees in succinct form. This is important because a general tree of n nodes is usually represented i...
CPM
2008
Springer
14 years 11 months 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...
ICALP
2003
Springer
15 years 2 months ago
2003
Springer
CPM
2006
Springer
15 years 1 months ago
2006
Springer