Prabhakar Raghavan

Prabhakar Raghavan is a Vice President of Engineering at Google. Raghavan is the co-author of the textbooks Randomized Algorithms and Introduction to Information Retrieval. He is a member of the National Academy of Engineering; a Fellow of the ACM and IEEE; and was a Consulting Professor of Computer Science at Stanford University. In 2009, he was awarded a Laurea honoris causa from the University of Bologna. From 2003 to 2009, Raghavan was the editor-in-Chief of Journal of the ACM. He holds a Ph.D. from U.C. Berkeley in Electrical Engineering and Computer Science and a Bachelor of Technology from the Indian Institute of Technology, Madras. Prior to joining Google, he worked at IBM, Verity and Yahoo.

Previous Publications

  •  

    Models for the Compressible Web

    Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Alessandro Panconesi, Prabhakar Raghavan

    SIAM Journal on Computing (2013)

  •  

    Are web users really Markovian?

    Flavio Chierichetti, Ravi Kumar, Prabhakar Raghavan, Tamás Sarlós

    WWW (2012), pp. 609-618

  •  

    An Algorithmic Treatment of Strong Queries.

    Ravi Kumar, Silvio Lattanzi, Prabhakar Raghavan

    WSDM2011

  •  

    An algorithmic treatment of strong queries

    Ravi Kumar, Silvio Lattanzi, Prabhakar Raghavan

    WSDM (2011), pp. 775-784

  •  

    Markov Layout

    Flavio Chierichetti, Ravi Kumar, Prabhakar Raghavan

    FOCS (2011), pp. 492-501

  •  

    Optimizing two-dimensional search results presentation

    Flavio Chierichetti, Ravi Kumar, Prabhakar Raghavan

    WSDM (2011), pp. 257-266

  •  

    Heavy Tails and Models for the Web and Social Networks

    Prabhakar Raghavan

    ICDCN (2010), pp. 2

  •  

    Search is dead!: long live search

    Andrei Z. Broder, Elizabeth F. Churchill, Marti Hearst, Barney Pell, Prabhakar Raghavan, Andrew Tomkins

    WWW (2010), pp. 1337-1338

  •  

    The FUNnest Talks That belong to FUN (Abstract)

    Prabhakar Raghavan

    FUN (2010), pp. 3

  •  

    The Quantitative Analysis of User Behavior Online - Data, Models and Algorithms

    Prabhakar Raghavan

    CSR (2010), pp. 327

  •  

    The Quantitative Analysis of User Behavior Online - Data, Models and Algorithms

    Prabhakar Raghavan

    SWAT (2010), pp. 163

  •  

    Compressed web indexes

    Flavio Chierichetti, Ravi Kumar, Prabhakar Raghavan

    WWW (2009), pp. 451-460

  •  

    Models for the Compressible Web

    Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Alessandro Panconesi, Prabhakar Raghavan

    FOCS (2009), pp. 331-340

  •  

    Models for the Compressible Web.

    Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Alessandro Panconesi, Prabhakar Raghavan

    FOCS2009

  •  

    Next Generation Web Search

    Ricardo A. Baeza-Yates, Prabhakar Raghavan

    SeCO Workshop (2009), pp. 11-23

  •  

    On compressing social networks

    Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Michael Mitzenmacher, Alessandro Panconesi, Prabhakar Raghavan

    KDD (2009), pp. 219-228

  •  

    On compressing social networks.

    Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Michael Mitzenmacher, Alessandro Panconesi, Prabhakar Raghavan

    KDD2009

  •  

    Online story scheduling in web advertising

    Anirban Dasgupta, Arpita Ghosh, Hamid Nazerzadeh, Prabhakar Raghavan

    SODA (2009), pp. 1275-1284

  •  

    Some results of Christos Papadimitriou on internet structure, network routing, and web information

    Jon M. Kleinberg, Prabhakar Raghavan

    Computer Science Review, vol. 3 (2009), pp. 119-125

  •  

    Heavy Tails and Web Models

    Prabhakar Raghavan

    SUM (2008), pp. 4

  •  

    Introduction to information retrieval

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

    Cambridge University Press (2008), I-XXI, 1-482

  •  

    The Changing Face of Web Search

    Prabhakar Raghavan

    CPM (2008), pp. 4

  •  

    Finding near neighbors through cluster pruning

    Flavio Chierichetti, Alessandro Panconesi, Prabhakar Raghavan, Mauro Sozio, Alessandro Tiberi, Eli Upfal

    PODS (2007), pp. 103-112

  •  

    Visualizing tags over time

    Micah Dubinko, Ravi Kumar, Joseph Magnani, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins

    TWEB, vol. 1 (2007)

  •  

    Web Search: Bridging Information Retrieval and Microeconomic Modeling

    Prabhakar Raghavan

    HiPC (2007), pp. 6

  •  

    Web search: from information retrieval to microeconomic modeling

    Prabhakar Raghavan

    CIKM (2007), pp. 1-2

  •  

    Core algorithms in the CLEVER system

    Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins

    ACM Trans. Internet Techn., vol. 6 (2006), pp. 131-152

  •  

    Guest Editors' Introduction

    Fred Douglis, Prabhakar Raghavan

    World Wide Web, vol. 9 (2006), pp. 367-368

  •  

    The Changing Face of Web Search

    Prabhakar Raghavan

    MDM (2006), pp. 2

  •  

    The Changing Face of Web Search

    Prabhakar Raghavan

    PAKDD (2006), pp. 11

  •  

    The changing face of web search: algorithms, auctions and advertising

    Prabhakar Raghavan

    STOC (2006), pp. 129

  •  

    Using PageRank to Characterize Web Structure

    Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal

    Internet Mathematics, vol. 3 (2006), pp. 1-20

  •  

    Visualizing tags over time

    Micah Dubinko, Ravi Kumar, Joseph Magnani, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins

    WWW (2006), pp. 193-202

  •  

    Automatic Subspace Clustering of High Dimensional Data

    Rakesh Agrawal, Johannes Gehrke, Dimitrios Gunopulos, Prabhakar Raghavan

    Data Min. Knowl. Discov., vol. 11 (2005), pp. 5-33

  •   

    Current trends in the integration of searching and browsing

    Andrei Z. Broder, Yoelle S. Maarek, Krishna Bharat, Susan T. Dumais, Steve Papa, Jan O. Pedersen, Prabhakar Raghavan

    WWW (Special interest tracks and posters) (2005), pp. 793

  •  

    Encoding XML in Vector Spaces

    Vinay Kakade, Prabhakar Raghavan

    ECIR (2005), pp. 96-111

  •  

    Incentive Networks

    Prabhakar Raghavan

    LA-WEB (2005)

  •  

    Incentive networks

    Prabhakar Raghavan

    KDD (2005), pp. 1

  •  

    On the Bursty Evolution of Blogspace

    Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins

    World Wide Web, vol. 8 (2005), pp. 159-178

  •  

    Query Incentive Networks

    Jon M. Kleinberg, Prabhakar Raghavan

    FOCS (2005), pp. 132-141

  •  

    Query Incentive Networks

    Prabhakar Raghavan

    ASIAN (2005), pp. 19-21

  •  

    Variable latent semantic indexing

    Anirban Dasgupta, Ravi Kumar, Prabhakar Raghavan, Andrew Tomkins

    KDD (2005), pp. 13-21

  •  

    Anti-aliasing on the web

    Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins

    WWW (2004), pp. 30-39

  •  

    Efficiency-Quality Tradeoffs for Vector Score Aggregation

    Pavan Kumar C. Singitham, Mahathi S. Mahabhashyam, Prabhakar Raghavan

    VLDB (2004), pp. 624-635

  •  

    Multidimensional Cube Packing

    Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Prabhakar Raghavan, Yoshiko Wakabayashi

    Algorithmica, vol. 40 (2004), pp. 173-187

  •  

    Propagation of trust and distrust

    Ramanathan V. Guha, Ravi Kumar, Prabhakar Raghavan, Andrew Tomkins

    WWW (2004), pp. 403-412

  •  

    Segmentation problems

    Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan

    J. ACM, vol. 51 (2004), pp. 263-280

  •  

    Social Networks and the Web

    Prabhakar Raghavan

    AWIC (2004), pp. 1

  •  

    Structure and evolution of blogspace

    Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins

    Commun. ACM, vol. 47 (2004), pp. 35-39

  •  

    Auditing Boolean attributes

    Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan

    J. Comput. Syst. Sci., vol. 66 (2003), pp. 244-253

  •  

    Building low-diameter peer-to-peer networks

    Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal

    IEEE Journal on Selected Areas in Communications, vol. 21 (2003), pp. 995-1002

  •  

    Dynamic schemes for speculative execution of code

    Prabhakar Raghavan, Hadas Shachnai, Mira Yaniv

    Perform. Eval., vol. 53 (2003), pp. 125-142

  •  

    Editorial: Preserving excellence through change

    Prabhakar Raghavan

    J. ACM, vol. 50 (2003), pp. 427-428

  •  

    Extracting and Exploiting Structure in Text Search

    Prabhakar Raghavan

    SIGMOD Conference (2003), pp. 635

  •  

    On the bursty evolution of blogspace

    Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins

    WWW (2003), pp. 568-576

  •   

    SETS: search enhanced by topic segmentation

    Mayank Bawa, Gurmeet Singh Manku, Prabhakar Raghavan

    SIGIR (2003), pp. 306-313

  •   

    Symphony: Distributed Hashing in a Small World

    Gurmeet Singh Manku, Mayank Bawa, Prabhakar Raghavan

    USENIX Symposium on Internet Technologies and Systems (2003)

  •  

    A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search

    Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Ravi Kannan, Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan, Uwe Schöning

    Theor. Comput. Sci., vol. 289 (2002), pp. 69-83

  •  

    Competitive recommendation systems

    Petros Drineas, Iordanis Kerenidis, Prabhakar Raghavan

    STOC (2002), pp. 82-90

  •  

    Mining Significant Associations in Large Scale Text Corpora

    Prabhakar Raghavan, Panayiotis Tsaparas

    ICDM (2002), pp. 402-409

  •  

    More on random walks, electrical networks, and the harmonic k-server algorithm

    Yair Bartal, Marek Chrobak, John Noga, Prabhakar Raghavan

    Inf. Process. Lett., vol. 84 (2002), pp. 271-276

  •  

    Query Strategies for Priced Information

    Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, Amit Sahai

    J. Comput. Syst. Sci., vol. 64 (2002), pp. 785-819

  •  

    Social Networks: From the Web to the Enterprise

    Prabhakar Raghavan

    IEEE Internet Computing, vol. 6 (2002), pp. 91-94

  •  

    The Web and Social Networks

    Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins

    IEEE Computer, vol. 35 (2002), pp. 32-36

  •  

    Thematic mapping - from unstructured documents to taxonomies

    Christina Yip Chung, Raymond Lieu, Jinhui Liu, Alpha K. Luk, Jianchang Mao, Prabhakar Raghavan

    CIKM (2002), pp. 608-610

  •  

    Using PageRank to Characterize Web Structure

    Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal

    COCOON (2002), pp. 330-339

  •  

    Adversarial queuing theory

    Allan Borodin, Jon M. Kleinberg, Prabhakar Raghavan, Madhu Sudan, David P. Williamson

    J. ACM, vol. 48 (2001), pp. 13-38

  •  

    Building Low-Diameter P2P Networks

    Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal

    FOCS (2001), pp. 492-499

  •  

    Multidimensional Cube Packing

    Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Prabhakar Raghavan, Yoshiko Wakabayashi

    Electronic Notes in Discrete Mathematics, vol. 7 (2001), pp. 110-113

  •   

    Navigating large-scale semi-structured data in business portals

    Mani Abrol, Neil Latarche, Uma Mahadevan, Jianchang Mao, Rajat Mukherjee, Prabhakar Raghavan, Michel Tourn, John Wang, Grace Zhang

    VLDB (2001), pp. 663-666

  •  

    On Semi-Automated Web Taxonomy Construction

    Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins

    WebDB (2001), pp. 91-96

  •  

    Recommendation Systems: A Probabilistic Analysis

    Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins

    J. Comput. Syst. Sci., vol. 63 (2001), pp. 42-61

  •  

    Social Networks on the Web and in the Enterprise

    Prabhakar Raghavan

    Web Intelligence (2001), pp. 58-60

  •  

    Structured and Unstructured Search in Enterprises

    Prabhakar Raghavan

    IEEE Data Eng. Bull., vol. 24 (2001), pp. 15-18

  •  

    Auditing Boolean Attributes

    Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan

    PODS (2000), pp. 86-91

  •  

    Clustering Categorical Data: An Approach Based on Dynamical Systems

    David Gibson, Jon M. Kleinberg, Prabhakar Raghavan

    VLDB J., vol. 8 (2000), pp. 222-236

  •  

    Graph Structure of the Web: A Survey

    Prabhakar Raghavan

    LATIN (2000), pp. 123-125

  •  

    Graph structure in the Web

    Andrei Z. Broder, Ravi Kumar, Farzin Maghoul, Prabhakar Raghavan, Sridhar Rajagopalan, Raymie Stata, Andrew Tomkins, Janet L. Wiener

    Computer Networks, vol. 33 (2000), pp. 309-320

  •  

    Latent Semantic Indexing: A Probabilistic Analysis

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

    J. Comput. Syst. Sci., vol. 61 (2000), pp. 217-235

  •  

    Markov Paging

    Anna R. Karlin, Steven J. Phillips, Prabhakar Raghavan

    SIAM J. Comput., vol. 30 (2000), pp. 906-922

  •  

    Random graph models for the web graph

    Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal

    FOCS (2000), pp. 57-65

  •  

    Random walks with ``back buttons'' (extended abstract)

    Ronald Fagin, Anna R. Karlin, Jon M. Kleinberg, Prabhakar Raghavan, Sridhar Rajagopalan, Ronitt Rubinfeld, Madhu Sudan, Andrew Tomkins

    STOC (2000), pp. 484-493

  •  

    The Web as a Graph

    Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal

    PODS (2000), pp. 1-10

  •  

    A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata

    Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa

    SIAM J. Comput., vol. 28 (1999), pp. 1051-1072

  •  

    Combinatorial and experimental results for randomized point matching algorithms

    Sandy Irani, Prabhakar Raghavan

    Comput. Geom., vol. 12 (1999), pp. 17-31

  •  

    Extracting Large-Scale Knowledge Bases from the Web

    Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins

    VLDB (1999), pp. 639-650

  •  

    Mining the Web's Link Structure

    Soumen Chakrabarti, Byron Dom, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins, David Gibson, Jon M. Kleinberg

    IEEE Computer, vol. 32 (1999), pp. 60-67

  •  

    On targeting Markov segments

    Moses Charikar, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins

    STOC (1999), pp. 99-108

  •  

    The Web as a Graph: Measurements, Models, and Methods

    Jon M. Kleinberg, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins

    COCOON (1999), pp. 1-17

  •  

    Topic Distillation and Spectral Filtering

    Soumen Chakrabarti, Byron Dom, David Gibson, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins

    Artif. Intell. Rev., vol. 13 (1999), pp. 409-435

  •  

    Trawling the Web for Emerging Cyber-Communities

    Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins

    Computer Networks, vol. 31 (1999), pp. 1481-1493

  •  

    A Microeconomic View of Data Mining

    Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan

    Data Min. Knowl. Discov., vol. 2 (1998), pp. 311-324

  •  

    Approximation Schemes for Euclidean k-Medians and Related Problems

    Sanjeev Arora, Prabhakar Raghavan, Satish Rao

    STOC (1998), pp. 106-113

  •  

    Automatic Resource Compilation by Analyzing Hyperlink Structure and Associated Text

    Soumen Chakrabarti, Byron Dom, Prabhakar Raghavan, Sridhar Rajagopalan, David Gibson, Jon M. Kleinberg

    Computer Networks, vol. 30 (1998), pp. 65-74

  •  

    Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications

    Rakesh Agrawal, Johannes Gehrke, Dimitrios Gunopulos, Prabhakar Raghavan

    SIGMOD Conference (1998), pp. 94-105

  •  

    Clustering Categorical Data: An Approach Based on Dynamical Systems

    David Gibson, Jon M. Kleinberg, Prabhakar Raghavan

    VLDB (1998), pp. 311-322

  •  

    Dynamic Schemes for Speculative Execution of Code

    Prabhakar Raghavan, Hadas Shachnai, Mira Yaniv

    MASCOTS (1998), pp. 309-

  •  

    Inferring Web Communities from Link Topology

    David Gibson, Jon M. Kleinberg, Prabhakar Raghavan

    Hypertext (1998), pp. 225-234

  •  

    Latent Semantic Indexing: A Probabilistic Analysis

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

    PODS (1998), pp. 159-168

  •  

    On a theory of computing symposia

    Avrim Blum, Prabhakar Raghavan

    SIGACT News, vol. 29 (1998), pp. 104-111

  •  

    Randomized Query Processing in Robot Path Planning

    Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, Prabhakar Raghavan

    J. Comput. Syst. Sci., vol. 57 (1998), pp. 50-66

  •  

    Recommendation Systems: A Probabilistic Analysis

    Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins

    FOCS (1998), pp. 664-673

  •  

    Scalable Feature Selection, Classification and Signature Generation for Organizing Large Text Databases into Hierarchical Topic Taxonomies

    Soumen Chakrabarti, Byron Dom, Rakesh Agrawal, Prabhakar Raghavan

    VLDB J., vol. 7 (1998), pp. 163-178

  •  

    Segmentation Problems

    Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan

    STOC (1998), pp. 473-482

  •  

    Stochastic Contention Resolution With Short Delays

    Prabhakar Raghavan, Eli Upfal

    SIAM J. Comput., vol. 28 (1998), pp. 709-719

  •  

    A Random Sampling Scheme for Path Planning

    Jérôme Barraquand, Lydia E. Kavraki, Jean-Claude Latombe, Tsai-Yen Li, Rajeev Motwani, Prabhakar Raghavan

    I. J. Robotic Res., vol. 16 (1997), pp. 759-774

  •  

    How much can hardware help routing?

    Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal

    J. ACM, vol. 44 (1997), pp. 726-741

  •  

    Information Retrieval Algorithms: A Survey

    Prabhakar Raghavan

    SODA (1997), pp. 11-18

  •  

    Locality-Preserving Hashing in Multidimensional Spaces

    Piotr Indyk, Rajeev Motwani, Prabhakar Raghavan, Santosh Vempala

    STOC (1997), pp. 618-625

  •  

    Navigating in Unfamiliar Geometric Terrain

    Avrim Blum, Prabhakar Raghavan, Baruch Schieber

    SIAM J. Comput., vol. 26 (1997), pp. 110-137

  •  

    Strategic directions in research in theory of computing

    Anne Condon, Faith Fich, Greg N. Frederickson, Andrew V. Goldberg, David S. Johnson, Michael C. Loui, Steven Mahaney, Prabhakar Raghavan, John E. Savage, Alan L. Selman, David B. Shmoys

    SIGACT News, vol. 28 (1997), pp. 75-93

  •  

    The Electrical Resistance of a Graph Captures its Commute and Cover Times

    Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo, Roman Smolensky, Prasoon Tiwari

    Computational Complexity, vol. 6 (1997), pp. 312-340

  •  

    Using Taxonomy, Discriminants, and Signatures for Navigating in Text Databases

    Soumen Chakrabarti, Byron Dom, Rakesh Agrawal, Prabhakar Raghavan

    VLDB (1997), pp. 446-455

  •  

    A Linear Method for Deviation Detection in Large Databases

    Andreas Arning, Rakesh Agrawal, Prabhakar Raghavan

    KDD (1996), pp. 164-169

  •  

    A Theory of Wormhole Routing in Parallel Computers

    Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal

    IEEE Trans. Computers, vol. 45 (1996), pp. 704-713

  •  

    Adversarial Queueing Theory

    Allan Borodin, Jon M. Kleinberg, Prabhakar Raghavan, Madhu Sudan, David P. Williamson

    STOC (1996), pp. 376-385

  •  

    Combinatorial and Experimental Results for Randomized Point Matching Algorithms

    Sandy Irani, Prabhakar Raghavan

    Symposium on Computational Geometry (1996), pp. 68-77

  •  

    Computational Geometry Impact Potential: A Business and Industrial Perspective

    Prabhakar Raghavan

    CCCG (1996), pp. 276

  •  

    Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata

    Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa

    Inf. Comput., vol. 130 (1996), pp. 101-129

  •  

    Competitive Paging with Locality of Reference

    Allan Borodin, Sandy Irani, Prabhakar Raghavan, Baruch Schieber

    J. Comput. Syst. Sci., vol. 50 (1995), pp. 244-258

  •  

    Motion planning for a steering-constrained robot through moderate obstacles

    Pankaj K. Agarwal, Prabhakar Raghavan, Hisao Tamaki

    STOC (1995), pp. 343-352

  •  

    Randomized Algorithms

    Rajeev Motwani, Prabhakar Raghavan

    SIGACT News, vol. 26 (1995), pp. 48-50

  •  

    Randomized query processing in robot path planning (Extended Abstract)

    Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, Prabhakar Raghavan

    STOC (1995), pp. 353-362

  •  

    Robust Algorithms for Packet Routing in a Mesh

    Prabhakar Raghavan

    Mathematical Systems Theory, vol. 28 (1995), pp. 1-11

  •  

    Stochastic contention resolution with short delays

    Prabhakar Raghavan, Eli Upfal

    STOC (1995), pp. 229-237

  •  

    The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height

    Andrei Z. Broder, Martin E. Dyer, Alan M. Frieze, Prabhakar Raghavan, Eli Upfal

    Inf. Process. Lett., vol. 56 (1995), pp. 79-81

  •  

    Computing with Noisy Information

    Uriel Feige, Prabhakar Raghavan, David Peleg, Eli Upfal

    SIAM J. Comput., vol. 23 (1994), pp. 1001-1018

  •  

    Efficient routing in all-optical networks

    Prabhakar Raghavan, Eli Upfal

    STOC (1994), pp. 134-143

  •  

    Guest Editor's Foreword: Special Issue on On-Line Algorithms

    Prabhakar Raghavan

    Algorithmica, vol. 11 (1994), pp. 1

  •  

    Memory versus randomization in on-line algorithms

    Prabhakar Raghavan, Marc Snir

    IBM Journal of Research and Development, vol. 38 (1994), pp. 683-708

  •  

    Motion Planning on a Graph (Extended Abstract)

    Christos H. Papadimitriou, Prabhakar Raghavan, Madhu Sudan, Hisao Tamaki

    FOCS (1994), pp. 511-520

  •  

    Randomized Approximation Algorithms in Combinatorial Optimization

    Prabhakar Raghavan

    FSTTCS (1994), pp. 300-317

  •  

    The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection

    Kazuo Iwano, Prabhakar Raghavan, Hisao Tamaki

    ISAAC (1994), pp. 29-37

  •  

    The minimum latency problem

    Avrim Blum, Prasad Chalasani, Don Coppersmith, William R. Pulleyblank, Prabhakar Raghavan, Madhu Sudan

    STOC (1994), pp. 163-171

  •  

    Trading Space for Time in Undirected s-t Connectivity

    Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal

    SIAM J. Comput., vol. 23 (1994), pp. 324-334

  •  

    Fast Deflection Routing for Packets and Worms (Extended Summary)

    Amotz Bar-Noy, Prabhakar Raghavan, Baruch Schieber, Hisao Tamaki

    PODC (1993), pp. 75-86

  •  

    How much can hardware help routing?

    Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal

    STOC (1993), pp. 573-582

  •  

    Random Walks on Weighted Graphs and Applications to On-line Algorithms

    Don Coppersmith, Peter Doyle, Prabhakar Raghavan, Marc Snir

    J. ACM, vol. 40 (1993), pp. 421-453

  •  

    Randomized Algorithms and Pseudorandom Numbers

    Howard J. Karloff, Prabhakar Raghavan

    J. ACM, vol. 40 (1993), pp. 454-476

  •  

    A Theory of Wormhole Routing in Parallel Computers (Extended Abstract)

    Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal

    FOCS (1992), pp. 563-572

  •  

    An Experimental Study of Wormhole Routing in Parallel Computers

    Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal

    Heinz Nixdorf Symposium (1992), pp. 156-165

  •  

    Exact Analysis of Hot-Potato Routing (Extended Abstract)

    Uriel Feige, Prabhakar Raghavan

    FOCS (1992), pp. 553-562

  •  

    Fast Geometric Approximation Techniques and Geometric Embedding Problems

    Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber

    Theor. Comput. Sci., vol. 106 (1992), pp. 265-281

  •  

    Integer Programming in VLSI Design

    Prabhakar Raghavan

    Discrete Applied Mathematics, vol. 40 (1992), pp. 29-43

  •  

    Markov Paging (Extended Abstract)

    Anna R. Karlin, Steven J. Phillips, Prabhakar Raghavan

    FOCS (1992), pp. 208-217

  •  

    Optimal Time Bounds for Some Proximity Problems in the Plane

    Alok Aggarwal, Herbert Edelsbrunner, Prabhakar Raghavan, Prasoon Tiwari

    Inf. Process. Lett., vol. 42 (1992), pp. 55-60

  •  

    Competitive Paging with Locality of Reference (Preliminary Version)

    Allan Borodin, Sandy Irani, Prabhakar Raghavan, Baruch Schieber

    STOC (1991), pp. 249-259

  •  

    Deferred Data Structure for the Nearest Neighbor Problem

    Alok Aggarwal, Prabhakar Raghavan

    Inf. Process. Lett., vol. 40 (1991), pp. 119-122

  •  

    Multiterminal Global Routing: A Deterministic Approximation Scheme

    Prabhakar Raghavan, Clark D. Thompson

    Algorithmica, vol. 6 (1991), pp. 73-82

  •  

    Navigating in Unfamiliar Geometric Terrain (Preliminary Version)

    Avrim Blum, Prabhakar Raghavan, Baruch Schieber

    STOC (1991), pp. 494-504

  •  

    On the Parallel Complexity of Evaluating Game Trees

    Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal

    SODA (1991), pp. 404-413

  •  

    Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract)

    Christos Kaklamanis, Anna R. Karlin, Frank Thomson Leighton, Victor Milenkovic, Prabhakar Raghavan, Satish Rao, Clark D. Thomborson, A. Tsantilas

    FOCS (1990), pp. 285-296

  •  

    Computing with Unreliable Information (Preliminary Version)

    Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal

    STOC (1990), pp. 128-137

  •  

    Random Walks on Weighted Graphs, and Applications to On-line Algorithms (Preliminary Version)

    Don Coppersmith, Peter Doyle, Prabhakar Raghavan, Marc Snir

    STOC (1990), pp. 369-378

  •  

    Randomized Broadcast in Networks

    Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal

    Random Struct. Algorithms, vol. 1 (1990), pp. 447-460

  •  

    Randomized Broadcast in Networks

    Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal

    SIGAL International Symposium on Algorithms (1990), pp. 128-137

  •  

    Time-Space Tradeoffs for Undirected Graph Traversal

    Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa

    FOCS (1990), pp. 429-438

  •  

    Fast Geometric Approximation Techniques and Geometric Embedding Problems

    Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber

    Symposium on Computational Geometry (1989), pp. 292-301

  •  

    Memory Versus Randomization in On-line Algorithms (Extended Abstract)

    Prabhakar Raghavan, Marc Snir

    ICALP (1989), pp. 687-703

  •  

    Parallel Graph Algorithms That Are Efficient on Average

    Don Coppersmith, Prabhakar Raghavan, Martin Tompa

    Inf. Comput., vol. 81 (1989), pp. 318-333

  •  

    Program Correctness: Can One Test For It?

    Manuel Blum, Prabhakar Raghavan

    IFIP Congress (1989), pp. 127-134

  •  

    Robust Algorithms for Packet Routing in a Mesh

    Prabhakar Raghavan

    SPAA (1989), pp. 344-350

  •  

    The Electrical Resistance of a Graph Captures its Commute and Cover Times (Detailed Abstract)

    Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo, Roman Smolensky, Prasoon Tiwari

    STOC (1989), pp. 574-586

  •  

    Trading Space for Time in Undirected s-t Connectivity

    Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal

    STOC (1989), pp. 543-549

  •  

    Energy Consumption in VLSI Circuits (Preliminary Version)

    Alok Aggarwal, Ashok K. Chandra, Prabhakar Raghavan

    STOC (1988), pp. 205-216

  •  

    Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs

    Prabhakar Raghavan

    J. Comput. Syst. Sci., vol. 37 (1988), pp. 130-143

  •  

    Randomized Algorithms and Pseudorandom Numbers

    Howard J. Karloff, Prabhakar Raghavan

    STOC (1988), pp. 310-321

  •  

    Parallel Graph Algorithms that Are Efficient on Average

    Don Coppersmith, Prabhakar Raghavan, Martin Tompa

    FOCS (1987), pp. 260-269

  •  

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

    Prabhakar Raghavan, Clark D. Thompson

    Combinatorica, vol. 7 (1987), pp. 365-374

  •  

    A language for describing rectilinear Steiner tree configurations

    Antony P.-C. Ng, Clark D. Thompson, Prabhakar Raghavan

    DAC (1986), pp. 659-662

  •  

    Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs

    Prabhakar Raghavan

    FOCS (1986), pp. 10-18

  •  

    Provably Good Routing in Graphs: Regular Arrays

    Prabhakar Raghavan, Clark D. Thompson

    STOC (1985), pp. 79-87