Sciweavers

93 search results - page 19 / 19
» Query-Efficient Locally Decodable Codes
Sort
View
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
14 years 6 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 6 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...
JNW
2008
173views more  JNW 2008»
13 years 5 months ago
Dominating Set Theory based Semantic Overlay Networks for Efficient and Resilient Content Distribution
Recently overlay networks have emerged as an efficient and flexible method for content distribution. An overlay network is a network running on top of another network, usually the ...
J. Amutharaj, S. Radhakrishnan