Low-degree tests at large distances
Inverse conjecture for the gowers norm is false
Monotonicity testing over general poset domains
A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
Proceedings of the thirty-second annual ACM symposium on Theory of computing - STOC ’00
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC ’07
Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08
Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC ’98
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC ’02
Ilan Newman
Eric Lehman
Ronitt Rubinfeld
Leonid Gurvits
Nathan Linial
Eldar Fischer
The Paulsen problem, continuous operator scaling, and smoothed analysis
Guest column
Sublinear algorithms for testing monotone and unimodal distributions