67 citations · 140 across the 37 of their papers we have counts for
3 papers · 1 filter
Distributed MST: A Smoothed Analysis
Soumyottam Chatterjee, Gopal Pandurangan, Nguyen Dinh Pham
We study smoothed analysis of distributed graph algorithms, focusing on the fundamental minimum spanning tree (MST) problem. With the goal of studying the time complexity of distri…
Scalable and Secure Computation Among Strangers: Resource-Competitive Byzantine Protocols
John Augustine, Valerie King, Anisur R. Molla +2
Motivated, in part, by the rise of permissionless systems such as Bitcoin where arbitrary nodes (whose identities are not known apriori) can join and leave at will, we extend estab…
Efficient Distributed Community Detection in the Stochastic Block Model
Reza Fathi, Anisur Rahaman Molla, Gopal Pandurangan
Designing effective algorithms for community detection is an important and challenging problem in {\em large-scale} graphs, studied extensively in the literature. Various solutions…