Irit Dveer Dinur
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 6 in the filters
on a stage with
- Madhur Tulsianionce
- Prahladh Harshaonce
- Yuval Filmusonce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Codes with the multiplication property | Advances in the Theory of Error-Correcting Codes | 2024-04-08 |
Constructs LDPC codes on a triangle complex built from coset-style groups over F_p[t]/(irreducible of degree n), embedding each triangle as a point in F_p^{9n}… | ||
| High-Dimensional Expanders 1 | Analysis and TCS Boot Camp 2023 | 2023-06-05 |
Defines a d-dimensional lambda link expander: every link (neighborhood of a face) has 1-skeleton with spectral gap ≤ lambda, and shows this local property… | ||
| High-Dimensional Expanders 2 | Analysis and TCS Boot Camp 2023 | 2023-06-05 |
Proves a concrete local‑to‑global claim: link expander ⇒ random‑walk expander by rewriting the upper walk as an expectation over links, bounding Mi+⟨f,f⟩ by… | ||
| Constraint Satisfaction and Expansion | 50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing | 2021-02-11 |
PCP-based reductions produce instances whose value is either 1 or bounded away from 1 (classically 7/8 for 3-SAT), using two routes: an algebraic encoding into… | ||
| Explicit SoS lower bounds from high-dimensional expanders | ITCS 2021 | 2021-01-06 |
Constructs deterministic, polynomial-time Max-3-XOR instances from Ramanujan complexes whose true optimum is at most 1 − μ (μ a fixed constant, e.g. ~0.1) yet… | ||
| Crash Course on Probabilistically Checkable Proofs (PCP): Introduction | Probability, Geometry, and Computation in High Dimensions Boot Camp (Simons Institute, Fall 2020) | 2020-08-19 |
Crash-course claim: NP languages admit a randomized verifier that reads O(1) proof bits after tossing O(log n) coins, so a polynomial-time reduction maps any… | ||
| Crash Course on Probabilistically Checkable Proofs (PCP): Parallel Repetition | Probability, Geometry, and Computation in High Dimensions Boot Camp (Simons Institute, Fall 2020) | 2020-08-19 |
Parallel repetition takes a projection game and tensorizes it so questions are d-tuples; the basic PCP route uses this to amplify a 1 versus 1−ε gap to 1… | ||
| Direct Products and Parallel Repetition | Quantum Games and Protocols | 2014-02-24 |
Proves an exponential parallel-repetition bound for projection games with entanglement: if the entangled value is 1 − ε then the k-fold repeated entangled… | ||
| nothing matches | ||