92 citations · 480 across the 54 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DC2020
Efficient Load-Balancing through Distributed Token Dropping
Sebastian Brandt, Barbara Keller, Joel Rybicki +2
We introduce a new graph problem, the token dropping game, and we show how to solve it efficiently in a distributed setting. We use the token dropping game as a tool to design an e…
cs.DC2020
Distributed graph problems through an automata-theoretic lens
Yi-Jun Chang, Jan Studený, Jukka Suomela
The locality of a graph problem is the smallest distance such that each node can choose its own part of the solution based on its radius- neighborhood. In many settings, a g…