21 citations · 82 across the 21 of their papers we have counts for
6 papers · 1 filter
Sinkless Orientation Made Simple
Alkida Balliu, Janne H. Korhonen, Fabian Kuhn +9
The sinkless orientation problem plays a key role in understanding the foundations of distributed computing. The problem can be used to separate two fundamental models of distribut…
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…
Reaching Agreement in Competitive Microbial Systems
Victoria Andaur, Janna Burman, Matthias Függer +4
We study distributed agreement in microbial distributed systems under stochastic population dynamics and competitive interactions. Motivated by recent applications in synthetic bio…
Temporal Locality in Online Algorithms
Maciej Pacut, Mahmoud Parham, Joel Rybicki +3
Online algorithms make decisions based on past inputs. In general, the decision may depend on the entire history of inputs. If many computers run the same online algorithm with the…
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…