research
∙
04/25/2022
Byzantine-Resilient Counting in Networks
We present two distributed algorithms for the Byzantine counting problem...
share
research
∙
02/18/2021
Network Size Estimation in Small-World Networks under Byzantine Faults
We study the fundamental problem of counting the number of nodes in a sp...
research
∙
06/12/2020
Sleeping is Efficient: MIS in O(1)-rounds Node-averaged Awake Complexity
Maximal Independent Set (MIS) is one of the fundamental problems in dist...
research
∙
11/06/2019
Distributed MST: A Smoothed Analysis
We study smoothed analysis of distributed graph algorithms, focusing on ...
research
∙
09/02/2018
The Complexity of Leader Election: A Chasm at Diameter Two
This paper focuses on studying the message complexity of implicit leader...
research
∙
04/24/2018
