research
∙
08/08/2023
One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks
The paper compares two generic techniques for deriving lower bounds and ...
share
research
∙
04/05/2023
Topological Characterization of Consensus Solvability in Directed Dynamic Networks
Consensus is one of the most fundamental problems in distributed computi...
research
∙
11/07/2022
The Augmentation-Speed Tradeoff for Consistent Network Updates
Emerging software-defined networking technologies enable more adaptive c...
research
∙
08/16/2022
Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs
A dynamic graph algorithm is a data structure that answers queries about...
research
∙
06/10/2022
A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement
We study two fundamental problems of distributed computing, consensus an...
research
∙
02/24/2022
Time Complexity of Consensus in Dynamic Networks Under Oblivious Message Adversaries
Consensus is a most fundamental task in distributed computing. This pape...
research
∙
08/05/2021
Sinkless orientation is hard also in the supported LOCAL model
We show that any algorithm that solves the sinkless orientation problem ...
research
∙
05/27/2021
On the Complexity of Load Balancing in Dynamic Networks
In the load balancing problem, each node in a network is assigned a load...
research
∙
05/27/2021
On the Complexity of Weight-Dynamic Network Algorithms
While operating communication networks adaptively may improve utilizatio...
research
∙
09/28/2020
Models of Smoothing in Dynamic Networks
Smoothed analysis is a framework suggested for mediating gaps between wo...
research
∙
05/15/2020
Input-dynamic distributed graph algorithms for congested networks
Consider a distributed system, where the topology of the communication n...
research
∙
03/06/2020
The Topology of Local Computing in Networks
Modeling distributed computing in a way enabling the use of formal metho...
research
∙
02/24/2020
Distributed Quantum Proofs for Replicated Data
The paper tackles the issue of checking that all copies of a large data ...
research
∙
01/22/2020
Simple and Fast Distributed Computation of Betweenness Centrality
Betweenness centrality is a graph parameter that has been successfully a...
research
∙
08/09/2019
Trade-offs in Distributed Interactive Proofs
The study of interactive proofs in the context of distributed network co...
research
∙
07/08/2019
A Topological Perspective on Distributed Network Algorithms
More than two decades ago, combinatorial topology was shown to be useful...
research
∙
05/24/2019
Hardness of Distributed Optimization
This paper studies lower bounds for fundamental optimization problems in...
research
∙
01/13/2019
Fast and Simple Deterministic Algorithms for Highly-Dynamic Networks
This paper provides a surprisingly simple method for obtaining fast (con...
research
∙
01/07/2019
Smaller Cuts, Higher Lower Bounds
This paper proves strong lower bounds for distributed computing in the C...
research
∙
11/05/2018
The Sparsest Additive Spanner via Multiple Weighted BFS Trees
Spanners are fundamental graph structures that sparsify graphs at the co...
research
∙
03/08/2018