5 papers · 1 filter
Randomized Tree-Intersection Leader Election
Yuval Emek, Shay Kutten, Ido Rafael +1
We present a randomized leader election algorithm for synchronous complete -node graphs in the \textsf{CONGEST} model that introduces a highly tunable trade-off between time com…
Self-Stabilizing Algorithms in the Uniform Port Model
Liam Brinker, Yuval Emek, Oren Louidor
We introduce a distributed computational model referred to as the \emph{uniform port} model. An algorithm operating in this model is defined by means of local automata associated w…
Team Formation and Applications
Yuval Emek, Shay Kutten, Ido Rafael +1
A novel long-lived distributed problem, called Team Formation (TF), is introduced together with a message- and time-efficient randomized algorithm. The problem is defined over the…
Fully Adaptive Self-Stabilizing Transformer for LCL Problems
Shimon Bitton, Yuval Emek, Taisuke Izumi +1
The first generic self-stabilizing transformer for local problems in a constrained bandwidth model is introduced. This transformer can be applied to a wide class of locally checkab…
On the Power of Graphical Reconfigurable Circuits
Yuval Emek, Yuval Gil, Noga Harlev
We introduce the \emph{graphical reconfigurable circuits (GRC)} model as an abstraction for distributed graph algorithms whose communication scheme is based on local mechanisms tha…