23 citations · 50 across the 10 of their papers we have counts for
9 papers · 1 filter
Bounded Memory in Distributed Networks
Ran Ben Basat, Keren Censor-Hillel, Yi-Jun Chang +3
The recent advent of programmable switches makes distributed algorithms readily deployable in real-world datacenter networks. However, there are still gaps between theory and pract…
Fast Broadcast in Highly Connected Networks
Shashwat Chandra, Yi-Jun Chang, Michal Dory +2
We revisit the classic broadcast problem, wherein we have messages, each composed of bits, distributed arbitrarily across a network. The objective is to broadcast…
Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model
Yi-Jun Chang, Oren Hecht, Dean Leitersdorf +1
In this work we consider the HYBRID model of distributed computing, introduced recently by Augustine, Hinnenthal, Kuhn, Scheideler, and Schneider (SODA 2020), where nodes have acce…
Deterministic Near-Optimal Distributed Listing of Cliques
Keren Censor-Hillel, Dean Leitersdorf, David Vulakh
The importance of classifying connections in large graphs has been the motivation for a rich line of work on distributed subgraph finding that has led to exciting recent breakthrou…
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.…
Tight Distributed Listing of Cliques
Keren Censor-Hillel, Yi-Jun Chang, François Le Gall +1
Much progress has recently been made in understanding the complexity landscape of subgraph finding problems in the CONGEST model of distributed computing. However, so far, very few…
Distance Computations in the Hybrid Network Model via Oracle Simulations
Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin
The Hybrid network model was introduced in [Augustine et al., SODA '20] for laying down a theoretical foundation for networks which combine two possible modes of communication: One…
On Distributed Listing of Cliques
Keren Censor-Hillel, François Le Gall, Dean Leitersdorf
We show an -round algorithm in the \congest model for \emph{listing} of (a clique with nodes), for all . For , we show an $\…
Fast Approximate Shortest Paths in the Congested Clique
Keren Censor-Hillel, Michal Dory, Janne H. Korhonen +1
We design fast deterministic algorithms for distance computation in the congested clique model. Our key contributions include: -- A -approximation for all-pairs shortest pat…