Sciweavers

73 search results - page 14 / 15
» Public-Key Locally-Decodable Codes
Sort
View
CN
2007
99views more  CN 2007»
13 years 8 months ago
Design and implementation of a secure wide-area object middleware
Wide-area service replication is becoming increasingly common, with the emergence of new operational models such as content delivery networks and computational grids. This paper d...
Bogdan C. Popescu, Bruno Crispo, Andrew S. Tanenba...
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
14 years 9 months ago
Bit-probe lower bounds for succinct data structures
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...
Emanuele Viola
STOC
2003
ACM
124views Algorithms» more  STOC 2003»
14 years 8 months ago
Extractors: optimal up to constant factors
This paper provides the first explicit construction of extractors which are simultaneously optimal up to constant factors in both seed length and output length. More precisely, fo...
Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wi...
STACS
2010
Springer
14 years 3 months ago
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
Victor Chen, Elena Grigorescu, Ronald de Wolf
SIAMCOMP
2010
94views more  SIAMCOMP 2010»
13 years 7 months ago
Local Monotonicity Reconstruction
We propose a general model of local property reconstruction. Suppose we have a function f on domain Γ, which is supposed to have a particular property P, but may not have the pro...
Michael E. Saks, C. Seshadhri