| 2026 | STOC | An Analytical Approach to Parallel Repetition via CSP Inverse Theorems. | Amey Bhangale, Mark Braverman, Subhash Khot, Yang Liu, Dor Minzer, Kunal Mittal |
| 2026 | STOC | A Dichotomy Theorem for Multi-pass Streaming CSPs. | Yumou Fei, Dor Minzer, Shuo Wang |
| 2026 | STOC | 3-Query RLDCs Are Strictly Stronger Than 3-Query LDCs. | Tom Gur, Dor Minzer, Guy Weissenberg, Kai Zhe Zheng |
| 2026 | STOC | Near Optimal Hardness of Approximating k-CSP. | Dor Minzer, Kai Zhe Zheng |
| 2025 | FOCS | On Inverse Theorems and Combinatorial Lines. | Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer |
| 2025 | FOCS | Multi-Pass Streaming Lower Bounds for Approximating Max-Cut. | Yumou Fei, Dor Minzer, Shuo Wang |
| 2025 | FOCS | Improved Round-by-round Soundness IOPs via Reed-Muller Codes. | Dor Minzer, Kai Zhe Zheng |
| 2025 | STOC | Quasi-Linear Size PCPs with Small Soundness from HDX. | Mitali Bafna, Dor Minzer, Nikhil Vyas, Zhiwei Yun |
| 2025 | STOC | Constant Degree Networks for Almost-Everywhere Reliable Transmission. | Mitali Bafna, Dor Minzer |
| 2025 | STOC | Near Optimal Constant Inapproximability under ETH for Fundamental Problems in Parameterized Complexity. | Mitali Bafna, Karthik C. S., Dor Minzer |
| 2025 | STOC | Parallel Repetition for 3-Player XOR Games. | Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer |
| 2025 | STOC | On Approximability of Satisfiable k-CSPs: V. | Amey Bhangale, Subhash Khot, Dor Minzer |
| 2024 | FOCS | Constant Degree Direct Product Testers with Small Soundness. | Mitali Bafna, Noam Lifshitz, Dor Minzer |
| 2024 | FOCS | A Dense Model Theorem for the Boolean Slice. | Gil Kalai, Noam Lifshitz, Dor Minzer, Tamar Ziegler |
| 2024 | SODA | Adversarial Low Degree Testing. | Dor Minzer, Kai Zhe Zheng |
| 2024 | STOC | Characterizing Direct Product Testing via Coboundary Expansion. | Mitali Bafna, Dor Minzer |
| 2024 | STOC | On Approximability of Satisfiable k-CSPs: IV. | Amey Bhangale, Subhash Khot, Dor Minzer |
| 2024 | STOC | Product Mixing in Compact Lie Groups. | David Ellis, Guy Kindler, Noam Lifshitz, Dor Minzer |
| 2024 | STOC | Influences in Mixing Measures. | Frederic Koehler, Noam Lifshitz, Dor Minzer, Elchanan Mossel |
| 2024 | STOC | Near Optimal Alphabet-Soundness Tradeoff PCPs. | Dor Minzer, Kai Zhe Zheng |
| 2023 | FOCS | Parallel Repetition for the GHZ Game: Exponential Decay. | Mark Braverman, Subhash Khot, Dor Minzer |
| 2023 | FOCS | Optimal Testing of Generalized Reed-Muller Codes in Fewer Queries. | Dor Minzer, Kai Zhe Zheng |
| 2023 | SODA | Approaching the Soundness Barrier: A Near Optimal Analysis of the Cube versus Cube Test. | Dor Minzer, Kai Zheng |
| 2023 | STOC | On Approximability of Satisfiable k-CSPs: II. | Amey Bhangale, Subhash Khot, Dor Minzer |
| 2023 | STOC | On Approximability of Satisfiable k-CSPs: III. | Amey Bhangale, Subhash Khot, Dor Minzer |
| 2022 | FOCS | Improved Optimal Testing Results from Global Hypercontractivity. | Tali Kaufman, Dor Minzer |
| 2022 | ICALP | Expander Random Walks: The General Case and Limitations. | Gil Cohen, Dor Minzer, Shir Peleg, Aaron Potechin, Amnon Ta-Shma |
| 2022 | STOC | On approximability of satisfiable | Amey Bhangale, Subhash Khot, Dor Minzer |
| 2022 | STOC | Approximate polymorphisms. | Gilad Chase, Yuval Filmus, Dor Minzer, Elchanan Mossel, Nitin Saurabh |
| 2021 | FOCS | An Invariance Principle for the Multi-slice, with Applications. | Mark Braverman, Subhash Khot, Noam Lifshitz, Dor Minzer |
| 2021 | STOC | New separations results for external information. | Mark Braverman, Dor Minzer |
| 2020 | FOCS | Towards a Proof of the Fourier-Entropy Conjecture? | Esty Kelman, Guy Kindler, Noam Lifshitz, Dor Minzer, Muli Safra |
| 2020 | STOC | AND testing and robust judgement aggregation. | Yuval Filmus, Noam Lifshitz, Dor Minzer, Elchanan Mossel |
| 2019 | FOCS | Noise Sensitivity on the p -Biased Hypercube. | Noam Lifshitz, Dor Minzer |
| 2019 | PODC | Can Distributed Uniformity Testing Be Local? | Uri Meir, Dor Minzer, Rotem Oshman |
| 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 |