Omri Weinstein
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 4 in the filters
on a stage with
- Binghui Pengonce
- Jan van den Brandonce
- Zhao Songonce
who talks about the same things
- Binghui Peng4 talks
- Jan van den Brand2 talks
- Zhao Song2 talks
- Mark Braverman5 talks
- Omer Reingold5 talks
- Udi Wieder2 talks
| title | conference | date |
|---|---|---|
| Accelerating the Multiplicative-Weights Framework for Graph Linear Programs | Dynamic Graphs and Algorithm Design (Simons Institute, 2023) | 2023-09-18 |
Replaces the standard Min-Inner-Product shortest-path oracle with a packing Min-IP oracle that returns a maximally-disjoint set of short paths (like blocking… | ||
| Training (Overparametrized) Neural Networks in Near-Linear Time | ITCS 2021 | 2021-01-06 |
Proves that training two‑layer ReLU networks with width m and n samples runs in near‑linear time by replacing the costly J J^T computation (previously Ω(m… | ||
| Static Data Structure Lower Bounds Imply Rigidity | Interactive Complexity 2018 | 2018-10-15 |
A formal connection proves that hard linear static data-structure problems correspond to rigid matrices by relating outer dimension (data-structure complexity)… | ||
| Welfare Maximization with Limited Interaction: Information and Communication in Economics | Information Theory in Complexity Theory and Combinatorics 2015 | 2015-04-24 |
Proves a round-vs-communication lower bound for multi-party matching: with B bits per player per round and R fixed rounds any protocol only achieves an… | ||
| nothing matches | ||