112 search results - page 1 / 23 » Succinct Data Structures for Retrieval and Approximate Membe... |
CORR
2008
Springer
13 years 11 months ago
2008
Springer
STOC
2009
ACM
14 years 11 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...
SPIRE
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information r...
SIGCOMM
2006
ACM
14 years 4 months ago
2006
ACM
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
STACS
2009
Springer
14 years 5 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...