Mark Braverman
where else to find them
what they talk about
where they keep going back
- ITCS2 editions2021–2023
on a stage with
all 6 in the filters
who talks about the same things
- Dor Minzer8 talks
- Subhash Khot3 talks
- Guy Kindler4 talks
- Yuval Filmus9 talks
- Shay Moran6 talks
- Toniann Pitassi5 talks
| title | conference | date |
|---|---|---|
| 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… | ||
| 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… | ||
| Tiered Random Matching Markets: Rank is Proportional to Popularity | ITCS 2021 | 2021-01-06 |
Man-proposing deferred acceptance runs in Θ(n log n) proposals and yields average ranks that scale inversely with public scores: expected rank for an agent is… | ||
| Information Complexity is Computable | Information Theory in Complexity Theory and Combinatorics 2015 | 2015-04-24 |
Proves zero‑error information complexity is algorithmically approximable: given f on n×m and distribution μ produce a δ‑approximation by restricting to… | ||
| nothing matches | ||