A PCP characterization of NP with optimal amortized query complexity

The value of strong inapproximability results for clique

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing

Non-approximability results for optimization problems on bounded degree instances

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing

Relations between average case complexity and approximation complexity

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing

On the power of unique 2-prover 1-round games

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing

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

Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming

Simple analysis of graph tests for linearity and PCP

Random Structures & Algorithms

A new multilayered PCP and the hardness of hypergraph vertex cover

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

Towards optimal lower bounds for clique and chromatic number

Theoretical Computer Science

On the approximability of clique and related maximization problems

Journal of Computer and System Sciences

Inapproximability results for equations over finite groups

Theoretical Computer Science - Special issue on automata, languages and programming

Robust pcps of proximity, shorter pcps and applications to coding

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing

Derandomizing homomorphism testing in general groups

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing

Efficient testing of groups

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

Simple PCPs with poly-log rate and query complexity

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

Hardness of the undirected edge-disjoint paths problem

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

Every 2-CSP allows nontrivial approximation

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

Guest column: inapproximability results via Long Code based PCPs

ACM SIGACT News

Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science

On the hardness of approximating Max-Satisfy

Information Processing Letters

Gowers uniformity, influence of variables, and PCPs

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing

Linear degree extractors and the inapproximability of max clique and chromatic number

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing

A note on unique games

Information Processing Letters

Logarithmic hardness of the undirected edge-disjoint paths problem

Journal of the ACM (JACM)

Low-degree tests at large distances

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing

Non-Abelian homomorphism testing, and distributions close to their self-convolutions

Random Structures & Algorithms

Finding large 3-free sets I: The small n case

Journal of Computer and System Sciences

Succinct NP Proofs from an Extractability Assumption

CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms

Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness

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

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

On the Approximation Resistance of a Random Predicate

APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques

Randomly supported independence and resistance

Proceedings of the forty-first annual ACM symposium on Theory of computing

Conditional hardness for satisfiable 3-CSPs

Proceedings of the forty-first annual ACM symposium on Theory of computing

Sound 3-Query PCPPs Are Long

ACM Transactions on Computation Theory (TOCT)

Optimal Sherali-Adams Gaps from Pairwise Independence

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

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

On the hardness of approximating Max-Satisfy

Information Processing Letters

Two-query PCP with subconstant error

Journal of the ACM (JACM)

Approximability of packing disjoint cycles

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation

Inapproximability results for equations over infinite groups

Theoretical Computer Science

Derandomizing graph tests for homomorphism

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation

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

On the derandomization of the graph test for homomorphism over groups

Theoretical Computer Science

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

Contact center scheduling with strict resource requirements

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization

Black-box reductions in mechanism design

APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques

Randomly Supported Independence and Resistance

SIAM Journal on Computing

Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms

Approximating Max kCSP - outperforming a random assignment with almost a linear factor

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

On quadratic threshold CSPs

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics

The complexity of making unique choices: approximating 1-in-k SAT

APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques

Beating a random assignment

APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques

Testing periodicity

APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques

Better inapproximability results for maxclique, chromatic number and min-3lin-deletion

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

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

Nearly complete graphs decomposable into large induced matchings and their applications

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing

Sublinear Time Algorithms

SIAM Journal on Discrete Mathematics

Towards an optimal query efficient PCP?

Proceedings of the 4th conference on Innovations in Theoretical Computer Science

A characterization of approximation resistance for even k-partite CSPs

Proceedings of the 4th conference on Innovations in Theoretical Computer Science

On the power of many one-bit provers

Proceedings of the 4th conference on Innovations in Theoretical Computer Science

Approximation resistance from pairwise independent subgroups

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Approximation resistance on satisfiable instances for predicates with few accepting inputs

Proceedings of the forty-fifth annual ACM symposium on Theory of computing