53 search results - page 3 / 11 » Fully-Functional Succinct Trees |
SODA
2004
ACM
14 years 10 months ago
2004
ACM
DCC
2010
IEEE
15 years 4 months ago
2010
IEEE
We propose new data structures for navigation in sequences of balanced parentheses, a standard tool for representing compressed trees. The most striking property of our approach is...
IPL
2007
14 years 9 months ago
2007
We study the Kolmogorov complexity of a Binary Insertion Tree, and present a succinct encoding scheme for Binary Insertion Trees produced from incompressible permutations. Based o...
TACAS
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. The Succinct Solver Suite offers two analysis engines for solving data and control flow problems expressed in clausal form in a large fragment of first order logic. Th...
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
For a static array A of n totally ordered objects, a range minimum query asks for the position of the minimum between two specified array indices. We show how to preprocess A into...