Optimization, approximation, and complexity classes
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Self-testing/correcting with applications to numerical problems
STOC '90 Proceedings of the twenty-second 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
Improved non-approximability results
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A dichotomy theorem for maximum generalized satisfiability problems
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Testing of the long code and hardness for clique
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
SIAM Journal on Computing
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Positive Linear Programming, Parallel Approximation and PCP's
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Approximating Satisfiable Satisfiability Problems (Extended Abstract)
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
A 7/8-Approximation Algorithm for MAX 3SAT?
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Gadgets Approximation, and Linear Programming
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Probabilistically checkable proofs and the testing of hadamard-like codes
Probabilistically checkable proofs and the testing of hadamard-like codes
Linearity testing in characteristic two
IEEE Transactions on Information Theory - Part 1
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
A PCP characterization of NP with optimal amortized query complexity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Combinatorial approximation algorithms for the maximum directed cut problem
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Exact and approximate testing/correcting of algebraic functions: a survey
Theoretical aspects of computer science
The Non-approximability of Non-Boolean Predicates
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
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]
Property testing in massive graphs
Handbook of massive data sets
Low-degree tests at large distances
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Breaking the ε-Soundness Bound of the Linearity Test over GF(2)
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP
Random Structures & Algorithms
A Hypergraph Dictatorship Test with Perfect Completeness
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
A query efficient non-adaptive long code test with perfect completeness
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2)
SIAM Journal on Computing
Query-efficient dictatorship testing with perfect completeness
Property testing
Query-efficient dictatorship testing with perfect completeness
Property testing
More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Approximation resistance from pairwise independent subgroups
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |