138 search results - page 1 / 28 » Bit-probe lower bounds for succinct data structures |
ICALP
2005
Springer
13 years 9 months ago
2005
Springer
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
SODA
2010
ACM
13 years 2 months ago
2010
ACM
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
STOC
2001
ACM
14 years 4 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
STOC
2009
ACM
14 years 5 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...