How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
Self-testing/correcting for polynomials and for approximate functions
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A note on enumerative counting
Information Processing Letters
Highly resilient correctors for polynomials
Information Processing Letters
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Generating hard instances of lattice problems (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Algorithmic complexity in coding theory and the minimum distance problem
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Communication complexity
Decoding of Reed Solomon codes beyond the error-correction bound
Journal of Complexity
Decoding algebraic-geometric codes beyond the error-correction bound
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Reconstructing Algebraic Functions from Mixed Data
SIAM Journal on Computing
Chinese remaindering with errors
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Communications of the ACM
Introduction to Coding Theory
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
Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Bounded distance+1 soft-decision Reed-Solomon decoding
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory - Part 1
Linear-time encodable and decodable error-correcting codes
IEEE Transactions on Information Theory - Part 1
Chinese remaindering with errors
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Finding smooth integers in short intervals using CRT decoding
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Constructions of Codes from Number Fields
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
Efficient Non-malleable Commitment Schemes
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
List Decoding: Algorithms and Applications
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Finding smooth integers in short intervals using CRT decoding
Journal of Computer and System Sciences - Special issue on STOC 2000
The security of all RSA and discrete log bits
Journal of the ACM (JACM)
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Computational Complexity
SIGACT news complexity theory column 64
ACM SIGACT News
Noisy polynomial interpolation and noisy chinese remaindering
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Secret swarm unit: reactive k-secret sharing
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Output-sensitive decoding for redundant residue systems
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Compressive sensing with local geometric features
Proceedings of the twenty-seventh annual symposium on Computational geometry
Ad Hoc Networks
| Hi-index | 0.00 |