685 search results - page 3 / 137 » Succinct Trees in Practice |
ICALP
2003
Springer
15 years 2 months ago
2003
Springer
61
Voted
CPM
2006
Springer
15 years 1 months ago
2006
Springer
49
Voted
SODA
2004
ACM
14 years 11 months ago
2004
ACM
67
Voted
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...
70
Voted
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...