14 citations · 50 across the 20 of their papers we have counts for
5 papers · 1 filter
Message Reduction in the Local Model is a Free Lunch
Shimon Bitton, Yuval Emek, Taisuke Izumi +1
A new \emph{spanner} construction algorithm is presented, working under the \emph{LOCAL} model with unique edge IDs. Given an -node communication graph, a spanner with a constan…
Bayesian Generalized Network Design
Yuval Emek, Shay Kutten, Ron Lavi +1
We study network coordination problems, as captured by the setting of generalized network design (Emek et al., STOC 2018), in the face of uncertainty resulting from partial informa…
Deterministic Leader Election in Programmable Matter
Yuval Emek, Shay Kutten, Ron Lavi +1
Addressing a fundamental problem in programmable matter, we present the first deterministic algorithm to elect a unique leader in a system of connected amoebots assuming only that…
Hierarchical b-Matching
Yuval Emek, Shay Kutten, Mordechai Shalom +1
A matching of a graph is a subset of edges no two of which share a common vertex, and a maximum matching is a matching of maximum cardinality. In a -matching every vertex ha…
Multicast Communications in Tree Networks with Heterogeneous Capacity Constraints
Yuval Emek, Shay Kutten, Mordechai Shalom +1
A widely studied problem in communication networks is that of finding the maximum number of communication requests that can be scheduled concurrently, subject to node and/or link c…