8 citations · 39 across the 20 of their papers we have counts for
3 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…
Robust Leader Election in a Fast-Changing World
John Augustine, Tejas Kulkarni, Paresh Nakhe +1
We consider the problem of electing a leader among nodes in a highly dynamic network where the adversary has unbounded capacity to insert and remove nodes (including the leader) fr…
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…