research
∙
08/02/2023
Fast Coloring Despite Congested Relays
We provide a O(log^6 log n)-round randomized algorithm for distance-2 co...
share
research
∙
04/19/2023
Coloring Fast with Broadcasts
We present an O(log^3log n)-round distributed algorithm for the (Δ+1)-co...
research
∙
04/01/2023
The communication complexity of functions with large outputs
We study the two-party communication complexity of functions with large ...
research
∙
01/16/2023
A Distributed Palette Sparsification Theorem
Is fully decentralized graph streaming possible? We consider this questi...
research
∙
08/17/2022
Fast Distributed Vertex Splitting with Applications
We present polyloglog n-round randomized distributed algorithms to compu...
research
∙
05/28/2022
Overcoming Congestion in Distributed Coloring
We present a new technique to efficiently sample and communicate a large...
research
∙
12/01/2021
Near-Optimal Distributed Degree+1 Coloring
We present a new approach to randomized distributed graph coloring that ...
research
∙
05/10/2021
Ultrafast Distributed Coloring of High Degree Graphs
We give a new randomized distributed algorithm for the Δ+1-list coloring...
research
∙
02/08/2021
Superfast Coloring in CONGEST via Efficient Color Sampling
We present a procedure for efficiently sampling colors in the model. It...
research
∙
08/10/2020
