92 citations · 170 across the 35 of their papers we have counts for
Showing 2021 · cs.DCShow all
2 papers · 2 filters
cs.DC2021
On Sparsity Awareness in Distributed Computations
Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin
We extract a core principle underlying seemingly different fundamental distributed settings, showing sparsity awareness may induce faster algorithms for problems in these settings.…
cs.DC2021
Near-Optimal Scheduling in the Congested Clique
Keren Censor-Hillel, Yannic Maus, Volodymyr Polosukhin
This paper provides three nearly-optimal algorithms for scheduling jobs in the model. First, we present a deterministic scheduling algorithm that runs in $O(\…