Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Learning sparse multivariate polynomials over a field with queries and counterexamples
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Nearly-linear size holographic proofs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Software reliability via run-time result-checking
Journal of the ACM (JACM)
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Chinese remaindering with errors
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Pseudorandom generators without the XOR Lemma (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Reconstructing randomly sampled multivariate polynomials from highly noisy data
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
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
The architecture of robust publishing systems
ACM Transactions on Internet Technology (TOIT)
Scalable secure storage when half the system is faulty
Information and Computation
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Average-case intractability vs. worst-case intractability
Information and Computation
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Journal of Computer and System Sciences - Special issue: STOC 2003
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
Maximum-likelihood decoding of Reed-Solomon codes is NP-hard
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for adaptive locally decodable codes
Random Structures & Algorithms
Publius: a robust, tamper-evident, censorship-resistant web publishing system
SSYM'00 Proceedings of the 9th conference on USENIX Security Symposium - Volume 9
Algorithmic results in list decoding
Foundations and Trends® in Theoretical Computer Science
New Efficient Attacks on Statistical Disclosure Control Mechanisms
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Error correction up to the information-theoretic limit
Communications of the ACM - Being Human in the Digital Age
Simulation and experimental studies on fuzzy vault fingerprint cryptography
International Journal of Knowledge-based and Intelligent Engineering Systems
Improvements on the Johnson bound for Reed-Solomon codes
Discrete Applied Mathematics
SIGACT news complexity theory column 64
ACM SIGACT News
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Constant-rate oblivious transfer from noisy channels
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Optimal rate list decoding via derivative codes
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
List decoding subspace codes from insertions and deletions
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Relations between average-case and worst-case complexity
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
k-Concealment: An Alternative Model of k-Type Anonymity
Transactions on Data Privacy
Unconditionally-Secure robust secret sharing with compact shares
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
New affine-invariant codes from lifting
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Local correctability of expander codes
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes
Theoretical Computer Science
| Hi-index | 0.89 |