Aaron Bernstein
Rutgers, The State University of New Jersey
H-index: 26
North America-United States
Top articles of Aaron Bernstein
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method | arXiv preprint arXiv:2301.07007 | Sepehr Assadi Aaron Bernstein Zachary Langley | 2023/1/17 |
Dynamic Graph Algorithms (Dagstuhl Seminar 22461) | Aaron Bernstein Shiri Chechik Sebastian Forster Tsvi Kopelowitz Yasamin Nazari | 2023 | |
Improved bounds for matching in random-order streams | Theory of Computing Systems | Aaron Bernstein | 2023/12/12 |
Closing the gap between directed hopsets and shortcut sets | Aaron Bernstein Nicole Wein | 2023 | |
Are there graphs whose shortest path structure requires large edge weights? | arXiv preprint arXiv:2308.13054 | Aaron Bernstein Greg Bodwin Nicole Wein | 2023/8/24 |
Dagstuhl Reports, Vol. 12, Issue 11 ISSN 2192-5283 | Dilian Gurov Reiner Hähnle Marieke Huisman Giles Reger Christian Lidström | 2023/5 | |
Parallel and distributed exact single-source shortest paths with negative edge weights | arXiv preprint arXiv:2303.00811 | Vikrant Ashvinkumar Aaron Bernstein Nairen Cao Christoph Grunau Bernhard Haeupler | 2023/3/1 |
Deterministic decremental sssp and approximate min-cost flow in almost-linear time | Aaron Bernstein Maximilian Probst Gutenberg Thatchaphol Saranurak | 2022/2/7 | |
General bounds for incremental maximization | Mathematical Programming | Aaron Bernstein Yann Disser Martin Groß Sandra Himburg | 2022/2 |
Negative-weight single-source shortest paths in near-linear time | Aaron Bernstein Danupon Nanongkai Christian Wulff-Nilsen | 2022/10/31 | |
Decremental matching in general graphs | arXiv preprint arXiv:2207.00927 | Sepehr Assadi Aaron Bernstein Aditi Dudeja | 2022/7/3 |
A deamortization approach for dynamic spanner and dynamic maximal matching | ACM Transactions on Algorithms (TALG) | Aaron Bernstein Sebastian Forster Monika Henzinger | 2021/10/4 |
A framework for dynamic matching in weighted graphs | Aaron Bernstein Aditi Dudeja Zachary Langley | 2021/6/15 | |
Distributed exact weighted all-pairs shortest paths in randomized near-linear time | Chien-Chung Huang Danupon Nanongkai Thatchaphol Saranurak | 2017/10/15 | |
Incremental scc maintenance in sparse graphs | 29th Annual European Symposium on Algorithms (ESA 2021) | Aaron Bernstein Aditi Dudeja Seth Pettie | 2021/1 |
Deterministic decremental reachability, scc, and shortest paths via directed expanders and congestion balancing | Aaron Bernstein Maximilian Probst Gutenberg Thatchaphol Saranurak | 2020/11/16 | |
Near-optimal decremental SSSP in dense weighted digraphs | Aaron Bernstein Maximilian Probst Gutenberg Christian Wulff-Nilsen | 2020/11/16 | |
Improved bounds for distributed load balancing | arXiv preprint arXiv:2008.04148 | Sepehr Assadi Aaron Bernstein Zachary Langley | 2020/8/10 |
Fully-dynamic graph sparsifiers against an adaptive adversary | arXiv preprint arXiv:2004.08432 | Aaron Bernstein Jan van den Brand Maximilian Probst Gutenberg Danupon Nanongkai Thatchaphol Saranurak | 2020/4/17 |
Online matching with recourse: random edge arrivals | Aaron Bernstein Aditi Dudeja | 2020 |
