Self-testing/correcting with applications to numerical problems
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Self-testing/correcting for polynomials and for approximate functions
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Fully parallelized multi prover protocols for NEXP-time (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Two-prover one-round proof systems: their power and their problems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
On the hardness of approximating minimization problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Two prover protocols: low error at affordable rates
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Nearly-linear size holographic proofs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Effective Noether irreducibility forms and applications
Selected papers of the 23rd annual ACM symposium on Theory of computing
Probabilistic checking of proofs and hardness of approximation problems
Probabilistic checking of proofs and hardness of approximation problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Impossibility results for recycling random bits in two-prover proof systems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Interactive proofs and the hardness of approximating cliques
Journal of the ACM (JACM)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Free bits, PCPs and non-approximability-towards tight results
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
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
Some improvements to total degree tests
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
PCP characterizations of NP: towards a polynomially-small error-probability
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
Design networks with bounded pairwise distance
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A polylogarithmic approximation algorithm for the group Steiner tree problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A PCP characterization of NP with optimal amortized query complexity
STOC '00 Proceedings of the thirty-second 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
Information and Computation
Approximation algorithms for terrain guarding
Information Processing Letters
Exact and approximate testing/correcting of algebraic functions: a survey
Theoretical aspects of computer science
Improved Approximation Algorithms for Capacitated Facility Location Problems
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Hardness of Set Cover with Intersection 1
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Small PCPs with Low Query Complexity
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
List Decoding: Algorithms and Applications
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
Budget Constrained Minimum Cost Connected Medians
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
On the Approximability of the Minimum Test Collection Problem
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Algebraic testing and weight distributions of codes
Theoretical Computer Science
Constraint Satisfaction: The Approximability of Minimization Problems
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Hardness of Approximating Minimization Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Multicasting and Broadcasting in Undirected WDM Networks
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
Polynomial factorization: a success story
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Computer algebra handbook
Multicommodity facility location
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A new PCP outer verifier with applications to homogeneous linear equations and max-bisection
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
On the hardness of the minimum height decision tree problem
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
Almost Orthogonal Linear Codes are Locally Testable
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Robust locally testable codes and products of codes
Random Structures & Algorithms
Algorithmic construction of sets for k-restrictions
ACM Transactions on Algorithms (TALG)
The approximability of non-Boolean satisfiability problems and restricted integer programming
Theoretical Computer Science
Scalable event matching for overlapping subscriptions in pub/sub systems
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
PCPs with small soundness error
ACM SIGACT News
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
On the hardness of the minimum height decision tree problem
Discrete Applied Mathematics
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Local list-decoding and testing of random linear codes from high error
Proceedings of the forty-second ACM symposium on Theory of computing
Approximation algorithm for the minimum directed tree cover
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Composition of low-error 2-query PCPs using decodable PCPs
Property testing
Some recent results on local testing of sparse linear codes
Property testing
Composition of low-error 2-query PCPs using decodable PCPs
Property testing
Some recent results on local testing of sparse linear codes
Property testing
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
network discovery and verification
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Self-correctors for cryptographic modules
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
SIAM Journal on Discrete Mathematics
New affine-invariant codes from lifting
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |