| 2021 | STOC | On codes decoding a constant fraction of errors on the BSC. | Jan Hazla, Alex Samorodnitsky, Ori Sberlo |
| 2014 | FOCS | Bounds on the Permanent and Some Applications. | Leonid Gurvits, Alex Samorodnitsky |
| 2014 | ISIT | A proof of the Ahlswede-Cai-Zhang conjecture. | Christoph Bunte, Amos Lapidoth, Alex Samorodnitsky |
| 2013 | ISIT | The zero-undetected-error capacity of the low-noise cyclic triangle channel. | Christoph Bunte, Amos Lapidoth, Alex Samorodnitsky |
| 2009 | FOCS | Learning and Smoothed Analysis. | Adam Tauman Kalai, Alex Samorodnitsky, Shang-Hua Teng |
| 2008 | STOC | Inverse conjecture for the gowers norm is false. | Shachar Lovett, Roy Meshulam, Alex Samorodnitsky |
| 2007 | SODA | Approximating entropy from sublinear samples. | Mickey Brautbar, Alex Samorodnitsky |
| 2007 | STOC | Low-degree tests at large distances. | Alex Samorodnitsky |
| 2006 | STOC | Gowers uniformity, influence of variables, and PCPs. | Alex Samorodnitsky, Luca Trevisan |
| 2005 | FOCS | On Delsarte's Linear Programming Bounds for Binary Codes. | Michael Navon, Alex Samorodnitsky |
| 2002 | FOCS | Testing Juntas. | Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky |
| 2002 | STOC | Monotonicity testing over general poset domains. | Eldar Fischer, Eric P. Lehman, Ilan Newman, Sofya Raskhodnikova, Ronitt Rubinfeld, Alex Samorodnitsky |
| 2000 | STOC | A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume. | Leonid Gurvits, Alex Samorodnitsky |
| 2000 | STOC | A PCP characterization of NP with optimal amortized query complexity. | Alex Samorodnitsky, Luca Trevisan |
| 1998 | STOC | A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents. | Nathan Linial, Alex Samorodnitsky, Avi Wigderson |