default search action
Prabhakar Raghavan
Person information
- affiliation: Stanford University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c116]Prabhakar Raghavan:
Search Engines: From the Lab to the Engine Room, and Back: Keynote Talk. WWW 2022: 1
2010 – 2019
- 2016
- [c115]Marco Bressan, Stefano Leucci, Alessandro Panconesi, Prabhakar Raghavan, Erisa Terolli:
The Limits of Popularity-Based Recommendations, and the Role of Social Ties. KDD 2016: 745-754 - [i3]Marco Bressan, Stefano Leucci, Alessandro Panconesi, Prabhakar Raghavan, Erisa Terolli:
The Limits of Popularity-Based Recommendations, and the Role of Social Ties. CoRR abs/1607.04263 (2016) - 2014
- [j72]Prabhakar Raghavan:
It's time to scale the science in the social sciences. Big Data Soc. 1(1): 205395171453224 (2014) - 2013
- [j71]Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Alessandro Panconesi, Prabhakar Raghavan:
Models for the Compressible Web. SIAM J. Comput. 42(5): 1777-1802 (2013) - 2012
- [j70]Prabhakar Raghavan:
Rajeev Motwani (1962-2009). Theory Comput. 8(1): 55-68 (2012) - [c114]Flavio Chierichetti, Ravi Kumar, Prabhakar Raghavan, Tamás Sarlós:
Are web users really Markovian? WWW 2012: 609-618 - 2011
- [c113]Flavio Chierichetti, Ravi Kumar, Prabhakar Raghavan:
Markov Layout. FOCS 2011: 492-501 - [c112]Flavio Chierichetti, Ravi Kumar, Prabhakar Raghavan:
Optimizing two-dimensional search results presentation. WSDM 2011: 257-266 - [c111]Ravi Kumar, Silvio Lattanzi, Prabhakar Raghavan:
An algorithmic treatment of strong queries. WSDM 2011: 775-784 - 2010
- [c110]Prabhakar Raghavan:
The Quantitative Analysis of User Behavior Online - Data, Models and Algorithms. CSR 2010: 327 - [c109]Prabhakar Raghavan:
The FUNnest Talks That belong to FUN (Abstract). FUN 2010: 3 - [c108]Prabhakar Raghavan:
Heavy Tails and Models for the Web and Social Networks. ICDCN 2010: 2 - [c107]Prabhakar Raghavan:
The Quantitative Analysis of User Behavior Online - Data, Models and Algorithms. SWAT 2010: 163 - [c106]Andrei Z. Broder, Elizabeth F. Churchill, Marti A. Hearst, Barney Pell, Prabhakar Raghavan, Andrew Tomkins:
Search is dead!: long live search. WWW 2010: 1337-1338
2000 – 2009
- 2009
- [j69]Jon M. Kleinberg, Prabhakar Raghavan:
Some results of Christos Papadimitriou on internet structure, network routing, and web information. Comput. Sci. Rev. 3(2): 119-125 (2009) - [c105]Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Alessandro Panconesi, Prabhakar Raghavan:
Models for the Compressible Web. FOCS 2009: 331-340 - [c104]Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Michael Mitzenmacher, Alessandro Panconesi, Prabhakar Raghavan:
On compressing social networks. KDD 2009: 219-228 - [c103]Ricardo Baeza-Yates, Prabhakar Raghavan:
Next Generation Web Search. SeCO Workshop 2009: 11-23 - [c102]Anirban Dasgupta, Arpita Ghosh, Hamid Nazerzadeh, Prabhakar Raghavan:
Online story scheduling in web advertising. SODA 2009: 1275-1284 - [c101]Flavio Chierichetti, Ravi Kumar, Prabhakar Raghavan:
Compressed web indexes. WWW 2009: 451-460 - 2008
- [b2]Christopher D. Manning, Prabhakar Raghavan, Hinrich Schütze:
Introduction to information retrieval. Cambridge University Press 2008, ISBN 978-0-521-86571-5, pp. I-XXI, 1-482 - [c100]Prabhakar Raghavan:
The Changing Face of Web Search. CPM 2008: 4 - [c99]Prabhakar Raghavan:
Heavy Tails and Web Models. SUM 2008: 4 - 2007
- [j68]Micah Dubinko, Ravi Kumar, Joseph Magnani, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins:
Visualizing tags over time. ACM Trans. Web 1(2): 7 (2007) - [c98]Prabhakar Raghavan:
Web search: from information retrieval to microeconomic modeling. CIKM 2007: 1-2 - [c97]Prabhakar Raghavan:
Web Search: Bridging Information Retrieval and Microeconomic Modeling. HiPC 2007: 6 - [c96]Flavio Chierichetti, Alessandro Panconesi, Prabhakar Raghavan, Mauro Sozio, Alessandro Tiberi, Eli Upfal:
Finding near neighbors through cluster pruning. PODS 2007: 103-112 - 2006
- [j67]Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal:
Using PageRank to Characterize Web Structure. Internet Math. 3(1): 1-20 (2006) - [j66]Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins:
Core algorithms in the CLEVER system. ACM Trans. Internet Techn. 6(2): 131-152 (2006) - [j65]Fred Douglis, Prabhakar Raghavan:
Guest Editors' Introduction. World Wide Web 9(4): 367-368 (2006) - [c95]Prabhakar Raghavan:
The Changing Face of Web Search. MDM 2006: 2 - [c94]Prabhakar Raghavan:
The Changing Face of Web Search. PAKDD 2006: 11 - [c93]Prabhakar Raghavan:
The changing face of web search: algorithms, auctions and advertising. STOC 2006: 129 - [c92]Micah Dubinko, Ravi Kumar, Joseph Magnani, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins:
Visualizing tags over time. WWW 2006: 193-202 - 2005
- [j64]Rakesh Agrawal, Johannes Gehrke, Dimitrios Gunopulos, Prabhakar Raghavan:
Automatic Subspace Clustering of High Dimensional Data. Data Min. Knowl. Discov. 11(1): 5-33 (2005) - [j63]David Liben-Nowell, Jasmine Novak, Ravi Kumar, Prabhakar Raghavan, Andrew Tomkins:
Geographic routing in social networks. Proc. Natl. Acad. Sci. USA 102(33): 11623-11628 (2005) - [j62]Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins:
On the Bursty Evolution of Blogspace. World Wide Web 8(2): 159-178 (2005) - [c91]Prabhakar Raghavan:
Query Incentive Networks. ASIAN 2005: 19-21 - [c90]Vinay Kakade, Prabhakar Raghavan:
Encoding XML in Vector Spaces. ECIR 2005: 96-111 - [c89]Jon M. Kleinberg, Prabhakar Raghavan:
Query Incentive Networks. FOCS 2005: 132-141 - [c88]Prabhakar Raghavan:
Incentive networks. KDD 2005: 1 - [c87]Anirban Dasgupta, Ravi Kumar, Prabhakar Raghavan, Andrew Tomkins:
Variable latent semantic indexing. KDD 2005: 13-21 - [c86]Prabhakar Raghavan:
Incentive Networks. LA-WEB 2005 - [c85]Andrei Z. Broder, Yoëlle S. Maarek, Krishna Bharat, Susan T. Dumais, Steve Papa, Jan O. Pedersen, Prabhakar Raghavan:
Current trends in the integration of searching and browsing. WWW (Special interest tracks and posters) 2005: 793 - 2004
- [j61]Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Prabhakar Raghavan, Yoshiko Wakabayashi:
Multidimensional Cube Packing. Algorithmica 40(3): 173-187 (2004) - [j60]Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins:
Structure and evolution of blogspace. Commun. ACM 47(12): 35-39 (2004) - [j59]Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan:
Segmentation problems. J. ACM 51(2): 263-280 (2004) - [c84]Prabhakar Raghavan:
Social Networks and the Web. AWIC 2004: 1 - [c83]Pavan Kumar C. Singitham, Mahathi S. Mahabhashyam, Prabhakar Raghavan:
Efficiency-Quality Tradeoffs for Vector Score Aggregation. VLDB 2004: 624-635 - [c82]Prabhakar Raghavan:
Text Centric Structure Extraction and Exploitation (abstract only). WebDB 2004 - [c81]Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins:
Anti-aliasing on the web. WWW 2004: 30-39 - [c80]Ramanathan V. Guha, Ravi Kumar, Prabhakar Raghavan, Andrew Tomkins:
Propagation of trust and distrust. WWW 2004: 403-412 - [i2]Raghu Ramakrishnan, Rakesh Agrawal, Johann-Christoph Freytag, Toni Bollinger, Christopher W. Clifton, Saso Dzeroski, Jochen Hipp, Daniel A. Keim, Stefan Kramer, Hans-Peter Kriegel, Ulf Leser, Bing Liu, Heikki Mannila, Rosa Meo, Shinichi Morishita, Raymond T. Ng, Jian Pei, Prabhakar Raghavan, Myra Spiliopoulou, Jaideep Srivastava, Vicenç Torra:
Data Mining: The Next Generation. Perspectives Workshop: Data Mining: The Next Generation 2004 - 2003
- [j58]Prabhakar Raghavan:
Editorial: Preserving excellence through change. J. ACM 50(4): 427-428 (2003) - [j57]Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan:
Auditing Boolean attributes. J. Comput. Syst. Sci. 66(1): 244-253 (2003) - [j56]Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal:
Building low-diameter peer-to-peer networks. IEEE J. Sel. Areas Commun. 21(6): 995-1002 (2003) - [j55]Prabhakar Raghavan, Hadas Shachnai, Mira Yaniv:
Dynamic schemes for speculative execution of code. Perform. Evaluation 53(2): 125-142 (2003) - [c79]Mayank Bawa, Gurmeet Singh Manku, Prabhakar Raghavan:
SETS: search enhanced by topic segmentation. SIGIR 2003: 306-313 - [c78]Prabhakar Raghavan:
Extracting and Exploiting Structure in Text Search. SIGMOD Conference 2003: 635 - [c77]Gurmeet Singh Manku, Mayank Bawa, Prabhakar Raghavan:
Symphony: Distributed Hashing in a Small World. USENIX Symposium on Internet Technologies and Systems 2003 - [c76]Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins:
On the bursty evolution of blogspace. WWW 2003: 568-576 - 2002
- [j54]Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins:
The Web and Social Networks. Computer 35(11): 32-36 (2002) - [j53]Prabhakar Raghavan:
Social Networks: From the Web to the Enterprise. IEEE Internet Comput. 6(1): 91-94 (2002) - [j52]Yair Bartal, Marek Chrobak, John Noga, Prabhakar Raghavan:
More on random walks, electrical networks, and the harmonic k-server algorithm. Inf. Process. Lett. 84(5): 271-276 (2002) - [j51]Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, Amit Sahai:
Query Strategies for Priced Information. J. Comput. Syst. Sci. 64(4): 785-819 (2002) - [j50]Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Ravi Kannan, Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan, Uwe Schöning:
A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search. Theor. Comput. Sci. 289(1): 69-83 (2002) - [c75]Christina Yip Chung, Raymond Lieu, Jinhui Liu, Alpha K. Luk, Jianchang Mao, Prabhakar Raghavan:
Thematic mapping - from unstructured documents to taxonomies. CIKM 2002: 608-610 - [c74]Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal:
Using PageRank to Characterize Web Structure. COCOON 2002: 330-339 - [c73]Prabhakar Raghavan, Panayiotis Tsaparas:
Mining Significant Associations in Large Scale Text Corpora. ICDM 2002: 402-409 - [c72]Petros Drineas, Iordanis Kerenidis, Prabhakar Raghavan:
Competitive recommendation systems. STOC 2002: 82-90 - 2001
- [j49]Prabhakar Raghavan:
Structured and Unstructured Search in Enterprises. IEEE Data Eng. Bull. 24(4): 15-18 (2001) - [j48]Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Prabhakar Raghavan, Yoshiko Wakabayashi:
Multidimensional Cube Packing. Electron. Notes Discret. Math. 7: 110-113 (2001) - [j47]Allan Borodin, Jon M. Kleinberg, Prabhakar Raghavan, Madhu Sudan, David P. Williamson:
Adversarial queuing theory. J. ACM 48(1): 13-38 (2001) - [j46]Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins:
Recommendation Systems: A Probabilistic Analysis. J. Comput. Syst. Sci. 63(1): 42-61 (2001) - [c71]Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal:
Building Low-Diameter P2P Networks. FOCS 2001: 492-499 - [c70]Mani Abrol, Neil Latarche, Uma Mahadevan, Jianchang Mao, Rajat Mukherjee, Prabhakar Raghavan, Michel Tourn, John Wang, Grace Zhang:
Navigating large-scale semi-structured data in business portals. VLDB 2001: 663-666 - [c69]Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins:
On Semi-Automated Web Taxonomy Construction. WebDB 2001: 91-96 - [c68]Prabhakar Raghavan:
Social Networks on the Web and in the Enterprise. Web Intelligence 2001: 58-60 - 2000
- [j45]Rajeev Motwani, Prabhakar Raghavan:
Guest Editors' Foreword. Algorithmica 26(3-4): 311-312 (2000) - [j44]Andrei Z. Broder, Ravi Kumar, Farzin Maghoul, Prabhakar Raghavan, Sridhar Rajagopalan, Raymie Stata, Andrew Tomkins, Janet L. Wiener:
Graph structure in the Web. Comput. Networks 33(1-6): 309-320 (2000) - [j43]Christos H. Papadimitriou, Prabhakar Raghavan, Hisao Tamaki, Santosh S. Vempala:
Latent Semantic Indexing: A Probabilistic Analysis. J. Comput. Syst. Sci. 61(2): 217-235 (2000) - [j42]Anna R. Karlin, Steven J. Phillips, Prabhakar Raghavan:
Markov Paging. SIAM J. Comput. 30(3): 906-922 (2000) - [j41]David Gibson, Jon M. Kleinberg, Prabhakar Raghavan:
Clustering Categorical Data: An Approach Based on Dynamical Systems. VLDB J. 8(3-4): 222-236 (2000) - [c67]Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal:
Random graph models for the web graph. FOCS 2000: 57-65 - [c66]Prabhakar Raghavan:
Graph Structure of the Web: A Survey. LATIN 2000: 123-125 - [c65]Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal:
The Web as a Graph. PODS 2000: 1-10 - [c64]Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan:
Auditing Boolean Attributes. PODS 2000: 86-91 - [c63]Ronald Fagin, Anna R. Karlin, Jon M. Kleinberg, Prabhakar Raghavan, Sridhar Rajagopalan, Ronitt Rubinfeld, Madhu Sudan, Andrew Tomkins:
Random walks with "back buttons" (extended abstract). STOC 2000: 484-493 - [c62]Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, Amit Sahai:
Query strategies for priced information (extended abstract). STOC 2000: 582-591
1990 – 1999
- 1999
- [j40]Soumen Chakrabarti, Byron Dom, David Gibson, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins:
Topic Distillation and Spectral Filtering. Artif. Intell. Rev. 13(5-6): 409-435 (1999) - [j39]Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins:
Trawling the Web for Emerging Cyber-Communities. Comput. Networks 31(11-16): 1481-1493 (1999) - [j38]Sandy Irani, Prabhakar Raghavan:
Combinatorial and experimental results for randomized point matching algorithms. Comput. Geom. 12(1-2): 17-31 (1999) - [j37]Soumen Chakrabarti, Byron Dom, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins, David Gibson, Jon M. Kleinberg:
Mining the Web's Link Structure. Computer 32(8): 60-67 (1999) - [j36]Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa:
A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata. SIAM J. Comput. 28(3): 1051-1072 (1999) - [c61]Jon M. Kleinberg, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins:
The Web as a Graph: Measurements, Models, and Methods. COCOON 1999: 1-17 - [c60]Moses Charikar, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins:
On targeting Markov segments. STOC 1999: 99-108 - [c59]Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins:
Extracting Large-Scale Knowledge Bases from the Web. VLDB 1999: 639-650 - [p1]Rajeev Motwani, Prabhakar Raghavan:
Randomized Algorithms. Algorithms and Theory of Computation Handbook 1999 - 1998
- [j35]Soumen Chakrabarti, Byron Dom, Prabhakar Raghavan, Sridhar Rajagopalan, David Gibson, Jon M. Kleinberg:
Automatic Resource Compilation by Analyzing Hyperlink Structure and Associated Text. Comput. Networks 30(1-7): 65-74 (1998) - [j34]Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan:
A Microeconomic View of Data Mining. Data Min. Knowl. Discov. 2(4): 311-324 (1998) - [j33]Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, Prabhakar Raghavan:
Randomized Query Processing in Robot Path Planning. J. Comput. Syst. Sci. 57(1): 50-66 (1998) - [j32]Prabhakar Raghavan, Eli Upfal:
Stochastic Contention Resolution With Short Delays. SIAM J. Comput. 28(2): 709-719 (1998) - [j31]Avrim Blum, Prabhakar Raghavan:
On a theory of computing symposia. SIGACT News 29(3): 104-111 (1998) - [j30]Soumen Chakrabarti, Byron Dom, Rakesh Agrawal, Prabhakar Raghavan:
Scalable Feature Selection, Classification and Signature Generation for Organizing Large Text Databases into Hierarchical Topic Taxonomies. VLDB J. 7(3): 163-178 (1998) - [c58]Monika Rauch Henzinger, Prabhakar Raghavan, Sridhar Rajagopalan:
Computing on data streams. External Memory Algorithms 1998: 107-118 - [c57]Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins:
Recommendation Systems: A Probabilistic Analysis. FOCS 1998: 664-673 - [c56]David Gibson, Jon M. Kleinberg, Prabhakar Raghavan:
Inferring Web Communities from Link Topology. Hypertext 1998: 225-234 - [c55]Prabhakar Raghavan, Hadas Shachnai, Mira Yaniv:
Dynamic Schemes for Speculative Execution of Code. MASCOTS 1998: 309-314 - [c54]Christos H. Papadimitriou, Prabhakar Raghavan, Hisao Tamaki, Santosh S. Vempala:
Latent Semantic Indexing: A Probabilistic Analysis. PODS 1998: 159-168 - [c53]Rakesh Agrawal, Johannes Gehrke, Dimitrios Gunopulos, Prabhakar Raghavan:
Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications. SIGMOD Conference 1998: 94-105 - [c52]Sanjeev Arora, Prabhakar Raghavan, Satish Rao:
Approximation Schemes for Euclidean k-Medians and Related Problems. STOC 1998: 106-113 - [c51]Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan:
Segmentation Problems. STOC 1998: 473-482 - [c50]David Gibson, Jon M. Kleinberg, Prabhakar Raghavan:
Clustering Categorical Data: An Approach Based on Dynamical Systems. VLDB 1998: 311-322 - 1997
- [j29]Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo, Roman Smolensky, Prasoon Tiwari:
The Electrical Resistance of a Graph Captures its Commute and Cover Times. Comput. Complex. 6(4): 312-340 (1997) - [j28]Jérôme Barraquand, Lydia E. Kavraki, Jean-Claude Latombe, Tsai-Yen Li, Rajeev Motwani, Prabhakar Raghavan:
A Random Sampling Scheme for Path Planning. Int. J. Robotics Res. 16(6): 759-774 (1997) - [j27]Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal:
How much can hardware help routing? J. ACM 44(5): 726-741 (1997) - [j26]Avrim Blum, Prabhakar Raghavan, Baruch Schieber:
Navigating in Unfamiliar Geometric Terrain. SIAM J. Comput. 26(1): 110-137 (1997) - [j25]Leonidas J. Guibas, Rajeev Motwani, Prabhakar Raghavan:
The Robot Localization Problem. SIAM J. Comput. 26(4): 1120-1138 (1997) - [j24]Anne Condon, Faith E. 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:
Strategic directions in research in theory of computing. SIGACT News 28(3): 75-93 (1997) - [c49]Jon M. Kleinberg, Rajeev Motwani, Prabhakar Raghavan, Suresh Venkatasubramanian:
Storage Management for Evolving Databases. FOCS 1997: 353-362 - [c48]Pankaj K. Agarwal, Jean-Claude Latombe, Rajeev Motwani, Prabhakar Raghavan:
Nonholonomic path planning for pushing a disk among obstacles. ICRA 1997: 3124-3129 - [c47]Prabhakar Raghavan:
Information Retrieval Algorithms: A Survey. SODA 1997: 11-18 - [c46]Piotr Indyk, Rajeev Motwani, Prabhakar Raghavan, Santosh S. Vempala:
Locality-Preserving Hashing in Multidimensional Spaces. STOC 1997: 618-625 - [c45]Soumen Chakrabarti, Byron Dom, Rakesh Agrawal, Prabhakar Raghavan:
Using Taxonomy, Discriminants, and Signatures for Navigating in Text Databases. VLDB 1997: 446-455 - [c44]Moses Charikar, Rajeev Motwani, Prabhakar Raghavan, Craig Silverstein:
Constrained TSP and Low-Power Computing. WADS 1997: 104-115 - [r1]Rajeev Motwani, Prabhakar Raghavan:
Randomized Algorithms. The Computer Science and Engineering Handbook 1997: 141-161 - 1996
- [j23]Rajeev Motwani, Prabhakar Raghavan:
Randomized Algorithms. ACM Comput. Surv. 28(1): 33-37 (1996) - [j22]Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa:
Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata. Inf. Comput. 130(2): 101-129 (1996) - [j21]Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal:
A Theory of Wormhole Routing in Parallel Computers. IEEE Trans. Computers 45(6): 704-713 (1996) - [c43]Prabhakar Raghavan:
Computational Geometry Impact Potential: A Business and Industrial Perspective. CCCG 1996: 276 - [c42]Sandy Irani, Prabhakar Raghavan:
Combinatorial and Experimental Results for Randomized Point Matching Algorithms. SCG 1996: 68-77 - [c41]Andreas Arning, Rakesh Agrawal, Prabhakar Raghavan:
A Linear Method for Deviation Detection in Large Databases. KDD 1996: 164-169 - [c40]Allan Borodin, Jon M. Kleinberg, Prabhakar Raghavan, Madhu Sudan, David P. Williamson:
Adversarial Queueing Theory. STOC 1996: 376-385 - 1995
- [b1]Rajeev Motwani, Prabhakar Raghavan:
Randomized Algorithms. Cambridge University Press 1995, ISBN 0-521-47465-5 - [j20]Andrei Z. Broder, Martin E. Dyer, Alan M. Frieze, Prabhakar Raghavan, Eli Upfal:
The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height. Inf. Process. Lett. 56(2): 79-81 (1995) - [j19]Allan Borodin, Sandy Irani, Prabhakar Raghavan, Baruch Schieber:
Competitive Paging with Locality of Reference. J. Comput. Syst. Sci. 50(2): 244-258 (1995) - [j18]Prabhakar Raghavan:
Robust Algorithms for Packet Routing in a Mesh. Math. Syst. Theory 28(1): 1-11 (1995) - [j17]Rajeev Motwani, Prabhakar Raghavan:
Randomized Algorithms. SIGACT News 26(3): 48-50 (1995) - [c39]Prabhakar Raghavan, Eli Upfal:
Stochastic contention resolution with short delays. STOC 1995: 229-237 - [c38]Pankaj K. Agarwal, Prabhakar Raghavan, Hisao Tamaki:
Motion planning for a steering-constrained robot through moderate obstacles. STOC 1995: 343-352 - [c37]Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, Prabhakar Raghavan:
Randomized query processing in robot path planning (Extended Abstract). STOC 1995: 353-362 - 1994
- [j16]Prabhakar Raghavan:
Guest Editor's Foreword: Special Issue on On-Line Algorithms. Algorithmica 11(1): 1 (1994) - [j15]Prabhakar Raghavan, Marc Snir:
Memory versus randomization in on-line algorithms. IBM J. Res. Dev. 38(6): 683-708 (1994) - [j14]Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal:
Trading Space for Time in Undirected s-t Connectivity. SIAM J. Comput. 23(2): 324-334 (1994) - [j13]Uriel Feige, Prabhakar Raghavan, David Peleg, Eli Upfal:
Computing with Noisy Information. SIAM J. Comput. 23(5): 1001-1018 (1994) - [c36]Christos H. Papadimitriou, Prabhakar Raghavan, Madhu Sudan, Hisao Tamaki:
Motion Planning on a Graph (Extended Abstract). FOCS 1994: 511-520 - [c35]Prabhakar Raghavan:
Randomized Approximation Algorithms in Combinatorial Optimization. FSTTCS 1994: 300-317 - [c34]Kazuo Iwano, Prabhakar Raghavan, Hisao Tamaki:
The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection. ISAAC 1994: 29-37 - [c33]Prabhakar Raghavan, Eli Upfal:
Efficient routing in all-optical networks. STOC 1994: 134-143 - [c32]Avrim Blum, Prasad Chalasani, Don Coppersmith, William R. Pulleyblank, Prabhakar Raghavan, Madhu Sudan:
The minimum latency problem. STOC 1994: 163-171 - [i1]Avrim Blum, Prasad Chalasani, Don Coppersmith, William R. Pulleyblank, Prabhakar Raghavan, Madhu Sudan:
On the minimum latency problem. CoRR abs/math/9409223 (1994) - 1993
- [j12]Don Coppersmith, Peter Doyle, Prabhakar Raghavan, Marc Snir:
Random Walks on Weighted Graphs and Applications to On-line Algorithms. J. ACM 40(3): 421-453 (1993) - [j11]Howard J. Karloff, Prabhakar Raghavan:
Randomized Algorithms and Pseudorandom Numbers. J. ACM 40(3): 454-476 (1993) - [c31]Amotz Bar-Noy, Prabhakar Raghavan, Baruch Schieber, Hisao Tamaki:
Fast Deflection Routing for Packets and Worms (Extended Summary). PODC 1993: 75-86 - [c30]Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal:
How much can hardware help routing? STOC 1993: 573-582 - [e1]Kam-Wing Ng, Prabhakar Raghavan, N. V. Balasubramanian, Francis Y. L. Chin:
Algorithms and Computation, 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993, Proceedings. Lecture Notes in Computer Science 762, Springer 1993, ISBN 3-540-57568-5 [contents] - 1992
- [j10]Prabhakar Raghavan:
Integer Programming in VLSI Design. Discret. Appl. Math. 40(1): 29-43 (1992) - [j9]Alok Aggarwal, Herbert Edelsbrunner, Prabhakar Raghavan, Prasoon Tiwari:
Optimal Time Bounds for Some Proximity Problems in the Plane. Inf. Process. Lett. 42(1): 55-60 (1992) - [j8]Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber:
Fast Geometric Approximation Techniques and Geometric Embedding Problems. Theor. Comput. Sci. 106(2): 265-281 (1992) - [c29]Anna R. Karlin, Steven J. Phillips, Prabhakar Raghavan:
Markov Paging (Extended Abstract). FOCS 1992: 208-217 - [c28]Uriel Feige, Prabhakar Raghavan:
Exact Analysis of Hot-Potato Routing (Extended Abstract). FOCS 1992: 553-562 - [c27]Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal:
A Theory of Wormhole Routing in Parallel Computers (Extended Abstract). FOCS 1992: 563-572 - [c26]Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal:
An Experimental Study of Wormhole Routing in Parallel Computers. Heinz Nixdorf Symposium 1992: 156-165 - [c25]Leonidas J. Guibas, Rajeev Motwani, Prabhakar Raghavan:
The Robot Localization Problem in Two Dimensions. SODA 1992: 259-268 - 1991
- [j7]Prabhakar Raghavan, Clark D. Thompson:
Multiterminal Global Routing: A Deterministic Approximation Scheme. Algorithmica 6(1): 73-82 (1991) - [j6]Alok Aggarwal, Prabhakar Raghavan:
Deferred Data Structure for the Nearest Neighbor Problem. Inf. Process. Lett. 40(3): 119-122 (1991) - [c24]Prabhakar Raghavan:
A Statistical Adversary for On-line Algorithms. On-Line Algorithms 1991: 79-84 - [c23]Avrim Blum, Prabhakar Raghavan, Baruch Schieber:
Navigating in Unfamiliar Geometric Terrain (Extended Summary). On-Line Algorithms 1991: 151-156 - [c22]Allan Borodin, Sandy Irani, Prabhakar Raghavan, Baruch Schieber:
Competitive Paging with Locality of Reference (Brief Summary). On-Line Algorithms 1991: 167-168 - [c21]Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal:
On the Parallel Complexity of Evaluating Game Trees. SODA 1991: 404-413 - [c20]Allan Borodin, Sandy Irani, Prabhakar Raghavan, Baruch Schieber:
Competitive Paging with Locality of Reference (Preliminary Version). STOC 1991: 249-259 - [c19]Avrim Blum, Prabhakar Raghavan, Baruch Schieber:
Navigating in Unfamiliar Geometric Terrain (Preliminary Version). STOC 1991: 494-504 - 1990
- [j5]Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal:
Randomized Broadcast in Networks. Random Struct. Algorithms 1(4): 447-460 (1990) - [c18]Christos Kaklamanis, Anna R. Karlin, Frank Thomson Leighton, Victor Milenkovic, Prabhakar Raghavan, Satish Rao, Clark D. Thomborson, A. Tsantilas:
Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract). FOCS 1990: 285-296 - [c17]Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa:
Time-Space Tradeoffs for Undirected Graph Traversal. FOCS 1990: 429-438 - [c16]Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal:
Randomized Broadcast in Networks. SIGAL International Symposium on Algorithms 1990: 128-137 - [c15]Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal:
Computing with Unreliable Information (Preliminary Version). STOC 1990: 128-137 - [c14]Don Coppersmith, Peter Doyle, Prabhakar Raghavan, Marc Snir:
Random Walks on Weighted Graphs, and Applications to On-line Algorithms (Preliminary Version). STOC 1990: 369-378
1980 – 1989
- 1989
- [j4]Don Coppersmith, Prabhakar Raghavan, Martin Tompa:
Parallel Graph Algorithms That Are Efficient on Average. Inf. Comput. 81(3): 318-333 (1989) - [c13]Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber:
Fast Geometric Approximation Techniques and Geometric Embedding Problems. SCG 1989: 292-301 - [c12]Prabhakar Raghavan, Marc Snir:
Memory Versus Randomization in On-line Algorithms (Extended Abstract). ICALP 1989: 687-703 - [c11]Manuel Blum, Prabhakar Raghavan:
Program Correctness: Can One Test For It? IFIP Congress 1989: 127-134 - [c10]Prabhakar Raghavan:
Robust Algorithms for Packet Routing in a Mesh. SPAA 1989: 344-350 - [c9]Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal:
Trading Space for Time in Undirected s-t Connectivity. STOC 1989: 543-549 - [c8]Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo, Roman Smolensky, Prasoon Tiwari:
The Electrical Resistance of a Graph Captures its Commute and Cover Times (Detailed Abstract). STOC 1989: 574-586 - 1988
- [j3]Prabhakar Raghavan:
Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs. J. Comput. Syst. Sci. 37(2): 130-143 (1988) - [j2]Richard M. Karp, Rajeev Motwani, Prabhakar Raghavan:
Deferred Data Structuring. SIAM J. Comput. 17(5): 883-902 (1988) - [c7]Alok Aggarwal, Ashok K. Chandra, Prabhakar Raghavan:
Energy Consumption in VLSI Circuits (Preliminary Version). STOC 1988: 205-216 - [c6]Howard J. Karloff, Prabhakar Raghavan:
Randomized Algorithms and Pseudorandom Numbers. STOC 1988: 310-321 - 1987
- [j1]Prabhakar Raghavan, Clark D. Thompson:
Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Comb. 7(4): 365-374 (1987) - [c5]Don Coppersmith, Prabhakar Raghavan, Martin Tompa:
Parallel Graph Algorithms that Are Efficient on Average. FOCS 1987: 260-269 - 1986
- [c4]Rajeev Motwani, Prabhakar Raghavan:
Deferred Data Structuring: Query-Driven Preprocessing for Geometric Search Problems. SCG 1986: 303-312 - [c3]Antony P.-C. Ng, Clark D. Thompson, Prabhakar Raghavan:
A language for describing rectilinear Steiner tree configurations. DAC 1986: 659-662 - [c2]Prabhakar Raghavan:
Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs. FOCS 1986: 10-18 - 1985
- [c1]Prabhakar Raghavan, Clark D. Thompson:
Provably Good Routing in Graphs: Regular Arrays. STOC 1985: 79-87
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 2025-01-09 13:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint