67 citations · 140 across the 37 of their papers we have counts for
4 papers · 1 filter
Distributed Algorithms for Large-Scale Graphs
Khalid Hourani, Hartmut Klauck, William K. Moses +4
Motivated by the increasing need for fast processing of large-scale graphs, we study a number of fundamental graph problems in a message-passing model for distributed computing, ca…
Distributed Computation of Sparse Cuts
Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan
Finding sparse cuts is an important tool in analyzing large-scale distributed networks such as the Internet and Peer-to-Peer networks, as well as large-scale graphs such as the web…
Storage and Search in Dynamic Peer-to-Peer Networks
John Augustine, Anisur Rahaman Molla, Ehab Morsy +3
We study robust and efficient distributed algorithms for searching, storing, and maintaining data in dynamic Peer-to-Peer (P2P) networks. P2P networks are highly dynamic networks t…
Distributed Random Walks
Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan +1
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we foc…