Dor Minzer

Most-cited papers

Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion
Khot Subhash, Dor Minzer, M. Safra
2018IEEE Annual Symposium on Foundations of Computer Science173 citations
Semantic Scholar
Towards a proof of the 2-to-1 games conjecture?
Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer +1 more
2018Electron. Colloquium Comput. Complex.107 citations
Semantic Scholar
On independent sets, 2-to-2 games, and Grassmann graphs
Subhash Khot, Dor Minzer, M. Safra
2017Electron. Colloquium Comput. Complex.96 citations
Semantic Scholar
On Monotonicity Testing and Boolean Isoperimetric Type Theorems
Subhash Khot, Dor Minzer, M. Safra
2015IEEE Annual Symposium on Foundations of Computer Science94 citations
Semantic Scholar
On non-optimally expanding sets in Grassmann graphs
Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer +1 more
2018Israel Journal of Mathematics71 citations
Semantic Scholar
Hypercontractivity for global functions and sharp thresholds
Peter Keevash, Noam Lifshitz, Eoin Long, Dor Minzer
201945 citations
Semantic Scholar
Quasi-Linear Size PCPs with Small Soundness from HDX
Mitali Bafna, Dor Minzer, Nikhil Vyas, Zhiwei Yun
2024Symposium on the Theory of Computing27 citations Open access
Semantic Scholar
Global hypercontractivity and its applications
Peter Keevash, Noam Lifshitz, Eoin Long, Dor Minzer
202126 citations
Semantic Scholar
Small Set Expansion in The Johnson Graph
Subhash Khot, Dor Minzer, Dana Moshkovitz, S. Safra
2018Electron. Colloquium Comput. Complex.26 citations
Semantic Scholar
An Invariance Principle for the Multi-slice, with Applications
M. Braverman, Subhash Khot, Noam Lifshitz, Dor Minzer
2021IEEE Annual Symposium on Foundations of Computer Science25 citations Open access
Semantic Scholar
On t-intersecting families of permutations
Nathan Keller, Noam Lifshitz, Dor Minzer, Ohad Sheinfeld
2023Advances in Mathematics24 citations Open access
Semantic Scholar
Hypercontractivity on the symmetric group
Yuval Filmus, Guy Kindler, Noam Lifshitz, Dor Minzer
2020Forum of Mathematics, Sigma24 citations Open access
Semantic Scholar
On approximability of satisfiable k-CSPs: I
Amey Bhangale, Subhash Khot, Dor Minzer
2022Computational Complexity23 citations Open access
Semantic Scholar
On Approximability of Satisfiable k-CSPs: II
Amey Bhangale, Subhash Khot, Dor Minzer
2023Symposium on the Theory of Computing21 citations Open access
Semantic Scholar
Characterizing Direct Product Testing via Coboundary Expansion
Mitali Bafna, Dor Minzer
2023Electron. Colloquium Comput. Complex.21 citations Open access
Semantic Scholar
Constant Degree Direct Product Testers with Small Soundness
Mitali Bafna, Noam Lifshitz, Dor Minzer
2024IEEE Annual Symposium on Foundations of Computer Science19 citations Open access
Semantic Scholar
On Approximability of Satisfiable k-CSPs: III
Amey Bhangale, Subhash Khot, Dor Minzer
2023Symposium on the Theory of Computing19 citations Open access
Semantic Scholar
Forbidden intersections for codes
Peter Keevash, Noam Lifshitz, Eoin Long, Dor Minzer
2021Journal of the London Mathematical Society19 citations Open access
Semantic Scholar
Towards a Proof of the Fourier-Entropy Conjecture?
E. Kelman, Guy Kindler, Noam Lifshitz, Dor Minzer +1 more
2019Geometric and Functional Analysis19 citations Open access
Semantic Scholar
On Rich $2$-to-$1$ Games
M. Braverman, Subhash Khot, Dor Minzer
2019Electron. Colloquium Comput. Complex.19 citations
Semantic Scholar
On the largest product-free subsets of the alternating groups
Peter Keevash, Noam Lifshitz, Dor Minzer
2022Inventiones Mathematicae16 citations Open access
Semantic Scholar
AND testing and robust judgement aggregation
Yuval Filmus, Noam Lifshitz, Dor Minzer, Elchanan Mossel
2019Symposium on the Theory of Computing16 citations Open access
Semantic Scholar
On Approximability of Satisfiable k-CSPs: IV
Amey Bhangale, Subhash Khot, Dor Minzer
2023Electron. Colloquium Comput. Complex.15 citations Open access
Semantic Scholar
Near Optimal Alphabet-Soundness Tradeoff PCPs
Dor Minzer, Kai Zheng
2024Electron. Colloquium Comput. Complex.14 citations Open access
Semantic Scholar
Parallel Repetition for the GHZ Game: Exponential Decay
M. Braverman, Subhash Khot, Dor Minzer
2022IEEE Annual Symposium on Foundations of Computer Science14 citations
Semantic Scholar
Improved Monotonicity Testers via Hypercube Embeddings
M. Braverman, Subhash Khot, Guy Kindler, Dor Minzer
2022Information Technology Convergence and Services13 citations Open access
Semantic Scholar
Improved Optimal Testing Results from Global Hypercontractivity
T. Kaufman, Dor Minzer
2022IEEE Annual Symposium on Foundations of Computer Science13 citations
Semantic Scholar
A Dichotomy Theorem for Multi-pass Streaming CSPs
Yumou Fei, Dor Minzer, Shuo Wang
2025Symposium on the Theory of Computing12 citations Open access
Semantic Scholar
Theorems of KKL, Friedgut, and Talagrand via Random Restrictions and Log-Sobolev Inequality
E. Kelman, Subhash Khot, Guy Kindler, Dor Minzer +1 more
2020Electron. Colloquium Comput. Complex.12 citations
Semantic Scholar
Noise Sensitivity on the p -Biased Hypercube
Noam Lifshitz, Dor Minzer
2019IEEE Annual Symposium on Foundations of Computer Science12 citations
Semantic Scholar
Multi-Pass Streaming Lower Bounds for Approximating Max-Cut
Yumou Fei, Dor Minzer, Shuo Wang
2025IEEE Annual Symposium on Foundations of Computer Science11 citations Open access
Semantic Scholar
Isoperimetric Inequalities Made Simpler
Ronen Eldan, Guy Kindler, Noam Lifshitz, Dor Minzer
2022arXiv.org11 citations Open access
Semantic Scholar
On Approximability of Satisfiable k-CSPs: V
Amey Bhangale, Subhash Khot, Dor Minzer
2024Electron. Colloquium Comput. Complex.9 citations Open access
Semantic Scholar
Product mixing in compact Lie groups
David Ellis, Guy Kindler, Noam Lifshitz, Dor Minzer
2023Electron. Colloquium Comput. Complex.9 citations
Semantic Scholar
On Monotonicity Testing and the 2-to-2 Games Conjecture
Dor Minzer
2022ACM Books9 citations
Semantic Scholar
3-Query RLDCs Are Strictly Stronger Than 3-Query LDCs
Tom Gur, Dor Minzer, Guy Weissenberg, Kai Zheng
2025Symposium on the Theory of Computing8 citations Open access
Semantic Scholar
NP-Hardness of Almost Coloring Almost 3-Colorable Graphs
Yahli Hecht, Dor Minzer, S. Safra
2023International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques8 citations
Semantic Scholar
Expander Random Walks: The General Case and Limitations
Gil Cohen, Dor Minzer, Shir Peleg, Aaron Potechin +1 more
2021Electron. Colloquium Comput. Complex.8 citations
Semantic Scholar
Near Optimal Constant Inapproximability under ETH for Fundamental Problems in Parameterized Complexity
Mitali Bafna, C. Karthik, Dor Minzer
2025Symposium on the Theory of Computing7 citations Open access
Semantic Scholar
Reasonable Bounds for Combinatorial Lines of Length Three
Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer
2024Electron. Colloquium Comput. Complex.7 citations
Semantic Scholar
Constant Degree Networks for Almost-Everywhere Reliable Transmission
Mitali Bafna, Dor Minzer
2024Symposium on the Theory of Computing7 citations Open access
Semantic Scholar
On Perfectly Friendly Bisections of Random Graphs
Dor Minzer, Ashwin Sah, Mehtaab Sawhney
20237 citations
Semantic Scholar
Optimal Testing of Generalized Reed-Muller Codes in Fewer Queries
Dor Minzer, Kai Zheng
2023IEEE Annual Symposium on Foundations of Computer Science7 citations Open access
Semantic Scholar
Approaching the Soundness Barrier: A Near Optimal Analysis of the Cube versus Cube Test
Dor Minzer, Kai Zheng
2022ACM-SIAM Symposium on Discrete Algorithms7 citations Open access
Semantic Scholar
Optimal tiling of the euclidean space using permutation-symmetric bodies
M. Braverman, Dor Minzer
2021Cybersecurity and Cyberforensics Conference7 citations
Semantic Scholar
Approximate polymorphisms
Gilad Chase, Yuval Filmus, Dor Minzer, Elchanan Mossel +1 more
2021Symposium on the Theory of Computing7 citations Open access
Semantic Scholar
Adversarial Low Degree Testing
Dor Minzer, Kai Zheng
2023ACM-SIAM Symposium on Discrete Algorithms6 citations Open access
Semantic Scholar
Turán Problems for Expanded Hypergraphs
Peter Keevash, Noam Lifshitz, Eoin Long, Dor Minzer
2025Combinatorica5 citations Open access
Semantic Scholar
Near Optimal Hardness of Approximating k-CSP
Dor Minzer, Kai Zheng
2025arXiv.org5 citations
Semantic Scholar
Effective Bounds for Restricted 3-Arithmetic Progressions in Fpn
Amey Bhangale, Subhash Khot, Dor Minzer
2023Electron. Colloquium Comput. Complex.5 citations Open access
Semantic Scholar