research
∙
10/13/2022
Beeping Shortest Paths via Hypergraph Bipartite Decomposition
Constructing a shortest path between two network nodes is a fundamental ...
share
research
∙
10/03/2022
An Almost Singularly Optimal Asynchronous Distributed MST Algorithm
A singularly (near) optimal distributed algorithm is one that is (near) ...
research
∙
04/18/2022
Sleeping is Superefficient: MIS in Exponentially Better Awake Complexity
Maximal Independent Set (MIS) is one of the central and most well-studie...
research
∙
06/02/2021
