most citedThe Task Completion Problem and its Application to Crash-Resilient Computation

1 citations · 1 across the 1 of their papers we have counts for

collaborators
Showing cs.DSShow all

2 papers · 1 filter

cs.DS2024

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…

cs.DS2024

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…