Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
On the efficiency of local decoding procedures for error-correcting codes
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Upper Bound on Communication Complexity of Private Information Retrieval
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Extractors: optimal up to constant factors
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Better Lower Bounds for Locally Decodable Codes
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
IEEE Transactions on Information Theory - Part 1
Corruption and Recovery-Efficient Locally Decodable Codes
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Locally testable vs. locally decodable codes
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Three-Query Locally Decodable Codes with Higher Correctness Require Exponential Length
ACM Transactions on Computation Theory (TOCT)
Private locally decodable codes
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.89 |