138 search results - page 11 / 28 » Bit-probe lower bounds for succinct data structures |
ICALP
1994
Springer
13 years 12 months ago
1994
Springer
A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—A fundamental challenge of managing mutable data replication in a Peer-to-Peer (P2P) system is how to efficiently maintain consistency under various sharing patterns with heter...
DRM
2007
Springer
14 years 2 months ago
2007
Springer
We introduce a data structure for program execution under a limited oblivious execution model. For fully oblivious execution along the lines of Goldreich and Ostrovsky [2], one tr...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...