research
∙
07/18/2023
Fast 2-Approximate All-Pairs Shortest Paths
In this paper, we revisit the classic approximate All-Pairs Shortest Pat...
share
research
∙
07/17/2023
Fast Algorithms for Energy Games in Special Cases
In this paper, we study algorithms for special cases of energy games, a ...
research
∙
04/05/2023
The Laplacian Paradigm in Deterministic Congested Clique
In this paper, we bring the techniques of the Laplacian paradigm to the ...
research
∙
04/04/2023
Minimum Cost Flow in the CONGEST Model
We consider the CONGEST model on a network with n nodes, m edges, diamet...
research
∙
11/02/2022
New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths
We provide new tradeoffs between approximation and running time for the ...
research
∙
05/24/2022
The Laplacian Paradigm in the Broadcast Congested Clique
In this paper, we bring the main tools of the Laplacian paradigm to the ...
research
∙
02/22/2022
A Framework for Distributed Quantum Queries in the CONGEST Model
The Quantum CONGEST model is a variant of the CONGEST model, where messa...
research
∙
12/06/2021
Faster Cut Sparsification of Weighted Graphs
A cut sparsifier is a reweighted subgraph that maintains the weights of ...
research
∙
11/17/2021
