Highly resilient correctors for polynomials
Information Processing Letters
Decoding of Reed Solomon codes beyond the error-correction bound
Journal of Complexity
Polynomial Factorization 1987-1991
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Learning polynomials with queries: The highly noisy case
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Maximum likelihood decoding of Reed Solomon codes
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Decoding algebraic-geometric codes beyond the error-correction bound
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Sparse polynomial approximation in finite fields
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Hi-index | 0.00 |