research
∙
05/25/2022
Near-Optimal Leader Election in Population Protocols on Graphs
In the stochastic population protocol model, we are given a connected gr...
share
research
∙
08/05/2021
Sinkless orientation is hard also in the supported LOCAL model
We show that any algorithm that solves the sinkless orientation problem ...
research
∙
03/16/2021
Wait-free approximate agreement on graphs
Approximate agreement is one of the few variants of consensus that can b...
research
∙
03/12/2021
Reaching Agreement in Competitive Microbial Systems
In this work, we consider distributed agreement tasks in microbial distr...
research
∙
02/18/2021
Locality in Online Algorithms
Online algorithms make decisions based on past inputs. In general, the d...
research
∙
02/17/2021
Fast Graphical Population Protocols
Let G be a graph on n nodes. In the stochastic population protocol model...
research
∙
02/17/2021
Local Mending
In this work we introduce the graph-theoretic notion of mendability: for...
research
∙
05/15/2020
Efficient Load-Balancing through Distributed Token Dropping
We introduce a new graph problem, the token dropping game, and we show h...
research
∙
05/15/2020
Input-dynamic distributed graph algorithms for congested networks
Consider a distributed system, where the topology of the communication n...
research
∙
08/07/2019
Byzantine Approximate Agreement on Graphs
Consider a distributed system with n processors out of which f can be By...
research
∙
05/08/2019
