3 citations · 6 across the 10 of their papers we have counts for
11 papers
Distributed Download from an External Data Source in Asynchronous Faulty Settings
John Augustine, Soumyottam Chatterjee, Valerie King +3
The distributedData Retrieval (DR) model consists of peers connected by a complete peer-to-peer communication network, and a trusted external data source that stores an array $…
Distributed Download from an External Data Source in Faulty Majority Settings
John Augustine, Soumyottam Chatterjee, Valerie King +3
We extend the study of retrieval problems in distributed networks, focusing on improving the efficiency and resilience of protocols in the \emph{Data Retrieval (DR) Model}. The DR…
Byzantine-Resilient Counting in Networks
Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson
We present two distributed algorithms for the {\em Byzantine counting problem}, which is concerned with estimating the size of a network in the presence of a large number of Byzant…
Network Size Estimation in Small-World Networks under Byzantine Faults
Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson
We study the fundamental problem of counting the number of nodes in a sparse network (of unknown size) under the presence of a large number of Byzantine nodes. We assume the full i…
Sleeping is Efficient: MIS in -rounds Node-averaged Awake Complexity
Soumyottam Chatterjee, Robert Gmyr, Gopal Pandurangan
Maximal Independent Set (MIS) is one of the fundamental problems in distributed computing. The round (time) complexity of distributed MIS has traditionally focused on the \emph{wor…
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…