A singularly (near) optimal distributed algorithm is one that is (near)
...
We present two distributed algorithms for the Byzantine counting
problem...
We study the distributed minimum spanning tree (MST) problem, a fundamen...
Maximal Independent Set (MIS) is one of the central and most well-studie...
This paper concerns designing distributed algorithms that are singularly...
We study the communication cost (or message complexity) of fundamental
d...
We study the fundamental problem of counting the number of nodes in a sp...
This paper concerns designing distributed algorithms that are singularly...
Maximal Independent Set (MIS) is one of the fundamental problems in
dist...
The K-nearest neighbors is a basic problem in machine learning with
nume...
We study smoothed analysis of distributed graph algorithms, focusing on ...
Designing effective algorithms for community detection is an important a...
This paper focuses on showing time-message trade-offs in distributed
alg...
This paper focuses on studying the message complexity of implicit leader...
This paper investigates the message complexity of distributed informatio...
We present fast and efficient randomized distributed algorithms to find
...
The mixing time of a graph is an important metric, which is not only use...