685 search results - page 3 / 137 » Succinct Trees in Practice |
ICALP
2003
Springer
14 years 20 days ago
2003
Springer
CPM
2006
Springer
13 years 11 months ago
2006
Springer
SODA
2004
ACM
13 years 8 months ago
2004
ACM
DCC
2010
IEEE
14 years 2 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
13 years 7 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...