Author of the publication

Distributed Algorithms for Connectivity and MST in Large Graphs with Efficient Local Computation.

, , , and . ICDCN, page 40-49. ACM, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Analysis of Randomized Protocols for Conflict-Free Distributed Access., and . Algorithmica, 49 (2): 109-126 (2007)Can entropy characterize performance of online algorithms?., and . SODA, page 727-734. ACM/SIAM, (2001)On the Complexity of Information Spreading in Dynamic Networks., , , , and . SODA, page 717-736. SIAM, (2013)Query Protocols for Highly Resilient Peer-to-Peer Networks., , and . ISCA PDCS, page 247-252. ISCA, (2006)Distributed agreement in dynamic peer-to-peer networks., , , and . J. Comput. Syst. Sci., 81 (7): 1088-1109 (2015)On the Complexity of Universal Leader Election., , , , and . J. ACM, 62 (1): 7:1-7:27 (2015)Ballast: A Ball-Based Algorithm for Structural Motifs., , , and . RECOMB, volume 7262 of Lecture Notes in Computer Science, page 79-93. Springer, (2012)Efficient Computation of Balanced Structures., , , , and . ICALP (2), volume 7966 of Lecture Notes in Computer Science, page 581-593. Springer, (2013)Distributed Computation of Sparse Cuts via Random Walks., , and . ICDCN, page 6:1-6:10. ACM, (2015)Stochastic Analysis of a Churn-Tolerant Structured Peer-to-Peer Scheme, and . CoRR, (2010)