Decoding of Reed Solomon codes beyond the error-correction bound
Journal of Complexity
Packings with large minimum kissing numbers
Discrete Mathematics
Pseudorandom generators without the XOR Lemma (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
Computing From Partial Solutions
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
Proofs, Codes, and Polynomial-Time Reducibilities
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
Learning polynomials with queries: The highly noisy case
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
IEEE Transactions on Information Theory
Pseudo-random generators for all hardnesses
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Limits to list decodability of linear codes
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Guessing secrets efficiently via list decoding
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SIGACT news complexity theory column 38
ACM SIGACT News
Storing information with extractors
Information Processing Letters
On the complexity of approximating the VC dimension
Journal of Computer and System Sciences - Complexity 2001
Ideal Error-Correcting Codes: Unifying Algebraic and Number-Theoretic Algorithms
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
On the hardness of approximating N P witnesses
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
List Decoding from Erasures: Bounds and Code Constructions
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Efficient Traitor Tracing Algorithms Using List Decoding
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
On Representations of Algebraic-Geometric Codes for List Decoding
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Linear time encodable and list decodable codes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Pseudo-random generators for all hardnesses
Journal of Computer and System Sciences - STOC 2002
Better extractors for better codes?
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
New Constructions for IPP Codes
Designs, Codes and Cryptography
Simple extractors for all min-entropies and a new pseudorandom generator
Journal of the ACM (JACM)
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Guessing secrets efficiently via list decoding
ACM Transactions on Algorithms (TALG)
Algorithmic results in list decoding
Foundations and Trends® in Theoretical Computer Science
List Decoding of Binary Codes---A Brief Survey of Some Recent Results
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Hardness amplification within NP against deterministic algorithms
Journal of Computer and System Sciences
Optimal error correction for computationally bounded noise
IEEE Transactions on Information Theory
Optimal error correction against computationally bounded noise
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Local decoding and testing for homomorphisms
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Design extractors, non-malleable condensers and privacy amplification
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.06 |