Towards a Proof of the 2-to-1 Games Conjecture? - Irit Dinur; Subhash Khot; Guy Kindler; Dor Minzer; Muli Safra (Electron. Colloquium Comput. Complex., 2016)

On Independent Sets, 2-to-2 Games and Grassmann Graphs. - Subhash Khot; Dor Minzer; Muli Safra (Electron. Colloquium Comput. Complex., 2016)

On Non-Optimally Expanding Sets in Grassmann Graphs. - Irit Dinur; Subhash Khot; Guy Kindler; Dor Minzer; Muli Safra (Electron. Colloquium Comput. Complex., 2017)

Small Set Expansion in The Johnson Graph. - Subhash Khot; Dor Minzer; Dana Moshkovitz; Muli Safra (Electron. Colloquium Comput. Complex., 2018)

Pseudorandom Sets in Grassmann Graph have Near-Perfect Expansion. - Subhash Khot; Dor Minzer; Muli Safra (Electron. Colloquium Comput. Complex., 2018)

On Monotonicity Testing and Boolean Isoperimetric-type Theorems. - Subhash Khot; Dor Minzer; Muli Safra (SIAM J. Comput., 2018)

On Monotonicity Testing and the 2-to-2 Games Conjecture - Dor Minzer (2018)

Noise Sensitivity on the p -Biased Hypercube. - Noam Lifshitz; Dor Minzer (FOCS, 2019)

Can Distributed Uniformity Testing Be Local? - Uri Meir; Dor Minzer; Rotem Oshman (PODC, 2019)

Revisiting Bourgain-Kalai and Fourier Entropies. - Esty Kelman; Guy Kindler; Noam Lifshitz; Dor Minzer; Muli Safra (CoRR, 2019)

On Rich $2$-to-$1$ Games. - Mark Braverman; Subhash Khot; Dor Minzer (Electron. Colloquium Comput. Complex., 2019)

Towards a Proof of the Fourier-Entropy Conjecture? - Esty Kelman; Guy Kindler; Noam Lifshitz; Dor Minzer; Muli Safra (FOCS, 2020)

AND testing and robust judgement aggregation. - Yuval Filmus; Noam Lifshitz; Dor Minzer; Elchanan Mossel (STOC, 2020)

Hypercontractivity on the symmetric group. - Yuval Filmus; Guy Kindler; Noam Lifshitz; Dor Minzer (CoRR, 2020)

Optimal tiling of the Euclidean space using symmetric bodies. - Mark Braverman; Dor Minzer (CoRR, 2020)

Theorems of KKL, Friedgut, and Talagrand via Random Restrictions and Log-Sobolev Inequality. - Esty Kelman; Subhash Khot; Guy Kindler; Dor Minzer; Muli Safra (Electron. Colloquium Comput. Complex., 2020)

Optimal Tiling of the Euclidean Space Using Permutation-Symmetric Bodies. - Mark Braverman; Dor Minzer (CCC, 2021)

An Invariance Principle for the Multi-slice, with Applications. - Mark Braverman; Subhash Khot; Noam Lifshitz; Dor Minzer (FOCS, 2021)

New separations results for external information. - Mark Braverman; Dor Minzer (STOC, 2021)

Expander Random Walks: The General Case and Limitations. - Gil Cohen; Dor Minzer; Shir Peleg; Aaron Potechin; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2021)

On Monotonicity Testing and the 2-to-2 Games Conjecture - Dor Minzer (ACM, 2022)

Approximate polymorphisms. - Gilad Chase; Yuval Filmus; Dor Minzer; Elchanan Mossel; Nitin Saurabh (STOC, 2022)

Isoperimetric Inequalities Made Simpler. - Ronen Eldan; Guy Kindler; Noam Lifshitz; Dor Minzer (CoRR, 2022)

On Approximability of Satisfiable k-CSPs: I. - Amey Bhangale; Subhash Khot; Dor Minzer (Electron. Colloquium Comput. Complex., 2022)

Parallel Repetition for the GHZ Game: Exponential Decay. - Mark Braverman; Subhash Khot; Dor Minzer (Electron. Colloquium Comput. Complex., 2022)

NP-Hardness of Almost Coloring Almost 3-Colorable Graphs. - Yahli Hecht; Dor Minzer; Muli Safra (APPROX/RANDOM, 2023)

Optimal Testing of Generalized Reed-Muller Codes in Fewer Queries. - Dor Minzer; Kai Zhe Zheng (FOCS, 2023)

Improved Monotonicity Testers via Hypercube Embeddings. - Mark Braverman; Subhash Khot; Guy Kindler; Dor Minzer (ITCS, 2023)

Rounding via Low Dimensional Embeddings. - Mark Braverman; Dor Minzer (ITCS, 2023)

Approaching the Soundness Barrier: A Near Optimal Analysis of the Cube versus Cube Test. - Dor Minzer; Kai Zheng (SODA, 2023)

On Approximability of Satisfiable k-CSPs: II. - Amey Bhangale; Subhash Khot; Dor Minzer (STOC, 2023)

On Approximability of Satisfiable k-CSPs: III. - Amey Bhangale; Subhash Khot; Dor Minzer (STOC, 2023)

