| 2026 | STOC | Deterministic Hardness of Approximation of Unique-SVP and GapSVP in ℓ | Yahli Hecht, Muli Safra |
| 2020 | FOCS | Towards a Proof of the Fourier-Entropy Conjecture? | Esty Kelman, Guy Kindler, Noam Lifshitz, Dor Minzer, Muli Safra |
| 2018 | FOCS | Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion. | Subhash Khot, Dor Minzer, Muli Safra |
| 2018 | STOC | Towards a proof of the 2-to-1 games conjecture? | Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra |
| 2018 | STOC | On non-optimally expanding sets in Grassmann graphs. | Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra |
| 2017 | STOC | On independent sets, 2-to-2 games, and Grassmann graphs. | Subhash Khot, Dor Minzer, Muli Safra |
| 2015 | FOCS | On Monotonicity Testing and Boolean Isoperimetric Type Theorems. | Subhash Khot, Dor Minzer, Muli Safra |
| 2011 | FOCS | A Two Prover One Round Game with Strong Soundness. | Subhash Khot, Muli Safra |
| 2010 | FOCS | Hardness of Finding Independent Sets in Almost 3-Colorable Graphs. | Irit Dinur, Subhash Khot, Will Perkins, Muli Safra |
| 2008 | SODA | Ranged hash functions and the price of churn. | James Aspnes, Muli Safra, Yitong Yin |
| 2007 | FOCS | Hardness Amplification for Errorless Heuristics. | Andrej Bogdanov, Muli Safra |
| 2005 | FOCS | On Non-Approximability for Quadratic Programs. | Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, Muli Safra |