ACM - Normas
Noga Alon
Assaf Naor
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC ’04
Derandomizing Approximation Algorithms Based on Semidefinite Programming
Some optimal inapproximability results
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
The Space Complexity of Approximating the Frequency Moments
The Algorithmic Aspects of the Regularity Lemma
Random sampling and approximation of MAX-CSP problems