Aaron Bernstein
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 2 in the filters
on a stage with
- Sepehr Assadionce
- Zachary Langleyonce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Decremental Shortest Paths against an Adaptive Adversary | Dynamic Graphs and Algorithm Design (Simons Institute, 2023) | 2023-09-18 |
Claims a near-optimal deterministic decremental single-source shortest paths data structure that removes the oblivious-adversary assumption and achieves… | ||
| All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method | ITCS 2023 | 2023-01-10 |
Algorithm gives a semi-streaming (O~(n) space) method that uses the multiplicative weights update method to reduce all-norm load balancing to an oracle solved… | ||
| nothing matches | ||