Aaron Bernstein

Available identifiers

zbMath Open bernstein.aaronMaRDI QIDQ2118103

List of research outcomes

Publication	Date of Publication	Type
Improved bounds for matching in random-order streams	2024-10-07	Paper
All-norm load balancing in graph streams via the multiplicative weights update method	2024-09-25	Paper
Towards a unified theory of sparsification for matching problems	2024-08-26	Paper
Decremental matching in general graphs	2024-06-24	Paper
Fully-dynamic graph sparsifiers against an adaptive adversary	2024-06-24	Paper
Closing the gap between directed hopsets and shortcut sets	2024-05-14	Paper
A framework for dynamic matching in weighted graphs	2023-11-14	Paper
Improved bounds for distributed load balancing	2023-11-02	Paper
Incremental SCC maintenance in sparse graphs	2023-09-20	Paper
General bounds for incremental maximization	2022-03-22	Paper
A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching	2022-02-22	Paper
Decremental strongly connected components and single-source reachability in near-linear time	2022-01-07	Paper
Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time	2022-01-07	Paper
Distance-Preserving Graph Contractions	2021-06-15	Paper
https://portal.mardi4nfdi.de/entity/Q5111375	2020-05-27	Paper
General bounds for incremental maximization	2020-05-27	Paper
Online bipartite matching with amortized \(O(\log^2 n)\) replacements	2020-02-11	Paper
Decremental strongly-connected components and single-source reachability in near-linear time	2020-01-30	Paper
Distributed exact weighted all-pairs shortest paths in near-linear time	2020-01-30	Paper
A deamortization approach for dynamic spanner and dynamic maximal matching	2019-10-15	Paper
Coresets meet EDCS: algorithms for matching and vertex cover on massive graphs	2019-10-15	Paper
Distance-Preserving Graph Contractions	2019-09-06	Paper
Near linear time \((1 + \epsilon)\)-approximation for restricted shortest paths in undirected graphs	2019-05-10	Paper
Faster fully dynamic matchings with small approximation ratios	2018-07-16	Paper
Deterministic partially dynamic single source shortest paths for sparse graphs	2018-07-16	Paper
Simultaneously load balancing for every \(p\)-norm, with reassignments	2018-05-03	Paper
Online bipartite matching with amortized \(\mathcal O(\log^2 n)\) replacements	2018-03-15	Paper
Incremental topological sort and cycle detection in \(\tilde O(m \sqrt n)\) expected total time	2018-03-15	Paper
Improved dynamic algorithms for maintaining approximate shortest paths under deletions	2017-09-29	Paper
Deterministic decremental single source shortest paths: beyond the \(O(mn)\) bound	2017-09-29	Paper
Maintaining shortest paths under deletions in weighted directed graphs	2016-05-12	Paper
Fully dynamic matching in bipartite graphs	2015-10-27	Paper
A nearly optimal oracle for avoiding failed vertices and edges	2015-02-04	Paper
Maintaining shortest paths under deletions in weighted directed graphs	2014-08-07	Paper
Fully dynamic (2 + ε) approximate all-pairs shortest paths with fast query and close to linear update time	2014-07-25	Paper
A nearly optimal algorithm for approximating replacement paths and \(k\) shortest simple paths in general graphs	2014-05-22	Paper
https://portal.mardi4nfdi.de/entity/Q3579391	2010-08-06	Paper

Research outcomes over time

This page was built for person: Aaron Bernstein