default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAaron Bernstein
Person information
- affiliation: Rutgers University, New Brunswick, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Aaron Bernstein:
Improved Bounds for Matching in Random-Order Streams. Theory Comput. Syst. 68(4): 758-772 (2024)- [c36]Aaron Bernstein, Greg Bodwin, Nicole Wein:
Are There Graphs Whose Shortest Path Structure Requires Large Edge Weights? ITCS 2024: 12:1-12:22 - [i24]Aaron Bernstein, Joakim Blikstad, Thatchaphol Saranurak
, Ta-Wei Tu:
Maximum Flow by Augmenting Paths in n2+o(1) Time. CoRR abs/2406.03648 (2024) - [i23]Vikrant Ashvinkumar, Aaron Bernstein, Chengyuan Deng, Jie Gao, Nicole Wein:
Low Sensitivity Hopsets. CoRR abs/2407.10249 (2024) - 2023
- [c35]Sepehr Assadi, Aaron Bernstein, Zachary Langley:
All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method. ITCS 2023: 7:1-7:24 - [c34]Aaron Bernstein, Nicole Wein:
Closing the Gap Between Directed Hopsets and Shortcut Sets. SODA 2023: 163-182 - [i22]Sepehr Assadi, Aaron Bernstein, Zachary Langley:
All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method. CoRR abs/2301.07007 (2023) - [i21]Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, Hsin-Hao Su:
Parallel and Distributed Exact Single-Source Shortest Paths with Negative Edge Weights. CoRR abs/2303.00811 (2023) - [i20]Aaron Bernstein, Greg Bodwin, Nicole Wein:
Are there graphs whose shortest path structure requires large edge weights? CoRR abs/2308.13054 (2023) - 2022
- [j5]Aaron Bernstein, Yann Disser, Martin Groß, Sandra Himburg:
General bounds for incremental maximization. Math. Program. 191(2): 953-979 (2022) - [c33]Aaron Bernstein, Danupon Nanongkai, Christian Wulff-Nilsen:
Negative-Weight Single-Source Shortest Paths in Near-linear Time. FOCS 2022: 600-611 - [c32]Sepehr Assadi, Aaron Bernstein, Aditi Dudeja:
Decremental Matching in General Graphs. ICALP 2022: 11:1-11:19 - [c31]Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun:
Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. ICALP 2022: 20:1-20:20 - [i19]Aaron Bernstein, Danupon Nanongkai, Christian Wulff-Nilsen:
Negative-Weight Single-Source Shortest Paths in Almost-linear Time. CoRR abs/2203.03456 (2022) - [i18]Sepehr Assadi, Aaron Bernstein, Aditi Dudeja:
Decremental Matching in General Graphs. CoRR abs/2207.00927 (2022) - [i17]Aaron Bernstein, Nicole Wein:
Closing the Gap Between Directed Hopsets and Shortcut Sets. CoRR abs/2207.04507 (2022) - [i16]Aaron Bernstein, Shiri Chechik, Sebastian Forster, Tsvi Kopelowitz, Yasamin Nazari, Nicole Wein:
Dynamic Graph Algorithms (Dagstuhl Seminar 22461). Dagstuhl Reports 12(11): 45-65 (2022) - 2021
- [j4]Aaron Bernstein, Sebastian Forster, Monika Henzinger:
A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching. ACM Trans. Algorithms 17(4): 29:1-29:51 (2021) - [c30]Aaron Bernstein, Aditi Dudeja, Seth Pettie:
Incremental SCC Maintenance in Sparse Graphs. ESA 2021: 14:1-14:16 - [c29]Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak:
Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time. FOCS 2021: 1000-1008 - [c28]Aaron Bernstein, Aditi Dudeja, Zachary Langley:
A framework for dynamic matching in weighted graphs. STOC 2021: 668-681 - [i15]Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak:
Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time. CoRR abs/2101.07149 (2021) - 2020
- [c27]Aaron Bernstein, Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
Near-Optimal Decremental SSSP in Dense Weighted Digraphs. FOCS 2020: 1112-1122 - [c26]Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak:
Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing. FOCS 2020: 1123-1134 - [c25]Aaron Bernstein, Aditi Dudeja:
Online Matching with Recourse: Random Edge Arrivals. FSTTCS 2020: 11:1-11:16 - [c24]Aaron Bernstein:
Improved Bounds for Matching in Random-Order Streams. ICALP 2020: 12:1-12:13 - [c23]Sepehr Assadi, Aaron Bernstein, Zachary Langley:
Improved Bounds for Distributed Load Balancing. DISC 2020: 1:1-1:15 - [i14]Aaron Bernstein, Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
Near-Optimal Decremental SSSP in Dense Weighted Digraphs. CoRR abs/2004.04496 (2020) - [i13]Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun:
Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. CoRR abs/2004.08432 (2020) - [i12]Aaron Bernstein:
Improved Bound for Matching in Random-Order Streams. CoRR abs/2005.00417 (2020) - [i11]Sepehr Assadi, Aaron Bernstein, Zachary Langley:
Improved Bounds for Distributed Load Balancing. CoRR abs/2008.04148 (2020) - [i10]Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak:
Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing. CoRR abs/2009.02584 (2020)
2010 – 2019
- 2019
- [j3]Aaron Bernstein, Jacob Holm, Eva Rotenberg:
Online Bipartite Matching with Amortized O(log 2 n) Replacements. J. ACM 66(5): 37:1-37:23 (2019) - [j2]Aaron Bernstein, Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny:
Distance-Preserving Graph Contractions. SIAM J. Discret. Math. 33(3): 1607-1636 (2019) - [c22]Sepehr Assadi, Aaron Bernstein:
Towards a Unified Theory of Sparsification for Matching Problems. SOSA 2019: 11:1-11:20 - [c21]Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, Cliff Stein:
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs. SODA 2019: 1616-1635 - [c20]Aaron Bernstein, Sebastian Forster, Monika Henzinger:
A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching. SODA 2019: 1899-1918 - [c19]Aaron Bernstein, Danupon Nanongkai:
Distributed exact weighted all-pairs shortest paths in near-linear time. STOC 2019: 334-342 - [c18]Aaron Bernstein, Maximilian Probst, Christian Wulff-Nilsen:
Decremental strongly-connected components and single-source reachability in near-linear time. STOC 2019: 365-376 - [i9]Aaron Bernstein, Maximilian Probst, Christian Wulff-Nilsen:
Decremental Strongly-Connected Components and Single-Source Reachability in Near-Linear Time. CoRR abs/1901.03615 (2019) - 2018
- [c17]Aaron Bernstein, Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny:
Distance-Preserving Graph Contractions. ITCS 2018: 51:1-51:14 - [c16]Aaron Bernstein, Shiri Chechik:
Incremental Topological Sort and Cycle Detection in Expected Total Time. SODA 2018: 21-34 - [c15]Aaron Bernstein, Jacob Holm, Eva Rotenberg:
Online Bipartite Matching with Amortized Replacements. SODA 2018: 947-959 - [i8]Aaron Bernstein, Sebastian Forster, Monika Henzinger:
A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching. CoRR abs/1810.10932 (2018) - [i7]Sepehr Assadi, Aaron Bernstein:
Towards a Unified Theory of Sparsification for Matching Problems. CoRR abs/1811.02009 (2018) - [i6]Aaron Bernstein, Danupon Nanongkai:
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time. CoRR abs/1811.03337 (2018) - 2017
- [c14]Aaron Bernstein, Yann Disser, Martin Groß:
General Bounds for Incremental Maximization. ICALP 2017: 43:1-43:14 - [c13]Aaron Bernstein:
Deterministic Partially Dynamic Single Source Shortest Paths in Weighted Graphs. ICALP 2017: 44:1-44:14 - [c12]Aaron Bernstein, Tsvi Kopelowitz, Seth Pettie, Ely Porat, Clifford Stein:
Simultaneously Load Balancing for Every p-norm, With Reassignments. ITCS 2017: 51:1-51:14 - [c11]Aaron Bernstein, Shiri Chechik:
Deterministic Partially Dynamic Single Source Shortest Paths for Sparse Graphs. SODA 2017: 453-469 - [i5]Aaron Bernstein:
Deterministic Partially Dynamic Single Source Shortest Paths in Weighted Graphs. CoRR abs/1705.10097 (2017) - [i4]Aaron Bernstein, Yann Disser, Martin Groß:
General Bounds for Incremental Maximization. CoRR abs/1705.10253 (2017) - [i3]Aaron Bernstein, Jacob Holm, Eva Rotenberg:
Online bipartite matching with amortized $O(\log^2 n)$ replacements. CoRR abs/1707.06063 (2017) - [i2]Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, Cliff Stein:
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs. CoRR abs/1711.03076 (2017) - 2016
- [b1]Aaron Bernstein:
Dynamic Algorithms for Shortest Paths and Matching. Columbia University, USA, 2016 - [j1]Aaron Bernstein:
Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs. SIAM J. Comput. 45(2): 548-574 (2016) - [c10]Aaron Bernstein, Cliff Stein:
Faster Fully Dynamic Matchings with Small Approximation Ratios. SODA 2016: 692-711 - [c9]Aaron Bernstein, Shiri Chechik:
Deterministic decremental single source shortest paths: beyond the o(mn) bound. STOC 2016: 389-397 - [r2]Aaron Bernstein:
Decremental Approximate-APSP in Directed Graphs. Encyclopedia of Algorithms 2016: 509-512 - [r1]Aaron Bernstein:
Dynamic Approximate-APSP. Encyclopedia of Algorithms 2016: 602-605 - 2015
- [c8]Aaron Bernstein, Cliff Stein:
Fully Dynamic Matching in Bipartite Graphs. ICALP (1) 2015: 167-179 - [i1]Aaron Bernstein, Clifford Stein:
Fully Dynamic Matching in Bipartite Graphs. CoRR abs/1506.07076 (2015) - 2013
- [c7]Aaron Bernstein:
Maintaining shortest paths under deletions in weighted directed graphs: [extended abstract]. STOC 2013: 725-734 - 2012
- [c6]Aaron Bernstein:
Near linear time (1 + ε)-approximation for restricted shortest paths in undirected graphs. SODA 2012: 189-201 - 2011
- [c5]Aaron Bernstein, Liam Roditty:
Improved Dynamic Algorithms for Maintaining Approximate Shortest Paths Under Deletions. SODA 2011: 1355-1365 - 2010
- [c4]Aaron Bernstein:
A Nearly Optimal Algorithm for Approximating Replacement Paths and k Shortest Simple Paths in General Graphs. SODA 2010: 742-755
2000 – 2009
- 2009
- [c3]Aaron Bernstein:
Fully Dynamic (2 + epsilon) Approximate All-Pairs Shortest Paths with Fast Query and Close to Linear Update Time. FOCS 2009: 693-702 - [c2]Aaron Bernstein, David R. Karger:
A nearly optimal oracle for avoiding failed vertices and edges. STOC 2009: 101-110 - 2008
- [c1]Aaron Bernstein, David R. Karger:
Improved distance sensitivity oracles via random sampling. SODA 2008: 34-43
Coauthor Index
aka: Maximilian Probst
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-07 02:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
