default search action
Gopal Pandurangan
C. P. Gopalakrishnan
Person information
- affiliation: University of Houston, Department of Computer Science, TX, USA
- affiliation (former): University of Houston, Department of Computer Science, TX, USA
- affiliation (former): Nanyang Technological University, Division of Mathematical Sciences, Singapore
- affiliation (former): Purdue University, Department of Computer Science, West Lafayette, IN, USA
- affiliation (former): Brown University, Department of Computer Science, Providence, RI, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c95]Khalid Hourani, William K. Moses Jr., Gopal Pandurangan:
Towards Communication-Efficient Peer-To-Peer Networks. ESA 2024: 71:1-71:15 - [c94]Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson:
The Message Complexity of Distributed Graph Optimization. ITCS 2024: 41:1-41:26 - [c93]Fabien Dufoulon, Michael Moorman, William K. Moses Jr., Gopal Pandurangan:
Time- and Communication-Efficient Overlay Network Construction via Gossip. ITCS 2024: 42:1-42:23 - [c92]John Augustine
, William K. Moses Jr.
Awake Complexity of Distributed Minimum Spanning Tree. SIROCCO 2024: 45-63 - [i54]Khalid Hourani, William K. Moses Jr., Gopal Pandurangan:
Towards Communication-Efficient Peer-to-Peer Networks. CoRR abs/2406.16661 (2024) - [i53]John Augustine, Fabien Dufoulon, Gopal Pandurangan:
Fully-Distributed Byzantine Agreement in Sparse Networks. CoRR abs/2410.20865 (2024) - 2023
- [c91]Fabien Dufoulon
Distributed MIS in O(log log n) Awake Complexity. PODC 2023: 135-145 - [i52]Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson:
The Message Complexity of Distributed Graph Optimization. CoRR abs/2311.14811 (2023) - [i51]Fabien Dufoulon, Michael Moorman, William K. Moses Jr., Gopal Pandurangan:
Time- and Communication-Efficient Overlay Network Construction via Gossip. CoRR abs/2311.17115 (2023) - 2022
- [c90]Eric Ajieren, Khalid Hourani
Distributed Algorithms for Connectivity and MST in Large Graphs with Efficient Local Computation. ICDCN 2022: 40-49 - [c89]Soumyottam Chatterjee
Byzantine-Resilient Counting in Networks. ICDCS 2022: 12-22 - [c88]Khalid Hourani
Awake-Efficient Distributed Algorithms for Maximal Independent Set. ICDCS 2022: 1338-1339 - [c87]Yehuda Afek, Keren Censor-Hillel, Pierre Fraigniaud, Seth Gilbert, Gopal Pandurangan, Gadi Taubenfeld:
2022 Principles of Distributed Computing Doctoral Dissertation Award. PODC 2022: 2 - [c86]John Augustine, William K. Moses Jr., Gopal Pandurangan:
Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds. PODC 2022: 51-53 - [c85]John Augustine, Soumyottam Chatterjee
A Fully-Distributed Scalable Peer-to-Peer Protocol for Byzantine-Resilient Distributed Hash Tables. SPAA 2022: 87-98 - [c84]John Augustine, Anisur Rahaman Molla, Gopal Pandurangan, Yadu Vasudev:
Byzantine Connectivity Testing in the Congested Clique. DISC 2022: 7:1-7:21 - [c83]Fabien Dufoulon
An Almost Singularly Optimal Asynchronous Distributed MST Algorithm. DISC 2022: 19:1-19:24 - [i50]Fabien Dufoulon, William K. Moses Jr., Gopal Pandurangan:
Sleeping is Superefficient: MIS in Exponentially Better Awake Complexity. CoRR abs/2204.08359 (2022) - [i49]John Augustine, William K. Moses Jr., Gopal Pandurangan:
Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds. CoRR abs/2204.08385 (2022) - [i48]Soumyottam Chatterjee
Byzantine-Resilient Counting in Networks. CoRR abs/2204.11951 (2022) - [i47]Fabien Dufoulon, Shay Kutten, William K. Moses Jr., Gopal Pandurangan, David Peleg:
An Almost Singularly Optimal Asynchronous Distributed MST Algorithm. CoRR abs/2210.01173 (2022) - 2021
- [j48]Gopal Pandurangan
On the Distributed Complexity of Large-Scale Graph Computations. ACM Trans. Parallel Comput. 8(2): 7:1-7:28 (2021) - [c82]John Augustine, Kishore Kothapalli, Gopal Pandurangan
Efficient Distributed Algorithms in the k-machine model via PRAM Simulations. IPDPS 2021: 223-232 - [c81]Shreyas Pai
Can We Break Symmetry with o(m) Communication? PODC 2021: 247-257 - [c80]John Augustine, Anisur Rahaman Molla, Gopal Pandurangan
Byzantine Agreement and Leader Election: From Classical to the Modern. PODC 2021: 569-571 - [c79]Shay Kutten
Singularly Near Optimal Leader Election in Asynchronous Networks. DISC 2021: 27:1-27:18 - [i46]Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson:
Network Size Estimation in Small-World Networks under Byzantine Faults. CoRR abs/2102.09197 (2021) - [i45]Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson:
Can We Break Symmetry with o(m) Communication? CoRR abs/2105.08917 (2021) - [i44]Shay Kutten, William K. Moses Jr., Gopal Pandurangan, David Peleg:
Singularly Near Optimal Leader Election in Asynchronous Networks. CoRR abs/2108.02197 (2021) - 2020
- [j47]Soumyottam Chatterjee
The complexity of leader election in diameter-two networks. Distributed Comput. 33(2): 189-205 (2020) - [j46]Gopal Pandurangan
A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees. ACM Trans. Algorithms 16(1): 13:1-13:27 (2020) - [j45]Gopal Pandurangan
Message lower bounds via efficient network synchronization. Theor. Comput. Sci. 810: 82-95 (2020) - [c78]Maleq Khan, Gopal Pandurangan
A Multi-criteria Approximation Algorithm for Influence Maximization with Probabilistic Guarantees. ALENEX 2020: 81-93 - [c77]Abir Farouzi, Ladjel Bellatreche, Carlos Ordonez, Gopal Pandurangan
PandaSQL: Parallel Randomized Triangle Enumeration with SQL Queries. CIKM 2020: 3377-3380 - [c76]Abir Farouzi, Ladjel Bellatreche, Carlos Ordonez, Gopal Pandurangan
A Scalable Randomized Algorithm for Triangle Enumeration on Graphs Based on SQL Queries. DaWaK 2020: 141-156 - [c75]Abir Farouzi, Ladjel Bellatreche, Carlos Ordonez, Gopal Pandurangan, Mimoun Malki:
Enumération Randomisée des Triangles dans des Graphes à Grande Echelle à base de SQL. EDA 2020: 33-46 - [c74]Soumyottam Chatterjee
Distributed MST: A Smoothed Analysis. ICDCN 2020: 15:1-15:10 - [c73]Soumyottam Chatterjee
Sleeping is Efficient: MIS in O(1)-rounds Node-averaged Awake Complexity. PODC 2020: 99-108 - [c72]Seth Gilbert
DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead. PODC 2020: 438-447 - [c71]Reza Fathi, Anisur Rahaman Molla, Gopal Pandurangan
Efficient Distributed Algorithms for the K-Nearest Neighbors Problem. SPAA 2020: 527-529 - [c70]Shay Kutten
Singularly Optimal Randomized Leader Election. DISC 2020: 22:1-22:18 - [c69]John Augustine
Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols. DISC 2020: 31:1-31:19 - [i43]Reza Fathi, Anisur Rahaman Molla, Gopal Pandurangan:
Efficient Distributed Algorithms for the K-Nearest Neighbors Problem. CoRR abs/2005.07373 (2020) - [i42]Soumyottam Chatterjee, Robert Gmyr, Gopal Pandurangan:
Sleeping is Efficient: MIS in O(1)-rounds Node-averaged Awake Complexity. CoRR abs/2006.07449 (2020) - [i41]Shay Kutten, William K. Moses Jr., Gopal Pandurangan, David Peleg:
Singularly Optimal Randomized Leader Election. CoRR abs/2008.02782 (2020) - [i40]John Augustine, Khalid Hourani, Anisur Rahaman Molla, Gopal Pandurangan, Adi Pasic:
Economy Versus Disease Spread: Reopening Mechanisms for COVID 19. CoRR abs/2009.08872 (2020)
2010 – 2019
- 2019
- [c68]Mohamad Ahmadi, Fabian Kuhn, Shay Kutten, Anisur Rahaman Molla, Gopal Pandurangan
The Communication Cost of Information Spreading in Dynamic Networks. ICDCS 2019: 368-378 - [c67]Reza Fathi, Anisur Rahaman Molla, Gopal Pandurangan
Efficient Distributed Community Detection in the Stochastic Block Model. ICDCS 2019: 409-419 - [c66]Soumyottam Chatterjee
Network Size Estimation in Small-World Networks Under Byzantine Faults. IPDPS 2019: 855-865 - [i39]Reza Fathi, Anisur Rahaman Molla, Gopal Pandurangan:
Efficient Distributed Community Detection in the Stochastic Block Model. CoRR abs/1904.07494 (2019) - [i38]John Augustine, Valerie King, Anisur Rahaman Molla, Gopal Pandurangan, Jared Saia:
Scalable and Secure Computation Among Strangers: Resource-Competitive Byzantine Protocols. CoRR abs/1907.10308 (2019) - [i37]Soumyottam Chatterjee, Gopal Pandurangan, Nguyen Dinh Pham:
Distributed MST: A Smoothed Analysis. CoRR abs/1911.02628 (2019) - 2018
- [j44]Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
The Distributed Minimum Spanning Tree Problem. Bull. EATCS 125 (2018) - [j43]Gopal Pandurangan
Special Issue of ICDCN 2016 (Distributed Computing Track). Theor. Comput. Sci. 709: 1 (2018) - [j42]Gopal Pandurangan
Fast Distributed Algorithms for Connectivity and MST in Large Graphs. ACM Trans. Parallel Comput. 5(1): 4:1-4:22 (2018) - [c65]Soumyottam Chatterjee
The Complexity of Leader Election: A Chasm at Diameter Two. ICDCN 2018: 13:1-13:10 - [c64]Soumyottam Chatterjee
Fast and Efficient Distributed Computation of Hamiltonian Cycles in Random Graphs. ICDCS 2018: 764-774 - [c63]Anisur Rahaman Molla, Gopal Pandurangan
Local Mixing Time: Distributed Computation and Applications. IPDPS 2018: 743-752 - [c62]John Augustine, Anisur Rahaman Molla, Gopal Pandurangan:
Sublinear Message Bounds for Randomized Agreement. PODC 2018: 315-324 - [c61]Gopal Pandurangan
On the Distributed Complexity of Large-Scale Graph Computations. SPAA 2018: 405-414 - [c60]Robert Gmyr, Gopal Pandurangan
Time-Message Trade-Offs in Distributed Algorithms. DISC 2018: 32:1-32:18 - [i36]Anisur Rahaman Molla, Gopal Pandurangan:
Local Mixing Time: Distributed Computation and Applications. CoRR abs/1801.01903 (2018) - [i35]Soumyottam Chatterjee, Reza Fathi, Gopal Pandurangan, Nguyen Dinh Pham:
Fast and Efficient Distributed Computation of Hamiltonian Cycles in Random Graphs. CoRR abs/1804.08819 (2018) - [i34]Mohamad Ahmadi, Fabian Kuhn, Shay Kutten, Anisur Rahaman Molla, Gopal Pandurangan:
The Communication Cost of Information Spreading in Dynamic Networks. CoRR abs/1806.09847 (2018) - [i33]Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson:
The Complexity of Leader Election: A Chasm at Diameter Two. CoRR abs/1809.00273 (2018) - [i32]Robert Gmyr, Gopal Pandurangan:
Time-Message Trade-Offs in Distributed Algorithms. CoRR abs/1810.03513 (2018) - 2017
- [c59]Anisur Rahaman Molla, Gopal Pandurangan:
Distributed Computation of Mixing Time. ICDCN 2017: 5 - [c58]Shreyas Pai
Brief Announcement: Symmetry Breaking in the CONGEST Model: Time- and Message-Efficient Algorithms for Ruling Sets. PODC 2017: 207-209 - [c57]Gopal Pandurangan
A time- and message-optimal distributed algorithm for minimum spanning trees. STOC 2017: 743-756 - [c56]Shreyas Pai
Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets. DISC 2017: 38:1-38:16 - [i31]Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson:
Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets. CoRR abs/1705.07861 (2017) - 2016
- [j41]Gopal Pandurangan
DEX: self-healing expanders. Distributed Comput. 29(3): 163-185 (2016) - [j40]Bernhard Haeupler
Discovery Through Gossip. Random Struct. Algorithms 48(3): 565-587 (2016) - [j39]David G. Harris, Ehab Morsy, Gopal Pandurangan
Efficient computation of sparse structures. Random Struct. Algorithms 49(2): 322-344 (2016) - [j38]John Augustine, Gopal Pandurangan, Peter Robinson:
Distributed Algorithmic Foundations of Dynamic Networks. SIGACT News 47(1): 69-98 (2016) - [c55]Mohammad Tanvir Rahman, Hien Nguyen, Jaspal Subhlok, Gopal Pandurangan
Checkpointing to Minimize Completion Time for Inter-Dependent Parallel Processes on Volunteer Grids. CCGrid 2016: 331-335 - [c54]Gopal Pandurangan
Message Lower Bounds via Efficient Network Synchronization. SIROCCO 2016: 75-91 - [c53]Gopal Pandurangan
Fast Distributed Algorithms for Connectivity and MST in Large Graphs. SPAA 2016: 429-438 - [c52]John Augustine, Chen Avin
Information Spreading in Dynamic Networks Under Oblivious Adversaries. DISC 2016: 399-413 - [i30]Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
Tight Bounds for Distributed Graph Computations. CoRR abs/1602.08481 (2016) - [i29]Mohammad Tanvir Rahman, Hien Nguyen, Jaspal Subhlok, Gopal Pandurangan:
Checkpointing to minimize completion time for Inter-dependent Parallel Processes on Volunteer Grids. CoRR abs/1603.03502 (2016) - [i28]John Augustine, Chen Avin, Mehraneh Liaee, Gopal Pandurangan, Rajmohan Rajaraman:
Information Spreading in Dynamic Networks under Oblivious Adversaries. CoRR abs/1607.05645 (2016) - [i27]Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees. CoRR abs/1607.06883 (2016) - [i26]Anisur Rahaman Molla, Gopal Pandurangan:
Distributed Computation of Mixing Time. CoRR abs/1610.05646 (2016) - 2015
- [j37]Atish Das Sarma, Michael Dinitz
Efficient distributed computation of distance sketches in networks. Distributed Comput. 28(5): 309-320 (2015) - [j36]Shay Kutten, Gopal Pandurangan
On the Complexity of Universal Leader Election. J. ACM 62(1): 7:1-7:27 (2015) - [j35]John Augustine, Gopal Pandurangan
Distributed agreement in dynamic peer-to-peer networks. J. Comput. Syst. Sci. 81(7): 1088-1109 (2015) - [j34]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan
Efficient random walk sampling in distributed networks. J. Parallel Distributed Comput. 77: 84-94 (2015) - [j33]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan
Fast distributed PageRank computation. Theor. Comput. Sci. 561: 113-121 (2015) - [j32]Shay Kutten, Gopal Pandurangan
Sublinear bounds for randomized leader election. Theor. Comput. Sci. 561: 134-143 (2015) - [j31]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan
Distributed computation in dynamic networks via random walks. Theor. Comput. Sci. 581: 45-66 (2015) - [j30]Chinmoy Dutta, Gopal Pandurangan
Coalescing-Branching Random Walks on Graphs. ACM Trans. Parallel Comput. 2(3): 20:1-20:29 (2015) - [c51]John Augustine, Gopal Pandurangan
Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks. FOCS 2015: 350-369 - [c50]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan
Distributed Computation of Sparse Cuts via Random Walks. ICDCN 2015: 6:1-6:10 - [c49]James W. Hegeman, Gopal Pandurangan
Toward Optimal Bounds in the Congested Clique: Graph Connectivity and MST. PODC 2015: 91-100 - [c48]Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan
Distributed Computation of Large-scale Graph Problems. SODA 2015: 391-410 - [c47]John Augustine, Gopal Pandurangan
Fast Byzantine Leader Election in Dynamic Networks. DISC 2015: 276-291 - [i25]Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
Almost Optimal Distributed Algorithms for Large-Scale Graph Problems. CoRR abs/1503.02353 (2015) - 2014
- [j29]Gopal Pandurangan
Xheal: a localized self-healing algorithm using expanders. Distributed Comput. 27(1): 39-54 (2014) - [c46]Gopal Pandurangan
DEX: Self-Healing Expanders. IPDPS 2014: 702-711 - [c45]Michael Elkin, Hartmut Klauck
Can quantum communication speed up distributed computation? PODC 2014: 166-175 - [c44]Gopal Pandurangan
Distributed Algorithmic Foundations of Dynamic Networks. SIROCCO 2014: 18-22 - [c43]Shay Kutten, Danupon Nanongkai, Gopal Pandurangan
Distributed Symmetry Breaking in Hypergraphs. DISC 2014: 469-483 - [i24]Shay Kutten, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson:
Distributed Symmetry Breaking in Hypergraphs. CoRR abs/1405.1649 (2014) - [i23]Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun, Emanuele Viola:
Global Information Sharing under Network Dynamics. CoRR abs/1409.7771 (2014) - [i22]Andrew McGregor, Gopal Pandurangan, Sergei Vassilvitskii:
Algorithms for Large Scale Graphs (NII Shonan Meeting 2014-12). NII Shonan Meet. Rep. 2014 (2014) - 2013
- [j28]Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan
Distributed Random Walks. J. ACM 60(1): 2:1-2:31 (2013) - [j27]Lu He, Fabio Vandin, Gopal Pandurangan
Ballast: A Ball-based Algorithm for Structural Motifs. J. Comput. Biol. 20(2): 137-151 (2013) - [j26]Tim Jacobs, Gopal Pandurangan
Stochastic analysis of a churn-tolerant structured peer-to-peer scheme. Peer-to-Peer Netw. Appl. 6(1): 1-14 (2013) - [c42]David G. Harris, Ehab Morsy, Gopal Pandurangan
Efficient Computation of Balanced Structures. ICALP (2) 2013: 581-593 - [c41]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan
Fast Distributed PageRank Computation. ICDCN 2013: 11-26 - [c40]Shay Kutten, Gopal Pandurangan
Sublinear Bounds for Randomized Leader Election. ICDCN 2013: 348-362 - [c39]John Augustine, Gopal Pandurangan
Fast byzantine agreement in dynamic networks. PODC 2013: 74-83 - [c38]Shay Kutten, Gopal Pandurangan
On the complexity of universal leader election. PODC 2013: 100-109 - [c37]Chinmoy Dutta, Gopal Pandurangan
On the Complexity of Information Spreading in Dynamic Networks. SODA 2013: 717-736 - [c36]John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan
Storage and search in dynamic peer-to-peer networks. SPAA 2013: 53-62 - [c35]Chinmoy Dutta, Gopal Pandurangan
Coalescing-branching random walks on graphs. SPAA 2013: 176-185 - [i21]Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali:
Distributed Random Walks. CoRR abs/1302.4544 (2013) - [i20]John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Eli Upfal:
Storage and Search in Dynamic Peer-to-Peer Networks. CoRR abs/1305.1121 (2013) - [i19]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan:
Distributed Computation of Sparse Cuts. CoRR abs/1310.5407 (2013) - [i18]Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson:
The Distributed Complexity of Large-scale Graph Processing. CoRR abs/1311.6209 (2013) - 2012
- [j25]Maleq Khan, Fabian Kuhn, Dahlia Malkhi, Gopal Pandurangan
Efficient distributed approximation algorithms via probabilistic tree embeddings. Distributed Comput. 25(3): 189-205 (2012) - [j24]Jen-Yeu Chen
Almost-Optimal Gossip-Based Aggregate Computation. SIAM J. Comput. 41(3): 455-483 (2012) - [j23]Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan
Distributed Verification and Hardness of Distributed Approximation. SIAM J. Comput. 41(5): 1235-1265 (2012) - [c34]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan
Near-optimal random walk sampling in distributed networks. INFOCOM 2012: 2906-2910 - [c33]Lu He, Fabio Vandin, Gopal Pandurangan
Ballast: A Ball-Based Algorithm for Structural Motifs. RECOMB 2012: 79-93 - [c32]John Augustine, Gopal Pandurangan
Towards robust and efficient computation in dynamic peer-to-peer networks. SODA 2012: 551-569 - [c31]Bernhard Haeupler
Discovery through gossip. SPAA 2012: 140-149 - [c30]Atish Das Sarma, Michael Dinitz
Efficient computation of distance sketches in distributed networks. SPAA 2012: 318-326 - [c29]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan
Fast Distributed Computation in Dynamic Networks via Random Walks. DISC 2012: 136-150 - [c28]Maleq Khan, Gopal Pandurangan
Brief Announcement: A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model. DISC 2012: 409-410 - [i17]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan:
Near-Optimal Random Walk Sampling in Distributed Networks. CoRR abs/1201.1363 (2012) - [i16]Bernhard Haeupler, Gopal Pandurangan, David Peleg, Rajmohan Rajaraman, Zhifeng Sun:
Discovery through Gossip. CoRR abs/1202.2092 (2012) - [i15]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan:
Fast Distributed Computation in Dynamic Networks via Random Walks. CoRR abs/1205.5525 (2012) - [i14]Maleq Khan, V. S. Anil Kumar, Gopal Pandurangan, Guanhong Pei:
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model. CoRR abs/1206.1113 (2012) - [i13]Gopal Pandurangan, Peter Robinson, Amitabh Trehan:
Self-healing Deterministic Expanders. CoRR abs/1206.1522 (2012) - [i12]Michael Elkin, Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan:
Quantum Distributed Network Computing: Lower Bounds and Techniques. CoRR abs/1207.5211 (2012) - [i11]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan, Eli Upfal:
Fast Distributed PageRank Computation. CoRR abs/1208.3071 (2012) - [i10]Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan:
Sublinear Bounds for Randomized Leader Election. CoRR abs/1210.4822 (2012) - 2011
- [c27]Danupon Nanongkai, Atish Das Sarma, Gopal Pandurangan
A tight unconditional lower bound on distributed randomwalk computation. PODC 2011: 257-266 - [c26]Gopal Pandurangan
Xheal: localized self-healing using expanders. PODC 2011: 301-310 - [c25]Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan
Distributed verification and hardness of distributed approximation. STOC 2011: 363-372 - [i9]Danupon Nanongkai, Atish Das Sarma, Gopal Pandurangan:
A Tight Lower Bound on Distributed Random Walk Computation. CoRR abs/1102.2906 (2011) - [i8]Gopal Pandurangan, Amitabh Trehan:
Xheal: Localized Self-healing using Expanders. CoRR abs/1104.0882 (2011) - [i7]John Augustine, Gopal Pandurangan, Peter Robinson, Eli Upfal:
Towards Robust and Efficient Computation in Dynamic Peer-to-Peer Networks. CoRR abs/1108.0809 (2011) - [i6]Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun:
Information Spreading in Dynamic Networks. CoRR abs/1112.0384 (2011) - [i5]Atish Das Sarma, Michael Dinitz, Gopal Pandurangan:
Efficient Computation of Distance Sketches in Distributed Networks. CoRR abs/1112.1210 (2011) - 2010
- [j22]Gopal Pandurangan
A Universal Online Caching Algorithm Based on Pattern Matching. Algorithmica 57(1): 62-73 (2010) - [j21]S. Muthukrishnan, Gopal Pandurangan
Thresholding random geometric graph properties motivated by ad hoc sensor networks. J. Comput. Syst. Sci. 76(7): 686-696 (2010) - [c24]Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan
Efficient distributed random walks with applications. PODC 2010: 201-210 - [c23]Jen-Yeu Chen
Optimal gossip-based aggregate computation. SPAA 2010: 124-133 - [e1]Gopal Pandurangan, V. S. Anil Kumar, Gu Ming, Yunhao Liu, Yingshu Li:
Wireless Algorithms, Systems, and Applications, 5th International Conference, WASA 2010, Beijing, China, August 15-17, 2010. Proceedings. Lecture Notes in Computer Science 6221, Springer 2010, ISBN 978-3-642-14653-4 [contents] - [i4]Jen-Yeu Chen, Gopal Pandurangan:
Optimal Gossip-Based Aggregate Computation. CoRR abs/1001.3242 (2010) - [i3]Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer:
Distributed Verification and Hardness of Distributed Approximation. CoRR abs/1011.3049 (2010) - [i2]Tim Jacobs, Gopal Pandurangan:
Stochastic Analysis of a Churn-Tolerant Structured Peer-to-Peer Scheme. CoRR abs/1011.3182 (2010)
2000 – 2009
- 2009
- [j20]Yongwook Choi
Energy-Optimal Distributed Algorithms for Minimum Spanning Trees. IEEE J. Sel. Areas Commun. 27(7): 1297-1304 (2009) - [j19]Maleq Khan, Gopal Pandurangan
Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks. IEEE Trans. Parallel Distributed Syst. 20(1): 124-139 (2009) - [c22]Maleq Khan, V. S. Anil Kumar, Madhav V. Marathe, Gopal Pandurangan
Bi-Criteria Approximation Algorithms for Power-Efficient and Low-Interference Topology Control in Unreliable Ad Hoc Networks. INFOCOM 2009: 370-378 - [c21]Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan
Fast distributed random walks. PODC 2009: 161-170 - [c20]Jen-Yeu Chen
Brief announcement: locality-based aggregate computation in wireless sensor networks. PODC 2009: 298-299 - [i1]Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali:
Near-Optimal Sublinear Time Bounds for Distributed Random Walks. CoRR abs/0911.3195 (2009) - 2008
- [j18]Maleq Khan, Gopal Pandurangan
A fast distributed approximation algorithm for minimum spanning trees. Distributed Comput. 20(6): 391-402 (2008) - [j17]Tomek Czajka, Gopal Pandurangan
Improved random graph isomorphism. J. Discrete Algorithms 6(1): 85-92 (2008) - [j16]Vasil S. Denchev, Gopal Pandurangan:
Distributed quantum computing: a new frontier in distributed systems or science fiction? SIGACT News 39(3): 77-95 (2008) - [j15]Alessandro Ferrante, Gopal Pandurangan
On the hardness of optimization in power-law graphs. Theor. Comput. Sci. 393(1-3): 220-230 (2008) - [c19]Fei Xiong, Gopal Pandurangan
Contact replacement for NMR resonance assignment. ISMB 2008: 205-213 - [c18]Maleq Khan, Fabian Kuhn, Dahlia Malkhi, Gopal Pandurangan
Efficient distributed approximation algorithms via probabilistic tree embeddings. PODC 2008: 263-272 - [c17]Yongwook Choi
Energy-optimal distributed algorithms for minimum spanning trees. SPAA 2008: 188-190 - 2007
- [j14]Gopal Pandurangan
Analysis of Randomized Protocols for Conflict-Free Distributed Access. Algorithmica 49(2): 109-126 (2007) - [j13]Gopal Pandurangan, Eli Upfal:
Entropy-based bounds for online algorithms. ACM Trans. Algorithms 3(1): 7:1-7:19 (2007) - [j12]Maleq Khan, Gopal Pandurangan
A simple randomized scheme for constructing low-weight k-connected spanning subgraphs with applications to distributed algorithms. Theor. Comput. Sci. 385(1-3): 101-114 (2007) - [c16]Alessandro Ferrante, Gopal Pandurangan
On the Hardness of Optimization in Power Law Graphs. COCOON 2007: 417-427 - 2006
- [j11]Hetunandan Kamisetty, Chris Bailey-Kellogg, Gopal Pandurangan
An efficient randomized algorithm for contact-based NMR backbone resonance assignment. Bioinform. 22(2): 172-180 (2006) - [j10]Gopal Pandurangan
Using PageRank to Characterize Web Structure. Internet Math. 3(1): 1-20 (2006) - [j9]Jen-Yeu Chen, Gopal Pandurangan
Robust Computation of Aggregates in Wireless Sensor Networks: Distributed Randomized Algorithms and Analysis. IEEE Trans. Parallel Distributed Syst. 17(9): 987-1000 (2006) - [c15]Suresh Jagannathan, Gopal Pandurangan, Siriam Srinivasan:
Query Protocols for Highly Resilient Peer-to-Peer Networks. PDCS 2006: 247-252 - [c14]Petros Drineas
Distance Matrix Reconstruction from Incomplete Distance Information for Sensor Network Localization. SECON 2006: 536-544 - [c13]Maleq Khan, Gopal Pandurangan
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees. DISC 2006: 355-369 - 2005
- [j8]Gopal Pandurangan
On a simple randomized algorithm for finding a 2-factor in sparse graphs. Inf. Process. Lett. 95(1): 321-327 (2005) - [j7]Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pandurangan
A Random Graph Approach to NMR Sequential Assignment. J. Comput. Biol. 12(6): 569-583 (2005) - [c12]Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu:
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis. IPSN 2005: 348-355 - [c11]Gopal Pandurangan, Wojciech Szpankowski:
A universal online caching algorithm based on pattern matching. ISIT 2005: 1151-1155 - [c10]Mohamed R. Fouad, Sonia Fahmy
Latency-sensitive power control for wireless ad-hoc networks. Q2SWinet 2005: 31-38 - [c9]Gopal Pandurangan
Brief announcement: analysis of a randomized contention-resolution protocol for distributed access. PODC 2005: 274 - [c8]S. Muthukrishnan, Gopal Pandurangan:
The bin-covering technique for thresholding random geometric graph properties. SODA 2005: 989-998 - 2004
- [c7]Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pandurangan
A random graph approach to NMR sequential assignment. RECOMB 2004: 58-67 - 2003
- [j6]Gopal Pandurangan
Building low-diameter peer-to-peer networks. IEEE J. Sel. Areas Commun. 21(6): 995-1002 (2003) - 2002
- [b1]Gopal Pandurangan:
Stochastic Analyses of Dynamic Computer Processes. Brown University, USA, 2002 - [j5]Gopal Pandurangan
The restriction mapping problem revisited. J. Comput. Syst. Sci. 65(3): 526-544 (2002) - [c6]Gopal Pandurangan
Using PageRank to Characterize Web Structure. COCOON 2002: 330-339 - 2001
- [c5]Gopal Pandurangan
Building Low-Diameter P2P Networks. FOCS 2001: 492-499 - [c4]Gopal Pandurangan, Eli Upfal:
Can entropy characterize performance of online algorithms?. SODA 2001: 727-734 - 2000
- [j4]Gopal Pandurangan, Eli Upfal:
Static and Dynamic Evaluation of QoS Properties. J. Interconnect. Networks 1(2): 135-150 (2000)
1990 – 1999
- 1999
- [c3]Milos Hauskrecht, Gopal Pandurangan, Eli Upfal:
Computing Near Optimal Strategies for Stochastic Investment Planning Problems. IJCAI 1999: 1310-1315 - [c2]Gopal Pandurangan
Static and Dynamic Evaluation of QoS Properties. STOC 1999: 566-573 - 1995
- [j3]C. P. Gopalakrishnan, C. Pandu Rangan:
Edge-disjoint paths in permutation graphs. Discuss. Math. Graph Theory 15(1): 59-72 (1995) - [j2]C. P. Gopalakrishnan, C. Pandu Rangan, Satyan R. Coorg:
Efficient algorithms for minimal disjoint path problems on chordal graphs. Discuss. Math. Graph Theory 15(2): 119-145 (1995) - [j1]C. P. Gopalakrishnan, C. Pandu Rangan:
A linear algorithms for the two paths problem on permutation graphs. Discuss. Math. Graph Theory 15(2): 147-166 (1995) - 1994
- [c1]C. P. Gopalakrishnan, C. Pandu Rangan:
Edge-Disjoint Paths in Permutation Graphs. ISAAC 1994: 208-216
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-01 01:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: