Monika Henzinger
where else to find them
what they talk about
where they keep going back
no series more than once — all 2 in the filters
on a stage with
- Antoine El-Hayekonce
- Billy Jinonce
- David Williamsononce
all 5 in the filters
who talks about the same things
- Gillat Kol5 talks
- Michael Kapralov7 talks
- Shay Solomon3 talks
- Mihalis Yannakakis3 talks
- Dmitry Paramonov3 talks
- Dor Minzer8 talks
| title | conference | date |
|---|---|---|
| A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems | ITCS 2023 | 2023-01-10 |
Introduces a dual cut-toggling algorithm for solving Lx = b that mirrors KOSZ: it maintains vertex potentials on a low-stretch spanning tree, samples… | ||
| Asymptotically Tight Bounds on the Time Complexity of Broadcast and its Variants in Dynamic Networks | ITCS 2023 | 2023-01-10 |
Proves that broadcast, k‑broadcast and cover‑of‑size‑k in synchronous adversarial dynamic networks all have asymptotically tight linear worst‑case time. Upper… | ||
| Upper and Lower Bounds for Graph Problems in Computer Aided Verification | Computational Complexity of Low-Polynomial Time Problems (Simons Institute workshop, 2015) | 2015-12-08 |
Defines graph and MDP objectives and proves fine-grained separations: disjunctive reachability on MDPs requires roughly K·M^(2−o(1)) time under triangle/OV… | ||
| nothing matches | ||