Aaron Bernstein | DeepAI

AI Chat

Featured Co-authors

Vahab Mirrokni
84 publications
Aaron Sidford
79 publications
Monika Henzinger
71 publications
Thatchaphol Saranurak
49 publications
Sepehr Assadi
42 publications
Bernhard Haeupler
39 publications
Danupon Nanongkai
37 publications
He Sun
30 publications
Christoph Grunau
28 publications
Greg Bodwin
24 publications
Nicole Wein
20 publications

∙ 08/24/2023

Are there graphs whose shortest path structure requires large edge weights?

The aspect ratio of a weighted graph G is the ratio of its maximum edge ...

0 Aaron Bernstein, et al. ∙

∙ 03/01/2023

Parallel and Distributed Exact Single-Source Shortest Paths with Negative Edge Weights

This paper presents parallel and distributed algorithms for single-sourc...

0 Vikrant Ashvinkumar, et al. ∙

∙ 01/17/2023

All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method

In the weighted load balancing problem, the input is an n-vertex biparti...

0 Sepehr Assadi, et al. ∙

∙ 07/10/2022

Closing the Gap Between Directed Hopsets and Shortcut Sets

For an n-vertex directed graph G = (V,E), a β-shortcut set H is a set of...

0 Aaron Bernstein, et al. ∙

∙ 07/03/2022

Decremental Matching in General Graphs

We consider the problem of maintaining an approximate maximum integral m...

0 Sepehr Assadi, et al. ∙

∙ 03/07/2022

Negative-Weight Single-Source Shortest Paths in Near-linear Time

We present a randomized algorithm that computes single-source shortest p...

0 Aaron Bernstein, et al. ∙

∙ 01/18/2021

Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time

In the decremental single-source shortest paths problem, the goal is to ...

0 Aaron Bernstein, et al. ∙

∙ 09/05/2020

Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing

Let G = (V,E,w) be a weighted, digraph subject to a sequence of adversar...

0 Aaron Bernstein, et al. ∙

∙ 08/10/2020

Improved Bounds for Distributed Load Balancing

In the load balancing problem, the input is an n-vertex bipartite graph ...

0 Sepehr Assadi, et al. ∙

∙ 05/01/2020

Improved Bound for Matching in Random-Order Streams

We study the problem of computing an approximate maximum cardinality mat...

0 Aaron Bernstein, et al. ∙

∙ 04/17/2020

Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary

Designing dynamic graph algorithms against an adaptive adversary is a ma...

0 Aaron Bernstein, et al. ∙

∙ 04/09/2020

Near-Optimal Decremental SSSP in Dense Weighted Digraphs

In the decremental Single-Source Shortest Path problem (SSSP), we are gi...

0 Aaron Bernstein, et al. ∙

∙ 01/11/2019

Decremental Strongly-Connected Components and Single-Source Reachability in Near-Linear Time

Computing the Strongly-Connected Components (SCCs) in a graph G=(V,E) is...

0 Aaron Bernstein, et al. ∙

∙ 11/08/2018

Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time

In the distributed all-pairs shortest paths problem (APSP), every node ...

0 Aaron Bernstein, et al. ∙

∙ 11/05/2018

Towards a Unified Theory of Sparsification for Matching Problems

In this paper, we present a construction of a `matching sparsifier', tha...

0 Sepehr Assadi, et al. ∙

∙ 10/25/2018

A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching

Many dynamic graph algorithms have an amortized update time, rather than...

0 Aaron Bernstein, et al. ∙

∙ 11/08/2017

Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs

Randomized composable coresets were introduced recently as an effective ...

0 Sepehr Assadi, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world