World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
89
Citations
73988
World Ranking
627
National Ranking
332

Research.com Recognitions

  • 2014 - IEEE Fellow For contributions to robust scalable sparse solvers and energy-efficient parallel scientific computing
  • 2008 - Member of the National Academy of Engineering For significant contributions to algorithms and the structure of the World Wide Web.
  • 2001 - ACM Fellow For contributions to the theory and practice of randomized algorithms.

Overview

Prabhakar Raghavan is affiliated with Google in the United States. Their research spans multiple areas within computer science, focusing on Network Traffic and Congestion Control, Big Data and Business Intelligence, and Computability, Logic, and AI Algorithms.

Recent publications reflect activity across various domains and venues. Notable papers include:

  • AI-Based Traffic Prediction and Load Balancing in Wireless Networks, 2024, International Journal of Global Innovations and Solutions (IJGIS)
  • Search Engines: From the Lab to the Engine Room, and Back, 2022, Proceedings of the ACM Web Conference 2022
  • From Legacy QA to Continuous Quality: Lessons in Leading Multi-Vendor Testing across Critical Industries, 2023, International Journal of Innovative Research in Computer and Communication Engineering
  • The Future of Quality Engineering: How AI-Driven Test Automation is Redefining Enterprise Delivery, 2022, International Journal of Innovative Research in Science Engineering and Technology
  • The Future of Quality Engineering: How AI-Driven Test Automation is Redefining Enterprise Delivery, 2025, SSRN Electronic Journal

Frequent co-authors include:

  • Satyen Kumar Panda
  • Abhishek Upadhyay
  • Sukanya Konatam
  • Naresh Dulam
  • Ansh Nagda

Published work has appeared in these venues:

  • International Journal of Global Innovations and Solutions (IJGIS)
  • Proceedings of the ACM Web Conference 2022
  • International Journal of Innovative Research in Computer and Communication Engineering
  • International Journal of Innovative Research in Science Engineering and Technology
  • SSRN Electronic Journal

Research spans several subfields of study, including:

  • Computer Networks and Communications
  • Management Information Systems
  • Computational Theory and Mathematics

Recognitions and honors received by Prabhakar Raghavan include:

  • IEEE Fellow (2014) for contributions to robust scalable sparse solvers and energy-efficient parallel scientific computing
  • Member of the National Academy of Engineering (2008) for significant contributions to algorithms and the structure of the World Wide Web
  • ACM Fellow (2001) for contributions to the theory and practice of randomized algorithms

Best Publications

  • Introduction to Information Retrieval

    Christopher D. Manning;Prabhakar Raghavan;Hinrich Schütze

  • Randomized Algorithms

    Rajeev Motwani;Prabhakar Raghavan

  • Graph structure in the Web

    Andrei Broder;Ravi Kumar;Farzin Maghoul;Prabhakar Raghavan

  • Automatic subspace clustering of high dimensional data for data mining applications

    Rakesh Agrawal;Johannes Gehrke;Dimitrios Gunopulos;Prabhakar Raghavan

  • Propagation of trust and distrust

    R. Guha;Ravi Kumar;Prabhakar Raghavan;Andrew Tomkins

  • Latent semantic indexing: a probabilistic analysis

    Christos H. Papadimitriou;Hisao Tamaki;Prabhakar Raghavan;Santosh Vempala

  • Trawling the Web for emerging cyber-communities

    Ravi Kumar;Prabhakar Raghavan;Sridhar Rajagopalan;Andrew Tomkins

  • The web as a graph: measurements, models, and methods

    Jon M. Kleinberg;Ravi Kumar;Prabhakar Raghavan;Sridhar Rajagopalan

  • Inferring Web communities from link topology

    David Gibson;Jon Kleinberg;Prabhakar Raghavan

  • Randomized rounding: a technique for provably good algorithms and algorithmic proofs

    Prabhakar Raghavan;Clark D. Tompson

  • Automatic resource compilation by analyzing hyperlink structure and associated text

    Soumen Chakrabarti;Byron Dom;Prabhakar Raghavan;Sridhar Rajagopalan

  • Geographic routing in social networks

    David Liben-Nowell;Jasmine Novak;Ravi Kumar;Prabhakar Raghavan

  • Stochastic models for the Web graph

    R. Kumar;P. Raghavan;S. Rajagopalan;D. Sivakumar

  • Mining the Web's link structure

    S. Chakrabarti;B.E. Dom;S.R. Kumar;P. Raghavan

  • On the bursty evolution of blogspace

    Ravi Kumar;Jasmine Novak;Prabhakar Raghavan;Andrew Tomkins

  • The electrical resistance of a graph captures its commute and cover times

    Ashok K. Chandra;Prabhakar Raghavan;Walter L. Ruzzo;Roman Smolensky

  • Visualizing tags over time

    Micah Dubinko;Ravi Kumar;Joseph Magnani;Jasmine Novak

  • Multilevel taxonomy based on features derived from training documents classification using fisher values as discrimination values

    Rakesh Agrawal;Soumen Chakrabarti;Byron Edward Dom;Prabhakar Raghavan

  • Symphony: distributed hashing in a small world

    Gurmeet Singh Manku;Mayank Bawa;Prabhakar Raghavan

  • Computing on data streams

    Monika R. Henzinger;Prabhakar Raghavan;Sridhar Rajagopalan

  • Latent Semantic Indexing

    Christos H. Papadimitriou;Prabhakar Raghavan;Hisao Tamaki;Santosh Vempala

  • Randomized Algorithms: Tail Inequalities

    Rajeev Motwani;Prabhakar Raghavan

  • Randomized Rounding: A Technique for Provably Good Algorithms and

    Prabhakar Raghavan;Clark D. Thompson

Frequent Co-Authors

Andrew Tomkins
Andrew Tomkins Google (United States)
Ravi Kumar
Ravi Kumar Google (United States)
Christopher D. Manning
Christopher D. Manning Stanford University
Eli Upfal
Eli Upfal Brown University
Hinrich Schütze
Hinrich Schütze Ludwig-Maximilians-Universität München
Jon Kleinberg
Jon Kleinberg Cornell University
Sridhar Rajagopalan
Sridhar Rajagopalan IBM (United States)
Rajeev Motwani
Rajeev Motwani Stanford University
Don Coppersmith
Don Coppersmith IBM (United States)
Anna R. Karlin
Anna R. Karlin University of Washington

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 degree options can significantly broaden your career opportunities in computer science. If you’re looking to jumpstart your career quickly, consider shortest masters degree programs, which allow you to earn an advanced qualification in less time.

For those weighing the long-term value, it’s important to focus on masters degrees that are worth it, especially those in high demand within the technology and engineering fields. These programs can lead to better job prospects and higher earning potential.

If you prefer a more flexible or affordable path, an associate degree online offers foundational skills that serve as a stepping stone to further education or entry-level tech jobs.

Budget-conscious students should also explore affordable online degree programs to minimize student debt while still accessing quality education. By comparing these options, you can tailor your education pathway to meet your career goals and financial needs.

Best Scientists Citing Prabhakar Raghavan

Trending Scientists

Recently Published Articles