Ferrers dimension and boxicity. - Soumyottam Chatterjee; Shamik Ghosh (Discret. Math., 2010)

The Complexity of Leader Election: A Chasm at Diameter Two. - Soumyottam Chatterjee; Gopal Pandurangan; Peter Robinson 002 (ICDCN, 2018)

Fast and Efficient Distributed Computation of Hamiltonian Cycles in Random Graphs. - Soumyottam Chatterjee; Reza Fathi; Gopal Pandurangan; Nguyen Dinh Pham (ICDCS, 2018)

Network Size Estimation in Small-World Networks Under Byzantine Faults. - Soumyottam Chatterjee; Gopal Pandurangan; Peter Robinson 002 (IPDPS, 2019)

Distributed MST: A Smoothed Analysis. - Soumyottam Chatterjee; Gopal Pandurangan; Nguyen Dinh Pham (ICDCN, 2020)

Sleeping is Efficient: MIS in O(1)-rounds Node-averaged Awake Complexity. - Soumyottam Chatterjee; Robert Gmyr; Gopal Pandurangan (PODC, 2020)

Sleeping is Efficient: MIS in O(1)-rounds Node-averaged Awake Complexity. - Soumyottam Chatterjee; Robert Gmyr; Gopal Pandurangan (CoRR, 2020)

The complexity of leader election in diameter-two networks. - Soumyottam Chatterjee; Gopal Pandurangan; Peter Robinson 002 (Distributed Comput., 2020)

Byzantine-Resilient Counting in Networks. - Soumyottam Chatterjee; Gopal Pandurangan; Peter Robinson 002 (ICDCS, 2022)

A Fully-Distributed Scalable Peer-to-Peer Protocol for Byzantine-Resilient Distributed Hash Tables. - John Augustine; Soumyottam Chatterjee; Gopal Pandurangan (SPAA, 2022)

Distributed Download from an External Data Source in Faulty Majority Settings. - John Augustine; Soumyottam Chatterjee; Valerie King; Manish Kumar; Shachar Meir; David Peleg (CoRR, 2024)

Brief Announcement: Distributed Download from an External Data Source in Byzantine Majority Settings. - John Augustine; Soumyottam Chatterjee; Valerie King; Manish Kumar; Shachar Meir; David Peleg (PODC, 2025)