1396 search results - page 2 / 280 » Succinct Dynamic Data Structures |
96
Voted
DCC
2010
IEEE
15 years 9 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...
115
Voted
ICALP
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
113
Voted
STOC
2009
ACM
16 years 2 months ago
2009
ACM
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
86
Voted
CPM
2006
Springer
15 years 6 months ago
2006
Springer
97
Voted
CPM
2008
Springer
15 years 4 months ago
2008
Springer