World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
38
Citations
5308
World Ranking
10349
National Ranking
4334

Research.com Recognitions

  • 2009 - ACM Senior Member

Overview

Gopal Pandurangan is affiliated with the University of Houston in the United States. Their research spans primarily the field of Computer Science, with a focus on several subfields including Computer Networks and Communications, Artificial Intelligence, and Computational Theory and Mathematics. Their work also touches on Statistics and Probability as well as Modeling and Simulation.

Their main research topics include distributed systems and fault tolerance, complexity and algorithms in graphs, privacy-preserving technologies in data, cryptography and data security, caching and content delivery, optimization and search problems, and cooperative communication and network coding.

Frequent coauthors of Pandurangan are Fabien Dufoulon, William K. Moses, Peter Robinson, John Augustine, and Anisur Rahaman Molla.

The scientist has contributed to various publication venues, including:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Padua Research Archive (University of Padua)
  • 2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)
  • PLoS ONE

Sample recent papers authored or coauthored by Gopal Pandurangan include:

  • "On the distributed complexity of large-scale graph computations," 2021, Padua Research Archive (University of Padua)
  • "Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols," 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • "Awake-Efficient Distributed Algorithms for Maximal Independent Set," 2022, 2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)
  • "A time- and message-optimal distributed algorithm for minimum spanning trees," 2020, Padua Research Archive (University of Padua)
  • "The Message Complexity of Distributed Graph Optimization," 2023, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Gopal Pandurangan was awarded the ACM Senior Member designation in 2009.

Best Publications

  • Building low-diameter peer-to-peer networks

    G. Pandurangan;P. Raghavan;E. Upfal

  • Building low-diameter P2P networks

    G. Pandurangan;P. Raghavan;E. Upfal

  • Using PageRank to Characterize Web Structure

    Gopal Pandurangan;Prabhakar Raghavan;Eli Upfal

  • Robust Computation of Aggregates in Wireless Sensor Networks: Distributed Randomized Algorithms and Analysis

    J.-Y. Chen;G. Pandurangan;D. Xu

  • Distributed Verification and Hardness of Distributed Approximation

    Atish Das Sarma;Stephan Holzer;Liah Kor;Amos Korman

  • Fast Distributed PageRank Computation

    Atish Das Sarma;Anisur Rahaman Molla;Gopal Pandurangan;Gopal Pandurangan;Eli Upfal

  • Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks

    M. Khan;G. Pandurangan;V.S. Anil Kumar

  • Fast Distributed PageRank Computation

    Unknown

  • The bin-covering technique for thresholding random geometric graph properties

    S. Muthukrishnan;Gopal Pandurangan

  • Toward Optimal Bounds in the Congested Clique: Graph Connectivity and MST

    James W. Hegeman;Gopal Pandurangan;Sriram V. Pemmaraju;Vivek B. Sardeshmukh

  • Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis

    Jen-Yeu Chen;Gopal Pandurangan;Dongyan Xu

  • Distance Matrix Reconstruction from Incomplete Distance Information for Sensor Network Localization

    P. Drineas;A. Javed;M. Magdon-Ismail;G. Pandurangan

  • A fast distributed approximation algorithm for minimum spanning trees

    Maleq Khan;Gopal Pandurangan

  • On the Complexity of Universal Leader Election

    Shay Kutten;Gopal Pandurangan;David Peleg;Peter Robinson

  • Towards robust and efficient computation in dynamic peer-to-peer networks

    John Augustine;Gopal Pandurangan;Peter Robinson;Eli Upfal

  • Distributed computation of large-scale graph problems

    Hartmut Klauck;Danupon Nanongkai;Gopal Pandurangan;Peter Robinson

  • Distributed verification and hardness of distributed approximation

    Atish Das Sarma;Stephan Holzer;Liah Kor;Amos Korman

  • Distributed quantum computing: a new frontier in distributed systems or science fiction?

    Vasil S. Denchev;Gopal Pandurangan

  • Efficient distributed approximation algorithms via probabilistic tree embeddings

    Maleq Khan;Fabian Kuhn;Dahlia Malkhi;Gopal Pandurangan

  • Using PageRank to Characterize Web Structure

    Gopal Pandurangan;Prabhakar Raghavan;Eli Upfal

  • On the complexity of information spreading in dynamic networks

    Chinmoy Dutta;Gopal Pandurangan;Rajmohan Rajaraman;Zhifeng Sun

Frequent Co-Authors

Peter Robinson
Peter Robinson University of Cambridge
Danupon Nanongkai
Danupon Nanongkai Max Planck Institute for Informatics
Eli Upfal
Eli Upfal Brown University
David Peleg
David Peleg Weizmann Institute of Science
Shay Kutten
Shay Kutten Technion – Israel Institute of Technology
Rajmohan Rajaraman
Rajmohan Rajaraman Northeastern University
Prasad Tetali
Prasad Tetali Carnegie Mellon University
Prabhakar Raghavan
Prabhakar Raghavan Google (United States)
Michael Elkin
Michael Elkin Ben-Gurion University of the Negev
Fabian Kuhn
Fabian Kuhn University of Freiburg

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online degrees in Computer Science can open doors to a variety of lucrative and flexible career options. Many students start with an online associate degree, giving them a strong foundation and an affordable pathway to higher-level studies or entry-level tech jobs.

For those eager to advance quickly, pursuing the fastest online master's degree programs may be ideal. These accelerated degrees can significantly reduce the time needed to upskill and qualify for advanced positions in fields like software development, data science, and cybersecurity.

Choosing one of the most useful masters degrees can ensure your credentials remain in high demand, making you more competitive in the evolving technology job market.

Additionally, earning certifications that pay well can supplement your degree, helping you specialize in niche areas and increase your earning potential. Together, these online pathways can help you build a flexible, successful career in Computer Science.

Best Scientists Citing Gopal Pandurangan

Trending Scientists