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
Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Better Lower Bounds for Locally Decodable Codes
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Improved lower bounds for locally decodable codes and private information retrieval
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
IEEE Transactions on Information Theory - Part 1
Lower bounds for adaptive locally decodable codes
Random Structures & Algorithms
Hi-index | 0.89 |