Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
STOC '01 Proceedings of the thirty-third 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
Derandomized dimensionality reduction with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
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
A combinatorial algorithm for MAX CSP
Information Processing Letters
Correlation Clustering: maximizing agreements via semidefinite programming
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
Journal of Computer and System Sciences - STOC 2001
Is constraint satisfaction over two variables always easy?
Random Structures & Algorithms
Every 2-CSP allows nontrivial approximation
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Near-optimal algorithms for unique games
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
SIAM Journal on Computing
A new point of NP-hardness for unique games
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |