6 citations · 8 across the 4 of their papers we have counts for
9 papers · 1 filter
Wait-free approximate agreement on graphs
Dan Alistarh, Faith Ellen, Joel Rybicki
Approximate agreement is one of the few variants of consensus that can be solved in a wait-free manner in asynchronous systems where processes communicate by reading and writing to…
Fast Graphical Population Protocols
Dan Alistarh, Rati Gelashvili, Joel Rybicki
Let be a graph on nodes. In the stochastic population protocol model, a collection of indistinguishable, resource-limited nodes collectively solve tasks via pairwise in…
Local Mending
Alkida Balliu, Juho Hirvonen, Darya Melnyk +3
In this work we introduce the graph-theoretic notion of mendability: for each locally checkable graph problem we can define its mending radius, which captures the idea of how far o…
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…
Input-Dynamic Distributed Algorithms for Communication Networks
Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz +2
Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explor…
Byzantine Approximate Agreement on Graphs
Thomas Nowak, Joel Rybicki
Consider a distributed system with processors out of which can be Byzantine faulty. In the approximate agreement task, each processor receives an input value and…