138 search results - page 2 / 28 » Bit-probe lower bounds for succinct data structures |
CPM
2008
Springer
13 years 6 months ago
2008
Springer
ICALP
2003
Springer
13 years 10 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.
SODA
2001
ACM
13 years 6 months ago
2001
ACM
Most information-retrieval systems preprocess the data to produce an auxiliary index structure. Empirically, it has been observed that there is a tradeoff between query response t...
CPM
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
STACS
2009
Springer
13 years 11 months ago
2009
Springer
We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries...