default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDor Minzer
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c36]Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer:
Parallel Repetition of k-Player Projection Games. APPROX/RANDOM 2024: 54:1-54:16- [c35]Mitali Bafna, Dor Minzer:
Solving Unique Games over Globally Hypercontractive Graphs. CCC 2024: 3:1-3:15 - [c34]Gil Kalai, Noam Lifshitz, Dor Minzer, Tamar Ziegler:
A Dense Model Theorem for the Boolean Slice. FOCS 2024: 797-805 - [c33]Mitali Bafna, Noam Lifshitz, Dor Minzer:
Constant Degree Direct Product Testers with Small Soundness. FOCS 2024: 862-869 - [c32]Dor Minzer, Kai Zhe Zheng:
Adversarial Low Degree Testing. SODA 2024: 4395-4409 - [c31]Dor Minzer
, Kai Zhe Zheng:
Near Optimal Alphabet-Soundness Tradeoff PCPs. STOC 2024: 15-23 - [c30]Frederic Koehler, Noam Lifshitz, Dor Minzer, Elchanan Mossel:
Influences in Mixing Measures. STOC 2024: 527-536 - [c29]David Ellis, Guy Kindler, Noam Lifshitz, Dor Minzer:
Product Mixing in Compact Lie Groups. STOC 2024: 1415-1422 - [c28]Amey Bhangale, Subhash Khot, Dor Minzer:
On Approximability of Satisfiable k-CSPs: IV. STOC 2024: 1423-1434 - [c27]Mitali Bafna, Dor Minzer:
Characterizing Direct Product Testing via Coboundary Expansion. STOC 2024: 1978-1989 - [i48]David Ellis, Guy Kindler, Noam Lifshitz, Dor Minzer:
Product Mixing in Compact Lie Groups. CoRR abs/2401.15456 (2024) - [i47]Mitali Bafna, Noam Lifshitz, Dor Minzer:
Constant Degree Direct Product Testers with Small Soundness. CoRR abs/2402.00850 (2024) - [i46]Dor Minzer, Kai Zhe Zheng:
Near Optimal Alphabet-Soundness Tradeoff PCPs. CoRR abs/2404.07441 (2024) - [i45]Mitali Bafna, Dor Minzer, Nikhil Vyas:
Quasi-Linear Size PCPs with Small Soundness from HDX. CoRR abs/2407.12762 (2024) - [i44]Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer:
Parallel Repetition for 3-Player XOR Games. CoRR abs/2408.09352 (2024) - [i43]Amey Bhangale, Subhash Khot, Dor Minzer:
On Approximability of Satisfiable k-CSPs: V. CoRR abs/2408.15377 (2024) - [i42]Mitali Bafna, Noam Lifshitz, Dor Minzer:
Constant Degree Direct Product Testers with Small Soundness. Electron. Colloquium Comput. Complex. TR24 (2024) - [i41]Amey Bhangale, Subhash Khot, Dor Minzer:
On Approximability of Satisfiable k-CSPs: V. Electron. Colloquium Comput. Complex. TR24 (2024) - [i40]Dor Minzer, Kai Zhe Zheng:
Near Optimal Alphabet-Soundness Tradeoff PCPs. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c26]Yahli Hecht, Dor Minzer, Muli Safra:
NP-Hardness of Almost Coloring Almost 3-Colorable Graphs. APPROX/RANDOM 2023: 51:1-51:12 - [c25]Dor Minzer, Kai Zhe Zheng:
Optimal Testing of Generalized Reed-Muller Codes in Fewer Queries. FOCS 2023: 206-233 - [c24]Mark Braverman, Subhash Khot, Dor Minzer:
Parallel Repetition for the GHZ Game: Exponential Decay. FOCS 2023: 1337-1341 - [c23]Mark Braverman, Subhash Khot, Guy Kindler, Dor Minzer:
Improved Monotonicity Testers via Hypercube Embeddings. ITCS 2023: 25:1-25:24 - [c22]Mark Braverman, Dor Minzer:
Rounding via Low Dimensional Embeddings. ITCS 2023: 26:1-26:30 - [c21]Dor Minzer, Kai Zheng:
Approaching the Soundness Barrier: A Near Optimal Analysis of the Cube versus Cube Test. SODA 2023: 2761-2776 - [c20]Amey Bhangale, Subhash Khot, Dor Minzer:
On Approximability of Satisfiable k-CSPs: II. STOC 2023: 632-642 - [c19]Amey Bhangale, Subhash Khot, Dor Minzer:
On Approximability of Satisfiable k-CSPs: III. STOC 2023: 643-655 - [i39]Dor Minzer, Kai Zheng:
Optimal Testing of Generalized Reed-Muller Codes in Fewer Queries. CoRR abs/2304.05598 (2023) - [i38]Mitali Bafna, Dor Minzer:
Solving Unique Games over Globally Hypercontractive Graphs. CoRR abs/2304.07284 (2023) - [i37]Frederic Koehler, Noam Lifshitz, Dor Minzer, Elchanan Mossel:
Influences in Mixing Measures. CoRR abs/2307.07625 (2023) - [i36]Amey Bhangale, Subhash Khot, Dor Minzer:
On Approximability of Satisfiable k-CSPs: IV. CoRR abs/2307.16248 (2023) - [i35]Amey Bhangale, Subhash Khot, Dor Minzer:
Effective Bounds for Restricted 3-Arithmetic Progressions in Fpn. CoRR abs/2308.06600 (2023) - [i34]Mitali Bafna, Dor Minzer:
Characterizing Direct Product Testing via Coboundary Expansion. CoRR abs/2308.09668 (2023) - [i33]Dor Minzer, Kai Zhe Zheng:
Adversarial Low Degree Testing. CoRR abs/2308.15441 (2023) - [i32]Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer:
Parallel Repetition of k-Player Projection Games. CoRR abs/2312.04783 (2023) - [i31]Mitali Bafna, Dor Minzer:
Characterizing Direct Product Testing via Coboundary Expansion. Electron. Colloquium Comput. Complex. TR23 (2023) - [i30]Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer:
Parallel Repetition of k-Player Projection Games. Electron. Colloquium Comput. Complex. TR23 (2023) - [i29]Amey Bhangale, Subhash Khot, Dor Minzer:
On Approximability of Satisfiable k-CSPs: III. Electron. Colloquium Comput. Complex. TR23 (2023) - [i28]Amey Bhangale, Subhash Khot, Dor Minzer:
On Approximability of Satisfiable k-CSPs: II. Electron. Colloquium Comput. Complex. TR23 (2023) - [i27]Amey Bhangale, Subhash Khot, Dor Minzer:
On Approximability of Satisfiable k-CSPs: IV. Electron. Colloquium Comput. Complex. TR23 (2023) - [i26]Amey Bhangale, Subhash Khot, Dor Minzer:
Effective Bounds for Restricted $3$-Arithmetic Progressions in $\mathbb{F}_p^n$. Electron. Colloquium Comput. Complex. TR23 (2023) - [i25]David Ellis, Guy Kindler, Noam Lifshitz, Dor Minzer:
Product mixing in compact Lie groups. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [b2]Dor Minzer:
On Monotonicity Testing and the 2-to-2 Games Conjecture. ACM Books 49, ACM 2022, ISBN 978-1-4503-9968-5, pp. 1-218 - [c18]Tali Kaufman, Dor Minzer:
Improved Optimal Testing Results from Global Hypercontractivity. FOCS 2022: 98-109 - [c17]Gil Cohen, Dor Minzer, Shir Peleg, Aaron Potechin, Amnon Ta-Shma:
Expander Random Walks: The General Case and Limitations. ICALP 2022: 43:1-43:18 - [c16]Gilad Chase, Yuval Filmus, Dor Minzer, Elchanan Mossel, Nitin Saurabh:
Approximate polymorphisms. STOC 2022: 195-202 - [c15]Amey Bhangale, Subhash Khot, Dor Minzer:
On approximability of satisfiable k-CSPs: I. STOC 2022: 976-988 - [i24]Tali Kaufman, Dor Minzer:
Improved Optimal Testing Results from Global Hypercontractivity. CoRR abs/2202.08688 (2022) - [i23]Ronen Eldan, Guy Kindler, Noam Lifshitz, Dor Minzer:
Isoperimetric Inequalities Made Simpler. CoRR abs/2204.06686 (2022) - [i22]Mark Braverman, Subhash Khot, Guy Kindler, Dor Minzer:
Improved Monotonicity Testers via Hypercube Embeddings. CoRR abs/2211.09229 (2022) - [i21]Dor Minzer, Kai Zheng:
Approaching the Soundness Barrier: A Near Optimal Analysis of the Cube versus Cube Test. CoRR abs/2211.09341 (2022) - [i20]Mark Braverman, Dor Minzer:
Rounding via Low Dimensional Embeddings. CoRR abs/2211.09729 (2022) - [i19]Mark Braverman, Subhash Khot, Dor Minzer:
Parallel Repetition for the GHZ Game: Exponential Decay. CoRR abs/2211.13741 (2022) - [i18]Amey Bhangale, Subhash Khot, Dor Minzer:
On Approximability of Satisfiable k-CSPs: I. Electron. Colloquium Comput. Complex. TR22 (2022) - [i17]Mark Braverman, Subhash Khot, Dor Minzer:
Parallel Repetition for the GHZ Game: Exponential Decay. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c14]Mark Braverman, Dor Minzer:
Optimal Tiling of the Euclidean Space Using Permutation-Symmetric Bodies. CCC 2021: 5:1-5:48 - [c13]Mark Braverman, Subhash Khot, Noam Lifshitz, Dor Minzer:
An Invariance Principle for the Multi-slice, with Applications. FOCS 2021: 228-236 - [c12]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: 26:1-26:17 - [c11]Mark Braverman, Subhash Khot, Dor Minzer:
On Rich 2-to-1 Games. ITCS 2021: 27:1-27:20 - [c10]Mark Braverman, Dor Minzer:
New separations results for external information. STOC 2021: 248-258 - [i16]Mark Braverman, Dor Minzer:
New Separations Results for External Information. CoRR abs/2103.04049 (2021) - [i15]Gilad Chase, Yuval Filmus, Dor Minzer, Elchanan Mossel, Nitin Saurabh:
Approximate polymorphisms. CoRR abs/2106.00093 (2021) - [i14]Mark Braverman, Subhash Khot, Noam Lifshitz, Dor Minzer:
An Invariance Principle for the Multi-slice, with Applications. CoRR abs/2110.10725 (2021) - [i13]Gil Cohen, Dor Minzer, Shir Peleg, Aaron Potechin, Amnon Ta-Shma:
Expander Random Walks: The General Case and Limitations. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c9]Esty Kelman, Guy Kindler, Noam Lifshitz, Dor Minzer, Muli Safra:
Towards a Proof of the Fourier-Entropy Conjecture? FOCS 2020: 247-258 - [c8]Yuval Filmus, Noam Lifshitz, Dor Minzer, Elchanan Mossel:
AND testing and robust judgement aggregation. STOC 2020: 222-233 - [i12]Yuval Filmus, Guy Kindler, Noam Lifshitz, Dor Minzer:
Hypercontractivity on the symmetric group. CoRR abs/2009.05503 (2020) - [i11]Mark Braverman, Dor Minzer:
Optimal tiling of the Euclidean space using symmetric bodies. CoRR abs/2011.04071 (2020) - [i10]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. TR20 (2020)
2010 – 2019
- 2019
- [c7]Noam Lifshitz, Dor Minzer:
Noise Sensitivity on the p -Biased Hypercube. FOCS 2019: 1205-1226 - [c6]Uri Meir, Dor Minzer, Rotem Oshman:
Can Distributed Uniformity Testing Be Local? PODC 2019: 228-237 - [i9]Yuval Filmus, Noam Lifshitz, Dor Minzer, Elchanan Mossel:
AND Testing and Robust Judgement Aggregation. CoRR abs/1911.00159 (2019) - [i8]Esty Kelman, Guy Kindler, Noam Lifshitz, Dor Minzer, Muli Safra:
Revisiting Bourgain-Kalai and Fourier Entropies. CoRR abs/1911.10579 (2019) - [i7]Mark Braverman, Subhash Khot, Dor Minzer:
On Rich $2$-to-$1$ Games. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [b1]Dor Minzer:
On Monotonicity Testing and the 2-to-2 Games Conjecture. Tel Aviv University, Israel, 2018 - [j1]Subhash Khot, Dor Minzer, Muli Safra:
On Monotonicity Testing and Boolean Isoperimetric-type Theorems. SIAM J. Comput. 47(6): 2238-2276 (2018) - [c5]Subhash Khot, Dor Minzer, Muli Safra:
Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion. FOCS 2018: 592-601 - [c4]Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra:
Towards a proof of the 2-to-1 games conjecture? STOC 2018: 376-389 - [c3]Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra:
On non-optimally expanding sets in Grassmann graphs. STOC 2018: 940-951 - [i6]Subhash Khot, Dor Minzer, Dana Moshkovitz, Muli Safra:
Small Set Expansion in The Johnson Graph. Electron. Colloquium Comput. Complex. TR18 (2018) - [i5]Subhash Khot, Dor Minzer, Muli Safra:
Pseudorandom Sets in Grassmann Graph have Near-Perfect Expansion. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c2]Subhash Khot, Dor Minzer, Muli Safra:
On independent sets, 2-to-2 games, and Grassmann graphs. STOC 2017: 576-589 - [i4]Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra:
On Non-Optimally Expanding Sets in Grassmann Graphs. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i3]Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra:
Towards a Proof of the 2-to-1 Games Conjecture? Electron. Colloquium Comput. Complex. TR16 (2016) - [i2]Subhash Khot, Dor Minzer, Muli Safra:
On Independent Sets, 2-to-2 Games and Grassmann Graphs. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c1]Subhash Khot, Dor Minzer, Muli Safra:
On Monotonicity Testing and Boolean Isoperimetric Type Theorems. FOCS 2015: 52-58 - [i1]Subhash Khot, Dor Minzer, Muli Safra:
On Monotonicity Testing and Boolean Isoperimetric type Theorems. Electron. Colloquium Comput. Complex. TR15 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
