research
∙
10/13/2022
Beeping Shortest Paths via Hypergraph Bipartite Decomposition
Constructing a shortest path between two network nodes is a fundamental ...
share
research
∙
05/23/2022
Distributed Computations in Fully-Defective Networks
We address fully-defective asynchronous networks, in which all links are...
research
∙
05/25/2021
The Topology of Randomized Symmetry-Breaking Distributed Computing
Studying distributed computing through the lens of algebraic topology ha...
research
∙
05/04/2021
Multiparty Interactive Coding over Networks of Intersecting Broadcast Links
We consider computations over networks with multiple broadcast channels ...
research
∙
09/15/2019
Noisy Beeping Networks
We introduce noisy beeping networks, where nodes have limited communicat...
research
∙
01/28/2019
Efficient Multiparty Interactive Coding for Insertions, Deletions and Substitutions
In the field of interactive coding, two or more parties wish to carry ou...
research
∙
11/06/2018
Interactive coding resilient to an unknown number of erasures
We consider distributed computations between two parties carried out ove...
research
∙
07/13/2018