18 citations · 27 across the 26 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.DC2020
Distributed Lower Bounds for Ruling Sets
Alkida Balliu, Sebastian Brandt, Dennis Olivetti
Given a graph , an -ruling set is a subset such that the distance between any two vertices in is at least , and the distance between any v…
cs.DC2020
Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta
Alkida Balliu, Fabian Kuhn, Dennis Olivetti
The problem of coloring the edges of an -node graph of maximum degree with colors is one of the key symmetry breaking problems in the area of distributed graph algor…
cs.DC2020
Truly Tight-in- Bounds for Bipartite Maximal Matching and Variants
Sebastian Brandt, Dennis Olivetti
In a recent breakthrough result, Balliu et al. [FOCS'19] proved a deterministic -round and a randomized -ro…