research
∙
02/16/2022
Near-Shortest Path Routing in Hybrid Communication Networks
Hybrid networks, i.e., networks that leverage different means of communi...
share
research
∙
09/08/2020
Time-Optimal Construction of Overlay Networks
We show how to construct an overlay network of constant degree and diame...
research
∙
07/02/2020
Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs
We consider the problem of computing shortest paths in hybrid networks, ...
research
∙
09/04/2019
Shortest Paths in a Hybrid Network Model
We introduce a communication model for hybrid networks, where nodes have...
research
∙
04/24/2019
Fast Distributed Algorithms for LP-Type Problems of Bounded Dimension
In this paper we present various distributed algorithms for LP-type prob...
research
∙
05/18/2018
Distributed Computation in the Node-Congested Clique
The Congested Clique model of distributed computing, which was introduce...
research
∙
05/16/2018