138 search results - page 2 / 28 » Lower Bounds for Succinct Data Structures |
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...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
FOCS
2005
IEEE
13 years 10 months ago
2005
IEEE
This paper proves ¡ £ ¥ lower bounds on the time to perform a single instance of an operation in any implementation of a large class of data structures shared by £ processe...
COMPGEOM
2010
ACM
13 years 9 months ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
ECCC
2007
13 years 4 months ago
2007
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...