Dor Minzer
where else to find them
no profile links on file
what they talk about
where they keep going back
- ITCS2 editions2021–2023
on a stage with
all 5 in the filters
who talks about the same things
- Subhash Khot3 talks
- Mark Braverman5 talks
- Guy Kindler4 talks
- Yuval Filmus9 talks
- Oded Goldreich4 talks
- Toniann Pitassi5 talks
| title | conference | date |
|---|---|---|
| PCPs and Global Hyper-contractivity 1 | Analysis and TCS Boot Camp 2023 | 2023-06-05 |
Label-cover is formalized with bipartite alphabets and projection constraints and is NP-hard to distinguish full satisfiability from ≤1−ε for constant alphabet… | ||
| PCPs and Global Hyper-contractivity 3 | Analysis and TCS Boot Camp 2023 | 2023-06-05 |
States the Grassmann expansion theorem: any r‑ε global subset of the Grassmann graph has edge expansion tending to 1. Proof framework builds the degree (junta)… | ||
| PCPs and Global Hyper-Contractivity 2 | Analysis and TCS Boot Camp 2023 | 2023-06-05 |
Starts by showing a long-code with a simple noise tester (one coordinate kept with probability 1−ε) that is complete but far too large to be useful, contrasts… | ||
| PCPs and Global Hyper-contractivity 1 | Analysis and TCS Boot Camp 2023 | 2023-06-05 |
Explains that the PCP theorem is recast as a small-alphabet label cover hardness (constant k, gap 1 vs 1−ε), develops the Unique Games Conjecture as the… | ||
| Rounding via Low Dimensional Embeddings | ITCS 2023 | 2023-01-10 |
Shows a concrete rounding scheme using project to R2/R3 and hyperplane-style cuts that deliberately avoid heavy segments, yielding improved max‑cut guarantees… | ||
| Improved Monotonicity Testers via Hypercube Embeddings | ITCS 2023 | 2023-01-10 |
Shows a distance-preserving embedding that reduces monotonicity testing on product domains (p-biased cubes and hypergrids) to the uniform hypercube, so any… | ||
| Theorems of KKL, Friedgut, and Talagrand via Random Restrictions and Log-Sobolev Inequality | ITCS 2021 | 2021-01-06 |
Proves KKL, Friedgut and Talagrand without hypercontractivity by combining random restrictions with a version of the log-Sobolev inequality. Shows that… | ||
| On Rich 2-to-1 Games | ITCS 2021 | 2021-01-06 |
Defines an r-wise rich two-to-one label-cover variant where each left vertex induces a near-uniform distribution over 2-sized partitions of the left alphabet… | ||
| nothing matches | ||