5 citations · 27 across the 21 of their papers we have counts for
5 papers · 1 filter
The Sparsest Additive Spanner via Multiple Weighted BFS Trees
Keren Censor-Hillel, Ami Paz, Noam Ravid
Spanners are fundamental graph structures that sparsify graphs at the cost of small stretch. In particular, in recent years, many sequential algorithms constructing additive all-pa…
Distributed Reconfiguration of Maximal Independent Sets
Keren Censor-Hillel, Mikaël Rabie
In this paper, we investigate a distributed maximal independent set (MIS) reconfiguration problem, in which there are two maximal independent sets for which every node is given its…
Erasure Correction for Noisy Radio Networks
Keren Censor-Hillel, Bernhard Haeupler, D Ellis Hershkowitz +1
The radio network model is a well-studied model of wireless, multi-hop networks. However, radio networks make the strong assumption that messages are delivered deterministically. T…
Distributed Spanner Approximation
Keren Censor-Hillel, Michal Dory
We address the fundamental network design problem of constructing approximate minimum spanners. Our contributions are for the distributed setting, providing both algorithmic and ha…
Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model
Keren Censor-Hillel, Dean Leitersdorf, Elia Turner
We multiply two matrices over semirings in the Congested Clique model, where fully connected nodes communicate synchronously using -bit messages,…