Mihalis Yannakakis
where else to find them
no profile links on file
what they talk about
their talks carry no tags yet
where they keep going back
- ITCS2 editions2021–2023
on a stage with
who talks about the same things
- Christos Papadimitriou13 talks
- Mark Braverman5 talks
- Vijay V. Vazirani4 talks
- Michael Kapralov7 talks
- Dor Minzer8 talks
- Toniann Pitassi5 talks
| title | conference | date |
|---|---|---|
| Extremal Combinatorics, iterated pigeonhole arguments, and generalizations of PPP | ITCS 2023 | 2023-01-10 |
Paper defines a two-player long choice game on 2^n pigeons whose iterated-majority argument yields class PLC; it reduces the classic pigeonhole circuit (PPP)… | ||
| Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets | ITCS 2021 | 2021-01-06 |
Shows that computing exact HZ equilibria requires nonlinear fixed points by giving a unique irrational 4×4 instance (root of 17) and proves exact computation… | ||
| Algorithms for Multityped Branching Processes | Computational Theories of Evolution | 2014-03-17 |
Algorithms compute the extinction probabilities of multitype branching processes by solving the monotone system of probabilistic polynomial fixed‑point… | ||
| nothing matches | ||