Sciweavers

685 search results - page 3 / 137
» Succinct Trees in Practice
Sort
View
ICALP
2003
Springer
15 years 8 months ago
Succinct Dynamic Dictionaries and Trees
Rajeev Raman, S. Srinivasa Rao
93
Voted
CPM
2006
Springer
125views Combinatorics» more  CPM 2006»
15 years 7 months ago
Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents
Jérémy Barbay, Alexander Golynski, J...
SODA
2004
ACM
81views Algorithms» more  SODA 2004»
15 years 4 months ago
Succinct ordinal trees with level-ancestor queries
Richard F. Geary, Rajeev Raman, Venkatesh Raman
108
Voted
DCC
2010
IEEE
15 years 10 months ago
Advantages of Shared Data Structures for Sequences of Balanced Parentheses
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...
Simon Gog, Johannes Fischer
108
Voted
IPL
2007
100views more  IPL 2007»
15 years 3 months ago
Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility
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...
Brendan Lucier, Tao Jiang, Ming Li