| 2026 | PODC | Fast Gossip-Based Rumor Spreading Using Small Messages. | Fabien Dufoulon, William K. Moses Jr., Gopal Pandurangan |
| 2026 | PODC | Dijkstra Prize Keynote: The Ω~(D+n) Lower Bound Story of Distributed Algorithms. | Gopal Pandurangan |
| 2026 | PODC | Improved Bounds for Distributed Random Walks and Spanning Trees. | Gopal Pandurangan, Sriram V. Pemmaraju, Sourya Roy, Joshua Z. Sobel |
| 2025 | PODC | Brief Announcement: Energy-Efficient Maximal Independent Sets in Radio Networks. | Dominick Banasik, Varsha Dani, Fabien Dufoulon, Aayush Gupta, Thomas P. Hayes, Gopal Pandurangan |
| 2025 | PODC | Quantum Communication Advantage for Leader Election and Agreement. | Fabien Dufoulon, Frdric Magniez, Gopal Pandurangan |
| 2025 | PODC | Improved Byzantine Agreement under an Adaptive Adversary. | Fabien Dufoulon, Gopal Pandurangan |
| 2025 | PODC | Message Optimality and Message-Time Trade-offs for APSP and Beyond. | Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson |
| 2025 | SODA | Fully-Distributed Byzantine Agreement in Sparse Networks. | John Augustine, Fabien Dufoulon, Gopal Pandurangan |
| 2025 | SPAA | Brief Announcement: A Fully-Distributed Construction of Byzantine-Resilient Dynamic Peer-to-Peer Networks. | Aayush Gupta, Gopal Pandurangan |
| 2024 | ESA | Towards Communication-Efficient Peer-To-Peer Networks. | Khalid Hourani, William K. Moses Jr., Gopal Pandurangan |
| 2024 | OPODIS | The Singular Optimality of Distributed Computation in LOCAL. | Fabien Dufoulon, Gopal Pandurangan, Peter Robinson, Michele Scquizzato |
| 2024 | SIROCCO | Awake Complexity of Distributed Minimum Spanning Tree. | John Augustine, William K. Moses Jr., Gopal Pandurangan |
| 2023 | PODC | Distributed MIS in O(log log n) Awake Complexity. | Fabien Dufoulon, William K. Moses Jr., Gopal Pandurangan |
| 2022 | ICDCN | Distributed Algorithms for Connectivity and MST in Large Graphs with Efficient Local Computation. | Eric Ajieren, Khalid Hourani, William K. Moses Jr., Gopal Pandurangan |
| 2022 | ICDCS | Byzantine-Resilient Counting in Networks. | Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson |
| 2022 | ICDCS | Awake-Efficient Distributed Algorithms for Maximal Independent Set. | Khalid Hourani, Gopal Pandurangan, Peter Robinson |
| 2022 | PODC | 2022 Principles of Distributed Computing Doctoral Dissertation Award. | Yehuda Afek, Keren Censor-Hillel, Pierre Fraigniaud, Seth Gilbert, Gopal Pandurangan, Gadi Taubenfeld |
| 2022 | PODC | Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds. | John Augustine, William K. Moses Jr., Gopal Pandurangan |
| 2022 | SPAA | A Fully-Distributed Scalable Peer-to-Peer Protocol for Byzantine-Resilient Distributed Hash Tables. | John Augustine, Soumyottam Chatterjee, Gopal Pandurangan |
| 2021 | PODC | Byzantine Agreement and Leader Election: From Classical to the Modern. | John Augustine, Anisur Rahaman Molla, Gopal Pandurangan |
| 2021 | PODC | Can We Break Symmetry with o(m) Communication? | Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson |
| 2020 | ALENEX | A Multi-criteria Approximation Algorithm for Influence Maximization with Probabilistic Guarantees. | Maleq Khan, Gopal Pandurangan, Nguyen Dinh Pham, Anil Vullikanti, Qin Zhang |
| 2020 | CIKM | PandaSQL: Parallel Randomized Triangle Enumeration with SQL Queries. | Abir Farouzi, Ladjel Bellatreche, Carlos Ordonez, Gopal Pandurangan, Mimoun Malki |
| 2020 | DaWaK | A Scalable Randomized Algorithm for Triangle Enumeration on Graphs Based on SQL Queries. | Abir Farouzi, Ladjel Bellatreche, Carlos Ordonez, Gopal Pandurangan, Mimoun Malki |
| 2020 | ICDCN | Distributed MST: A Smoothed Analysis. | Soumyottam Chatterjee, Gopal Pandurangan, Nguyen Dinh Pham |
| 2020 | PODC | Sleeping is Efficient: MIS in | Soumyottam Chatterjee, Robert Gmyr, Gopal Pandurangan |
| 2020 | PODC | DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead. | Seth Gilbert, Gopal Pandurangan, Peter Robinson, Amitabh Trehan |
| 2020 | SPAA | Efficient Distributed Algorithms for the K-Nearest Neighbors Problem. | Reza Fathi, Anisur Rahaman Molla, Gopal Pandurangan |
| 2019 | ICDCS | The Communication Cost of Information Spreading in Dynamic Networks. | Mohamad Ahmadi, Fabian Kuhn, Shay Kutten, Anisur Rahaman Molla, Gopal Pandurangan |
| 2019 | ICDCS | Efficient Distributed Community Detection in the Stochastic Block Model. | Reza Fathi, Anisur Rahaman Molla, Gopal Pandurangan |
| 2018 | ICDCN | The Complexity of Leader Election: A Chasm at Diameter Two. | Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson |
| 2018 | ICDCS | Fast and Efficient Distributed Computation of Hamiltonian Cycles in Random Graphs. | Soumyottam Chatterjee, Reza Fathi, Gopal Pandurangan, Nguyen Dinh Pham |
| 2018 | PODC | Sublinear Message Bounds for Randomized Agreement. | John Augustine, Anisur Rahaman Molla, Gopal Pandurangan |
| 2018 | SPAA | On the Distributed Complexity of Large-Scale Graph Computations. | Gopal Pandurangan, Peter Robinson, Michele Scquizzato |
| 2017 | ICDCN | Distributed Computation of Mixing Time. | Anisur Rahaman Molla, Gopal Pandurangan |
| 2017 | PODC | Brief Announcement: Symmetry Breaking in the CONGEST Model: Time- and Message-Efficient Algorithms for Ruling Sets. | Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson |
| 2017 | STOC | A time- and message-optimal distributed algorithm for minimum spanning trees. | Gopal Pandurangan, Peter Robinson, Michele Scquizzato |
| 2016 | CCGRID | Checkpointing to Minimize Completion Time for Inter-Dependent Parallel Processes on Volunteer Grids. | Mohammad Tanvir Rahman, Hien Nguyen, Jaspal Subhlok, Gopal Pandurangan |
| 2016 | SPAA | Fast Distributed Algorithms for Connectivity and MST in Large Graphs. | Gopal Pandurangan, Peter Robinson, Michele Scquizzato |
| 2016 | SIROCCO | Message Lower Bounds via Efficient Network Synchronization. | Gopal Pandurangan, David Peleg, Michele Scquizzato |
| 2015 | FOCS | Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks. | John Augustine, Gopal Pandurangan, Peter Robinson, Scott T. Roche, Eli Upfal |
| 2015 | ICDCN | Distributed Computation of Sparse Cuts via Random Walks. | Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan |
| 2015 | PODC | Toward Optimal Bounds in the Congested Clique: Graph Connectivity and MST. | James W. Hegeman, Gopal Pandurangan, Sriram V. Pemmaraju, Vivek B. Sardeshmukh, Michele Scquizzato |
| 2015 | SODA | Distributed Computation of Large-scale Graph Problems. | Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson |
| 2014 | PODC | Can quantum communication speed up distributed computation? | Michael Elkin, Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan |
| 2014 | SIROCCO | Distributed Algorithmic Foundations of Dynamic Networks. | Gopal Pandurangan |
| 2013 | ICALP | Efficient Computation of Balanced Structures. | David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan |
| 2013 | ICDCN | Sublinear Bounds for Randomized Leader Election. | Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan |
| 2013 | ICDCN | Fast Distributed PageRank Computation. | Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan, Eli Upfal |
| 2013 | PODC | Fast byzantine agreement in dynamic networks. | John Augustine, Gopal Pandurangan, Peter Robinson |
| 2013 | PODC | On the complexity of universal leader election. | Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan |
| 2013 | SODA | On the Complexity of Information Spreading in Dynamic Networks. | Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun, Emanuele Viola |
| 2013 | SPAA | Storage and search in dynamic peer-to-peer networks. | John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Eli Upfal |
| 2013 | SPAA | Coalescing-branching random walks on graphs. | Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Scott T. Roche |
| 2012 | INFOCOM | Near-optimal random walk sampling in distributed networks. | Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan |
| 2012 | RECOMB | Ballast: A Ball-Based Algorithm for Structural Motifs. | Lu He, Fabio Vandin, Gopal Pandurangan, Chris Bailey-Kellogg |
| 2012 | SODA | Towards robust and efficient computation in dynamic peer-to-peer networks. | John Augustine, Gopal Pandurangan, Peter Robinson, Eli Upfal |
| 2012 | SPAA | Discovery through gossip. | Bernhard Haeupler, Gopal Pandurangan, David Peleg, Rajmohan Rajaraman, Zhifeng Sun |
| 2012 | SPAA | Efficient computation of distance sketches in distributed networks. | Atish Das Sarma, Michael Dinitz, Gopal Pandurangan |
| 2011 | PODC | A tight unconditional lower bound on distributed randomwalk computation. | Danupon Nanongkai, Atish Das Sarma, Gopal Pandurangan |
| 2011 | PODC | Xheal: localized self-healing using expanders. | Gopal Pandurangan, Amitabh Trehan |
| 2011 | STOC | Distributed verification and hardness of distributed approximation. | Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer |
| 2010 | PODC | Efficient distributed random walks with applications. | Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali |
| 2010 | SPAA | Optimal gossip-based aggregate computation. | Jen-Yeu Chen, Gopal Pandurangan |
| 2009 | INFOCOM | Bi-Criteria Approximation Algorithms for Power-Efficient and Low-Interference Topology Control in Unreliable Ad Hoc Networks. | Maleq Khan, V. S. Anil Kumar, Madhav V. Marathe, Gopal Pandurangan, S. S. Ravi |
| 2009 | PODC | Brief announcement: locality-based aggregate computation in wireless sensor networks. | Jen-Yeu Chen, Gopal Pandurangan, Jianghai Hu |
| 2009 | PODC | Fast distributed random walks. | Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan |
| 2008 | ISMB | Contact replacement for NMR resonance assignment. | Fei Xiong, Gopal Pandurangan, Chris Bailey-Kellogg |
| 2008 | PODC | Efficient distributed approximation algorithms via probabilistic tree embeddings. | Maleq Khan, Fabian Kuhn, Dahlia Malkhi, Gopal Pandurangan, Kunal Talwar |
| 2008 | SPAA | Energy-optimal distributed algorithms for minimum spanning trees. | Yongwook Choi, Maleq Khan, V. S. Anil Kumar, Gopal Pandurangan |
| 2007 | COCOON | On the Hardness of Optimization in Power Law Graphs. | Alessandro Ferrante, Gopal Pandurangan, Kihong Park |
| 2006 | SECON | Distance Matrix Reconstruction from Incomplete Distance Information for Sensor Network Localization. | Petros Drineas, Malik Magdon-Ismail, Gopal Pandurangan, Reino Virrankoski, Andreas Savvides |
| 2005 | ISIT | A universal online caching algorithm based on pattern matching. | Gopal Pandurangan, Wojciech Szpankowski |
| 2005 | MSWIM | Latency-sensitive power control for wireless ad-hoc networks. | Mohamed R. Fouad, Sonia Fahmy, Gopal Pandurangan |
| 2005 | PODC | Brief announcement: analysis of a randomized contention-resolution protocol for distributed access. | Gopal Pandurangan, GaHyun Park |
| 2005 | SODA | The bin-covering technique for thresholding random geometric graph properties. | S. Muthukrishnan, Gopal Pandurangan |
| 2004 | RECOMB | A random graph approach to NMR sequential assignment. | Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pandurangan |
| 2002 | COCOON | Using PageRank to Characterize Web Structure. | Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal |
| 2001 | FOCS | Building Low-Diameter P2P Networks. | Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal |
| 2001 | SODA | Can entropy characterize performance of online algorithms?. | Gopal Pandurangan, Eli Upfal |
| 1999 | IJCAI | Computing Near Optimal Strategies for Stochastic Investment Planning Problems. | Milos Hauskrecht, Gopal Pandurangan, Eli Upfal |
| 1999 | STOC | Static and Dynamic Evaluation of QoS Properties. | Gopal Pandurangan, Eli Upfal |