3 citations · 6 across the 10 of their papers we have counts for
1 paper · 1 filter
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…