Optimal Testing of Generalized Reed-Muller Codes in Fewer Queries. - Dor Minzer; Kai Zheng (CoRR, 2023)

Effective Bounds for Restricted 3-Arithmetic Progressions in Fpn. - Amey Bhangale; Subhash Khot; Dor Minzer (CoRR, 2023)

Characterizing Direct Product Testing via Coboundary Expansion. - Mitali Bafna; Dor Minzer (Electron. Colloquium Comput. Complex., 2023)

Parallel Repetition of k-Player Projection Games. - Amey Bhangale; Mark Braverman; Subhash Khot; Yang P. Liu; Dor Minzer (Electron. Colloquium Comput. Complex., 2023)

On Approximability of Satisfiable k-CSPs: III. - Amey Bhangale; Subhash Khot; Dor Minzer (Electron. Colloquium Comput. Complex., 2023)

On Approximability of Satisfiable k-CSPs: II. - Amey Bhangale; Subhash Khot; Dor Minzer (Electron. Colloquium Comput. Complex., 2023)

On Approximability of Satisfiable k-CSPs: IV. - Amey Bhangale; Subhash Khot; Dor Minzer (Electron. Colloquium Comput. Complex., 2023)

Effective Bounds for Restricted $3$-Arithmetic Progressions in $ mathbb{F}_p^n$. - Amey Bhangale; Subhash Khot; Dor Minzer (Electron. Colloquium Comput. Complex., 2023)

Product mixing in compact Lie groups. - David Ellis; Guy Kindler; Noam Lifshitz; Dor Minzer (Electron. Colloquium Comput. Complex., 2023)

Solving Unique Games over Globally Hypercontractive Graphs. - Mitali Bafna; Dor Minzer (CCC, 2024)

A Dense Model Theorem for the Boolean Slice. - Gil Kalai; Noam Lifshitz; Dor Minzer; Tamar Ziegler (FOCS, 2024)

Adversarial Low Degree Testing. - Dor Minzer; Kai Zhe Zheng (SODA, 2024)

Influences in Mixing Measures. - Frederic Koehler; Noam Lifshitz; Dor Minzer; Elchanan Mossel (STOC, 2024)

Quasi-Linear Size PCPs with Small Soundness from HDX. - Mitali Bafna; Dor Minzer; Nikhil Vyas 001 (CoRR, 2024)

On Approximability of Satisfiable k-CSPs: VI. - Amey Bhangale; Subhash Khot; Yang P. Liu; Dor Minzer (CoRR, 2024)

On Approximability of Satisfiable k-CSPs: VII. - Amey Bhangale; Subhash Khot; Yang P. Liu; Dor Minzer (CoRR, 2024)

Constant Degree Direct Product Testers with Small Soundness. - Mitali Bafna; Noam Lifshitz; Dor Minzer (Electron. Colloquium Comput. Complex., 2024)

On Approximability of Satisfiable k-CSPs: VI. - Amey Bhangale; Subhash Khot; Yang P. Liu; Dor Minzer (Electron. Colloquium Comput. Complex., 2024)

On Approximability of Satisfiable k-CSPs: VII. - Amey Bhangale; Subhash Khot; Yang P. Liu; Dor Minzer (Electron. Colloquium Comput. Complex., 2024)

Reasonable Bounds for Combinatorial Lines of Length Three. - Amey Bhangale; Subhash Khot; Yang P. Liu; Dor Minzer (Electron. Colloquium Comput. Complex., 2024)

On Approximability of Satisfiable k-CSPs: V. - Amey Bhangale; Subhash Khot; Dor Minzer (Electron. Colloquium Comput. Complex., 2024)

Near Optimal Alphabet-Soundness Tradeoff PCPs. - Dor Minzer; Kai Zhe Zheng (Electron. Colloquium Comput. Complex., 2024)

Quasi-Linear Size PCPs with Small Soundness from HDX. - Mitali Bafna; Dor Minzer; Nikhil Vyas 001; Zhiwei Yun (STOC, 2025)

Constant Degree Networks for Almost-Everywhere Reliable Transmission. - Mitali Bafna; Dor Minzer (STOC, 2025)

Near Optimal Constant Inapproximability under ETH for Fundamental Problems in Parameterized Complexity. - Mitali Bafna; Karthik C. S. 001; Dor Minzer (STOC, 2025)

Parallel Repetition for 3-Player XOR Games. - Amey Bhangale; Mark Braverman; Subhash Khot; Yang P. Liu; Dor Minzer (Electron. Colloquium Comput. Complex., 2025)

Improved Round-by-round Soundness IOPs via Reed-Muller Codes. - Dor Minzer; Kai Zhe Zheng (IACR Cryptol. ePrint Arch., 2025)

Improved Optimal Testing Results from Global Hypercontractivity. - Tali Kaufman; Dor Minzer (SIAM J. Comput., 2025)

Multi-Pass Streaming Lower Bounds for Approximating Max-Cut. - Yumou Fei; Dor Minzer; Shuo Wang (CoRR, 2025)

Turán Problems for Expanded Hypergraphs. - Peter Keevash; Noam Lifshitz; Eoin Long; Dor Minzer (Comb., 2025)

On approximability of Satisfiable k-CSPs: I. - Amey Bhangale; Subhash Khot; Dor Minzer (Comput. Complex., 2025)