8 citations · 11 across the 8 of their papers we have counts for
9 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…
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…
Better Sooner Rather Than Later
Anaïs Durand, Michel Raynal, Gadi Taubenfeld
This article unifies and generalizes fundamental results related to -process asynchronous crash-prone distributed computing. More precisely, it proves that for every $0\leq k \l…
Memory-Anonymous Starvation-Free Mutual Exclusion: Possibility and Impossibility Results
Gadi Taubenfeld
In an anonymous shared memory system, all inter-process communications are via shared objects; however, unlike in standard systems, there is no a priori agreement between processes…
Election in Fully Anonymous Shared Memory Systems: Tight Space Bounds and Algorithms
Damien Imbs, Michel Raynal, Gadi Taubenfeld
This article addresses election in fully anonymous systems made up of asynchronous processes that communicate through atomic read-write registers or atomic read-modify-write re…
Genome-Wide Epigenetic Modifications as a Shared Memory Consensus Problem
Sabrina Rashid, Gadi Taubenfeld, Ziv Bar-Joseph
A distributed computing system is a collection of processors that communicate either by reading and writing from a shared memory or by sending messages over some communication netw…