Dor Minzer

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 80

Top Topics

Euclidean Space

Solving Constraint Satisfaction Problems

Exponential Decay

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Mitali Bafna, Dor Minzer
Characterizing Direct Product Testing via Coboundary Expansion. STOC (2024)
Frederic Koehler, Noam Lifshitz, Dor Minzer, Elchanan Mossel
Influences in Mixing Measures. STOC (2024)
David Ellis, Guy Kindler, Noam Lifshitz, Dor Minzer
Product Mixing in Compact Lie Groups. CoRR (2024)
Mitali Bafna, Noam Lifshitz, Dor Minzer
Constant Degree Direct Product Testers with Small Soundness. Electron. Colloquium Comput. Complex. (2024)
Mitali Bafna, Dor Minzer, Nikhil Vyas
Quasi-Linear Size PCPs with Small Soundness from HDX. CoRR (2024)
Dor Minzer, Kai Zhe Zheng
Near Optimal Alphabet-Soundness Tradeoff PCPs. CoRR (2024)
Mitali Bafna, Noam Lifshitz, Dor Minzer
Constant Degree Direct Product Testers with Small Soundness. CoRR (2024)
Mitali Bafna, Dor Minzer
Solving Unique Games over Globally Hypercontractive Graphs. CCC (2024)
Dor Minzer, Kai Zhe Zheng
Adversarial Low Degree Testing. SODA (2024)
Dor Minzer, Kai Zhe Zheng
Near Optimal Alphabet-Soundness Tradeoff PCPs. STOC (2024)
David Ellis, Guy Kindler, Noam Lifshitz, Dor Minzer
Product Mixing in Compact Lie Groups. STOC (2024)
Dor Minzer, Kai Zhe Zheng
Near Optimal Alphabet-Soundness Tradeoff PCPs. Electron. Colloquium Comput. Complex. (2024)
Amey Bhangale, Subhash Khot, Dor Minzer
On Approximability of Satisfiable k-CSPs: IV. STOC (2024)
Mark Braverman, Subhash Khot, Guy Kindler, Dor Minzer
Improved Monotonicity Testers via Hypercube Embeddings. ITCS (2023)
Amey Bhangale, Subhash Khot, Dor Minzer
-CSPs: II. Electron. Colloquium Comput. Complex. (2023)
David Ellis, Guy Kindler, Noam Lifshitz, Dor Minzer
Product mixing in compact Lie groups. Electron. Colloquium Comput. Complex. (2023)
Yahli Hecht, Dor Minzer, Muli Safra
NP-Hardness of Almost Coloring Almost 3-Colorable Graphs. APPROX/RANDOM (2023)
Dor Minzer, Kai Zheng
Optimal Testing of Generalized Reed-Muller Codes in Fewer Queries. CoRR (2023)
Amey Bhangale, Subhash Khot, Dor Minzer
On Approximability of Satisfiable k-CSPs: II. STOC (2023)
Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer
Parallel Repetition of k-Player Projection Games. CoRR (2023)
Mark Braverman, Subhash Khot, Dor Minzer
Parallel Repetition for the GHZ Game: Exponential Decay. FOCS (2023)
Amey Bhangale, Subhash Khot, Dor Minzer
On Approximability of Satisfiable k-CSPs: IV. Electron. Colloquium Comput. Complex. (2023)
Dor Minzer, Kai Zhe Zheng
Optimal Testing of Generalized Reed-Muller Codes in Fewer Queries. FOCS (2023)
Amey Bhangale, Subhash Khot, Dor Minzer
Effective Bounds for Restricted $3$-Arithmetic Progressions in $\mathbb{F}_p^n$. Electron. Colloquium Comput. Complex. (2023)
Amey Bhangale, Subhash Khot, Dor Minzer
On Approximability of Satisfiable k-CSPs: III. STOC (2023)
Mark Braverman, Dor Minzer
Rounding via Low Dimensional Embeddings. ITCS (2023)
Amey Bhangale, Subhash Khot, Dor Minzer
-CSPs: III. Electron. Colloquium Comput. Complex. (2023)
Dor Minzer, Kai Zheng
Approaching the Soundness Barrier: A Near Optimal Analysis of the Cube versus Cube Test. SODA (2023)
Mitali Bafna, Dor Minzer
Characterizing Direct Product Testing via Coboundary Expansion. Electron. Colloquium Comput. Complex. (2023)
Amey Bhangale, Subhash Khot, Dor Minzer
. CoRR (2023)
Mitali Bafna, Dor Minzer
Solving Unique Games over Globally Hypercontractive Graphs. CoRR (2023)
Amey Bhangale, Subhash Khot, Dor Minzer
On Approximability of Satisfiable k-CSPs: IV. CoRR (2023)
Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer
Parallel Repetition of k-Player Projection Games. Electron. Colloquium Comput. Complex. (2023)
Dor Minzer, Kai Zhe Zheng
Adversarial Low Degree Testing. CoRR (2023)
Mitali Bafna, Dor Minzer
Characterizing Direct Product Testing via Coboundary Expansion. CoRR (2023)
Frederic Koehler, Noam Lifshitz, Dor Minzer, Elchanan Mossel
Influences in Mixing Measures. CoRR (2023)
Ronen Eldan, Guy Kindler, Noam Lifshitz, Dor Minzer
Isoperimetric Inequalities Made Simpler. CoRR (2022)
Mark Braverman, Subhash Khot, Dor Minzer
Parallel Repetition for the GHZ Game: Exponential Decay. Electron. Colloquium Comput. Complex. (2022)
Mark Braverman, Subhash Khot, Noam Lifshitz, Dor Minzer
An Invariance Principle for the Multi-slice, with Applications. FOCS (2022)
Mark Braverman, Subhash Khot, Dor Minzer
Parallel Repetition for the GHZ Game: Exponential Decay. CoRR (2022)
Mark Braverman, Subhash Khot, Guy Kindler, Dor Minzer
Improved Monotonicity Testers via Hypercube Embeddings. CoRR (2022)
Gilad Chase, Yuval Filmus, Dor Minzer, Elchanan Mossel, Nitin Saurabh
Approximate polymorphisms. STOC (2022)
Tali Kaufman, Dor Minzer
Improved Optimal Testing Results from Global Hypercontractivity. CoRR (2022)
Amey Bhangale, Subhash Khot, Dor Minzer
-CSPs: I. STOC (2022)
Dor Minzer, Kai Zheng
Approaching the Soundness Barrier: A Near Optimal Analysis of the Cube versus Cube Test. CoRR (2022)
Amey Bhangale, Subhash Khot, Dor Minzer
-CSPs: I. Electron. Colloquium Comput. Complex. (2022)
Tali Kaufman, Dor Minzer
Improved Optimal Testing Results from Global Hypercontractivity. FOCS (2022)
Gil Cohen, Dor Minzer, Shir Peleg, Aaron Potechin, Amnon Ta-Shma
Expander Random Walks: The General Case and Limitations. ICALP (2022)
Mark Braverman, Dor Minzer
Rounding via Low Dimensional Embeddings. CoRR (2022)
Mark Braverman, Subhash Khot, Noam Lifshitz, Dor Minzer
An Invariance Principle for the Multi-slice, with Applications. CoRR (2021)
Mark Braverman, Dor Minzer
New Separations Results for External Information. CoRR (2021)
Esty Kelman, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra
Theorems of KKL, Friedgut, and Talagrand via Random Restrictions and Log-Sobolev Inequality. ITCS (2021)
Gilad Chase, Yuval Filmus, Dor Minzer, Elchanan Mossel, Nitin Saurabh
Approximate polymorphisms. CoRR (2021)
Mark Braverman, Subhash Khot, Dor Minzer
On Rich 2-to-1 Games. ITCS (2021)
Mark Braverman, Dor Minzer
Optimal Tiling of the Euclidean Space Using Permutation-Symmetric Bodies. Computational Complexity Conference (2021)
Mark Braverman, Subhash Khot, Noam Lifshitz, Dor Minzer
An Invariance Principle for the Multi-slice, with Applications. FOCS (2021)
Gil Cohen, Dor Minzer, Shir Peleg, Aaron Potechin, Amnon Ta-Shma
Expander Random Walks: The General Case and Limitations. Electron. Colloquium Comput. Complex. 28 (2021)
Mark Braverman, Dor Minzer
New separations results for external information. STOC (2021)
Mark Braverman, Dor Minzer
Optimal tiling of the Euclidean space using symmetric bodies. CoRR (2020)
Esty Kelman, Guy Kindler, Noam Lifshitz, Dor Minzer, Muli Safra
Towards a Proof of the Fourier-Entropy Conjecture? FOCS (2020)
Yuval Filmus, Noam Lifshitz, Dor Minzer, Elchanan Mossel
AND testing and robust judgement aggregation. STOC (2020)
Yuval Filmus, Guy Kindler, Noam Lifshitz, Dor Minzer
Hypercontractivity on the symmetric group. CoRR (2020)
Esty Kelman, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra
Theorems of KKL, Friedgut, and Talagrand via Random Restrictions and Log-Sobolev Inequality. Electron. Colloquium Comput. Complex. 27 (2020)
Uri Meir, Dor Minzer, Rotem Oshman
Can Distributed Uniformity Testing Be Local? PODC (2019)
Esty Kelman, Guy Kindler, Noam Lifshitz, Dor Minzer, Muli Safra
Revisiting Bourgain-Kalai and Fourier Entropies. CoRR (2019)
Mark Braverman, Subhash Khot, Dor Minzer
On Rich $2$-to-$1$ Games. Electron. Colloquium Comput. Complex. 26 (2019)
Noam Lifshitz, Dor Minzer
Noise Sensitivity on the p -Biased Hypercube. FOCS (2019)
Yuval Filmus, Noam Lifshitz, Dor Minzer, Elchanan Mossel
AND Testing and Robust Judgement Aggregation. CoRR (2019)
Subhash Khot, Dor Minzer, Muli Safra
Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion. FOCS (2018)
Subhash Khot, Dor Minzer, Muli Safra
On Monotonicity Testing and Boolean Isoperimetric-type Theorems. SIAM J. Comput. 47 (6) (2018)
Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra
On non-optimally expanding sets in Grassmann graphs. STOC (2018)
Subhash Khot, Dor Minzer, Dana Moshkovitz, Muli Safra
Small Set Expansion in The Johnson Graph. Electron. Colloquium Comput. Complex. 25 (2018)
Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra
Towards a proof of the 2-to-1 games conjecture? STOC (2018)
Subhash Khot, Dor Minzer, Muli Safra
Pseudorandom Sets in Grassmann Graph have Near-Perfect Expansion. Electron. Colloquium Comput. Complex. 25 (2018)
Subhash Khot, Dor Minzer, Muli Safra
On independent sets, 2-to-2 games, and Grassmann graphs. STOC (2017)
Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra
On Non-Optimally Expanding Sets in Grassmann Graphs. Electron. Colloquium Comput. Complex. 24 (2017)
Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra
Towards a Proof of the 2-to-1 Games Conjecture? Electron. Colloquium Comput. Complex. 23 (2016)
Subhash Khot, Dor Minzer, Muli Safra
On Independent Sets, 2-to-2 Games and Grassmann Graphs. Electron. Colloquium Comput. Complex. 23 (2016)
Subhash Khot, Dor Minzer, Muli Safra
On Monotonicity Testing and Boolean Isoperimetric Type Theorems. FOCS (2015)
Subhash Khot, Dor Minzer, Muli Safra
On Monotonicity Testing and Boolean Isoperimetric type Theorems. Electron. Colloquium Comput. Complex. 22 (2015)