1 citations · 1 across the 1 of their papers we have counts for
4 papers
The Task Completion Problem and its Application to Crash-Resilient Computation
Orr Fischer, Ran Gelles
We study the Task Completion problem, in which abstract tasks must be completed by a network of crash-prone nodes, where up to nodes may crash for some constant $α<1…
Near-Optimal Communication Byzantine Reliable Broadcast under a Message Adversary
Timothé Albouy, Davide Frey, Ran Gelles +5
We address the problem of Reliable Broadcast in asynchronous message-passing systems with nodes, of which up to are malicious (faulty), in addition to a message adversary t…
Sorting in One and Two Rounds using -Comparators
Ran Gelles, Zvi Lotker, Frederik Mallmann-Trenn
We examine sorting algorithms for elements whose basic operation is comparing elements simultaneously (a -comparator). We focus on algorithms that use only a single roun…
Content-Oblivious Leader Election on Rings
Fabian Frei, Ran Gelles, Ahmed Ghazy +1
In content-oblivious computation, n nodes wish to compute a given task over an asynchronous network that suffers from an extremely harsh type of noise, which corrupts the content o…