| 2012 |
| 174 | Rajeev Motwani (1962-2009). Prabhakar Raghavan. Theory of Computing (8): 55-68 (2012). Web SearchBibTeXDownload |
| 173 | Are web users really Markovian?. Flavio Chierichetti, Ravi Kumar, Prabhakar Raghavan, Tamás Sarlós. WWW 2012, 609-618. Web SearchBibTeXDownload |
| 2011 |
| 172 | Markov Layout. Flavio Chierichetti, Ravi Kumar, Prabhakar Raghavan. FOCS 2011, 492-501. Web SearchBibTeXDownload |
| 171 | An algorithmic treatment of strong queries. Ravi Kumar, Silvio Lattanzi, Prabhakar Raghavan. WSDM 2011, 775-784. Web SearchBibTeXDownload |
| 170 | Optimizing two-dimensional search results presentation. Flavio Chierichetti, Ravi Kumar, Prabhakar Raghavan. WSDM 2011, 257-266. Web SearchBibTeXDownload |
| 2010 |
| 169 | The FUNnest Talks That belong to FUN (Abstract). Prabhakar Raghavan. FUN 2010, 3. Web SearchBibTeXDownload |
| 168 | Heavy Tails and Models for the Web and Social Networks. Prabhakar Raghavan. ICDCN 2010, 2. Web SearchBibTeXDownload |
| 167 | The Quantitative Analysis of User Behavior Online - Data, Models and Algorithms. Prabhakar Raghavan. SWAT 2010, 163. Web SearchBibTeXDownload |
| 166 | Search is dead!: long live search. Andrei Z. Broder, Elizabeth F. Churchill, Marti Hearst, Barney Pell, Prabhakar Raghavan, Andrew Tomkins. WWW 2010, 1337-1338. Web SearchBibTeXDownload |
| 2009 |
| 165 | Some results of Christos Papadimitriou on internet structure, network routing, and web information. Jon M. Kleinberg, Prabhakar Raghavan. Computer Science Review (3): 119-125 (2009). Web SearchBibTeXDownload |
| 164 | Models for the Compressible Web. Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Alessandro Panconesi, Prabhakar Raghavan. FOCS 2009, 331-340. Web SearchBibTeXDownload |
| 163 | On compressing social networks. Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Michael Mitzenmacher, Alessandro Panconesi, Prabhakar Raghavan. KDD 2009, 219-228. Cited by 5Web SearchBibTeXDownload |
| 162 | Next Generation Web Search. Ricardo A. Baeza-Yates, Prabhakar Raghavan. SeCO Workshop 2009, 11-23. Web SearchBibTeXDownload |
| 161 | Online story scheduling in web advertising. Anirban Dasgupta, Arpita Ghosh, Hamid Nazerzadeh, Prabhakar Raghavan. SODA 2009, 1275-1284. Cited by 1Web SearchBibTeXDownload |
| 160 | Compressed web indexes. Flavio Chierichetti, Ravi Kumar, Prabhakar Raghavan. WWW 2009, 451-460. Web SearchBibTeXDownload |
| 2008 |
| 159 | The Changing Face of Web Search. Prabhakar Raghavan. CPM 2008, 4. Cited by 1Web SearchBibTeXDownload |
| 158 | Heavy Tails and Web Models. Prabhakar Raghavan. SUM 2008, 4. Web SearchBibTeXDownload |
| 2007 |
| 157 | Web search: from information retrieval to microeconomic modeling. Prabhakar Raghavan. CIKM 2007, 1-2. Web SearchBibTeXDownload |
| 156 | Web Search: Bridging Information Retrieval and Microeconomic Modeling. Prabhakar Raghavan. HiPC 2007, 6. Web SearchBibTeXDownload |
| 155 | Finding near neighbors through cluster pruning. Flavio Chierichetti, Alessandro Panconesi, Prabhakar Raghavan, Mauro Sozio, Alessandro Tiberi, Eli Upfal. PODS 2007, 103-112. Cited by 8Web SearchBibTeXDownload |
| 154 | Visualizing tags over time. Micah Dubinko, Ravi Kumar, Joseph Magnani, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins. TWEB (1) (2007). Cited by 145Web SearchBibTeXDownload |
| 2006 |
| 153 | Core algorithms in the CLEVER system. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins. ACM Trans. Internet Techn. (6): 131-152 (2006). Cited by 6Web SearchBibTeXDownload |
| 152 | Using PageRank to Characterize Web Structure. Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal. Internet Mathematics (3): 1-20 (2006). Cited by 150Web SearchBibTeXDownload |
| 151 | The Changing Face of Web Search. Prabhakar Raghavan. MDM 2006, 2. Cited by 1Web SearchBibTeXDownload |
| 150 | The changing face of web search: algorithms, auctions and advertising. Prabhakar Raghavan. STOC 2006, 129. Cited by 3Web SearchBibTeXDownload |
| 149 | Guest Editors' Introduction. Carolyn McGregor, Anthony Maedel, Laurence Tianruo Yang, Sanjay Goel, Alexander Zelikovsky. World Wide Web (9): 367-368 (2006). Cited by 2Web SearchBibTeXDownload |
| 148 | Visualizing tags over time. Micah Dubinko, Ravi Kumar, Joseph Magnani, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins. WWW 2006, 193-202. Cited by 145Web SearchBibTeXDownload |
| 2005 |
| 147 | Query Incentive Networks. Prabhakar Raghavan. ASIAN 2005, 19-21. Cited by 34Web SearchBibTeXDownload |
| 146 | Automatic Subspace Clustering of High Dimensional Data. Rakesh Agrawal, Johannes Gehrke, Dimitrios Gunopulos, Prabhakar Raghavan. Data Min. Knowl. Discov. (11): 5-33 (2005). Cited by 40Web SearchBibTeXDownload |
| 145 | Encoding XML in Vector Spaces. Vinay Kakade, Prabhakar Raghavan. ECIR 2005, 96-111. Cited by 18Web SearchBibTeXDownload |
| 144 | Incentive networks. Prabhakar Raghavan. KDD 2005, 1. Web SearchBibTeXDownload |
| 143 | Variable latent semantic indexing. Anirban Dasgupta, Ravi Kumar, Prabhakar Raghavan, Andrew Tomkins. KDD 2005, 13-21. Cited by 10Web SearchBibTeXDownload |
| 142 | Incentive Networks. Prabhakar Raghavan. LA-WEB 2005. Cited by 1Web SearchBibTeXDownload |
| 141 | On the Bursty Evolution of Blogspace. Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins. World Wide Web (8): 159-178 (2005). Cited by 328Web SearchBibTeXDownload |
| 140 | Current trends in the integration of searching and browsing. Andrei Z. Broder, Yoëlle S. Maarek, Krishna Bharat, Susan T. Dumais, Steve Papa, Jan O. Pedersen, Prabhakar Raghavan. WWW (Special interest tracks and posters) 2005, 793. Web SearchBibTeXDownload |
| 2004 |
| 139 | Multidimensional Cube Packing. Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Prabhakar Raghavan, Yoshiko Wakabayashi. Algorithmica (40): 173-187 (2004). Cited by 18Web SearchBibTeXDownload |
| 138 | Social Networks and the Web. Prabhakar Raghavan. AWIC 2004, 1. Cited by 1Web SearchBibTeXDownload |
| 137 | Structure and evolution of blogspace. Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins. Commun. ACM (47): 35-39 (2004). Web SearchBibTeXDownload |
| 136 | Segmentation problems. Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan. J. ACM (51): 263-280 (2004). Web SearchBibTeXDownload |
| 135 | Efficiency-Quality Tradeoffs for Vector Score Aggregation. Pavan Kumar C. Singitham, Mahathi S. Mahabhashyam, Prabhakar Raghavan. VLDB 2004, 624-635. Cited by 9Web SearchBibTeXDownload |
| 134 | Propagation of trust and distrust. Ramanathan V. Guha, Ravi Kumar, Prabhakar Raghavan, Andrew Tomkins. WWW 2004, 403-412. Cited by 423Web SearchBibTeXDownload |
| 133 | Anti-aliasing on the web. Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins. WWW 2004, 30-39. Cited by 41Web SearchBibTeXDownload |
| 2003 |
| 132 | Building low-diameter peer-to-peer networks. Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal. IEEE Journal on Selected Areas in Communications (21): 995-1002 (2003). Web SearchBibTeXDownload |
| 131 | Editorial: Preserving excellence through change. Prabhakar Raghavan. J. ACM (50): 427-428 (2003). Cited by 1Web SearchBibTeXDownload |
| 130 | Auditing Boolean attributes. Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan. J. Comput. Syst. Sci. (66): 244-253 (2003). Cited by 91Web SearchBibTeXDownload |
| 129 | Dynamic schemes for speculative execution of code. Prabhakar Raghavan, Hadas Shachnai, Mira Yaniv. Perform. Eval. (53): 125-142 (2003). Cited by 2Web SearchBibTeXDownload |
| 128 | SETS: search enhanced by topic segmentation. Mayank Bawa, Gurmeet Singh Manku, Prabhakar Raghavan. SIGIR 2003, 306-313. Cited by 144Web SearchBibTeXDownload |
| 127 | Extracting and Exploiting Structure in Text Search. Prabhakar Raghavan. SIGMOD Conference 2003, 635. Web SearchBibTeXDownload |
| 126 | Symphony: Distributed Hashing in a Small World. Gurmeet Singh Manku, Mayank Bawa, Prabhakar Raghavan. USENIX Symposium on Internet Technologies and Systems 2003. Cited by 326Web SearchBibTeXDownload |
| 125 | On the bursty evolution of blogspace. Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins. WWW 2003, 568-576. Web SearchBibTeXDownload |
| 2002 |
| 124 | Thematic mapping - from unstructured documents to taxonomies. Christina Yip Chung, Raymond Lieu, Jinhui Liu, Alpha K. Luk, Jianchang Mao, Prabhakar Raghavan. CIKM 2002, 608-610. Web SearchBibTeXDownload |
| 123 | Using PageRank to Characterize Web Structure. Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal. COCOON 2002, 330-339. Cited by 150Web SearchBibTeXDownload |
| 122 | Mining Significant Associations in Large Scale Text Corpora. Prabhakar Raghavan, Panayiotis Tsaparas. ICDM 2002, 402-409. Web SearchBibTeXDownload |
| 121 | The Web and Social Networks. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins. IEEE Computer (35): 32-36 (2002). Cited by 59Web SearchBibTeXDownload |
| 120 | Social Networks: From the Web to the Enterprise. Prabhakar Raghavan. IEEE Internet Computing (6): 91-94 (2002). Cited by 49Web SearchBibTeXDownload |
| 119 | More on random walks, electrical networks, and the harmonic k-server algorithm. Yair Bartal, Marek Chrobak, John Noga, Prabhakar Raghavan. Inf. Process. Lett. (84): 271-276 (2002). Cited by 10Web SearchBibTeXDownload |
| 118 | Query Strategies for Priced Information. Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, Amit Sahai. J. Comput. Syst. Sci. (64): 785-819 (2002). Cited by 46Web SearchBibTeXDownload |
| 117 | Competitive recommendation systems. Petros Drineas, Iordanis Kerenidis, Prabhakar Raghavan. STOC 2002, 82-90. Cited by 65Web SearchBibTeXDownload |
| 116 | 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. (289): 69-83 (2002). Cited by 143Web SearchBibTeXDownload |
| 2001 |
| 115 | Multidimensional Cube Packing. Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Prabhakar Raghavan, Yoshiko Wakabayashi. Electronic Notes in Discrete Mathematics (7): 110-113 (2001). Cited by 18Web SearchBibTeXDownload |
| 114 | Building Low-Diameter P2P Networks. Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal. FOCS 2001, 492-499. Cited by 186Web SearchBibTeXDownload |
| 113 | Structured and Unstructured Search in Enterprises. Prabhakar Raghavan. IEEE Data Eng. Bull. (24): 15-18 (2001). Cited by 16Web SearchBibTeXDownload |
| 112 | Adversarial queuing theory. Allan Borodin, Jon M. Kleinberg, Prabhakar Raghavan, Madhu Sudan, David P. Williamson. J. ACM (48): 13-38 (2001). Cited by 270Web SearchBibTeXDownload |
| 111 | Recommendation Systems: A Probabilistic Analysis. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins. J. Comput. Syst. Sci. (63): 42-61 (2001). Cited by 81Web SearchBibTeXDownload |
| 110 | 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, 663-666. Cited by 12Web SearchBibTeXDownload |
| 109 | On Semi-Automated Web Taxonomy Construction. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins. WebDB 2001, 91-96. Cited by 16Web SearchBibTeX |
| 108 | Social Networks on the Web and in the Enterprise. Prabhakar Raghavan. Web Intelligence 2001, 58-60. Web SearchBibTeXDownload |
| 2000 |
| 107 | Guest Editors' Foreword. Peter Gritzmann, Peter Bro Miltersen, Dorothea Wagner, Attila Sali, Ivan Porres. Algorithmica (26): 311-312 (2000). Web SearchBibTeXDownload |
| 106 | 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 (33): 309-320 (2000). Cited by 1576Web SearchBibTeXDownload |
| 105 | Random graph models for the web graph. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal. FOCS 2000, 57-65. Cited by 383Web SearchBibTeXDownload |
| 104 | Latent Semantic Indexing: A Probabilistic Analysis. Christos H. Papadimitriou, Prabhakar Raghavan, Hisao Tamaki, Santosh Vempala. J. Comput. Syst. Sci. (61): 217-235 (2000). Cited by 463Web SearchBibTeXDownload |
| 103 | Graph Structure of the Web: A Survey. Prabhakar Raghavan. LATIN 2000, 123-125. Web SearchBibTeXDownload |
| 102 | The Web as a Graph. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal. PODS 2000, 1-10. Cited by 200Web SearchBibTeXDownload |
| 101 | Auditing Boolean Attributes. Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan. PODS 2000, 86-91. Web SearchBibTeXDownload |
| 100 | Markov Paging. Anna R. Karlin, Steven J. Phillips, Prabhakar Raghavan. SIAM J. Comput. (30): 906-922 (2000). Cited by 109Web SearchBibTeXDownload |
| 99 | 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, 484-493. Cited by 39Web SearchBibTeXDownload |
| 98 | Query strategies for priced information (extended abstract). Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, Amit Sahai. STOC 2000, 582-591. Web SearchBibTeXDownload |
| 97 | Clustering Categorical Data: An Approach Based on Dynamical Systems. David Gibson, Jon M. Kleinberg, Prabhakar Raghavan. VLDB J. (8): 222-236 (2000). Cited by 280Web SearchBibTeXDownload |
| 1999 |
| 96 | Topic Distillation and Spectral Filtering. Soumen Chakrabarti, Byron Dom, David Gibson, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins. Artif. Intell. Rev. (13): 409-435 (1999). Cited by 14Web SearchBibTeXDownload |
| 95 | The Web as a Graph: Measurements, Models, and Methods. Jon M. Kleinberg, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins. COCOON 1999, 1-17. Cited by 539Web SearchBibTeXDownload |
| 94 | Trawling the Web for Emerging Cyber-Communities. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins. Computer Networks (31): 1481-1493 (1999). Cited by 776Web SearchBibTeXDownload |
| 93 | Combinatorial and experimental results for randomized point matching algorithms. Sandy Irani, Prabhakar Raghavan. Comput. Geom. (12): 17-31 (1999). Web SearchBibTeXDownload |
| 92 | 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 (32): 60-67 (1999). Cited by 390Web SearchBibTeXDownload |
| 91 | 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. (28): 1051-1072 (1999). Cited by 7Web SearchBibTeXDownload |
| 90 | On targeting Markov segments. Moses Charikar, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins. STOC 1999, 99-108. Cited by 14Web SearchBibTeXDownload |
| 89 | Extracting Large-Scale Knowledge Bases from the Web. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins. VLDB 1999, 639-650. Cited by 241Web SearchBibTeXDownload |
| 1998 |
| 88 | 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 (30): 65-74 (1998). Cited by 720Web SearchBibTeXDownload |
| 87 | A Microeconomic View of Data Mining. Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan. Data Min. Knowl. Discov. (2): 311-324 (1998). Cited by 119Web SearchBibTeXDownload |
| 86 | Recommendation Systems: A Probabilistic Analysis. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins. FOCS 1998, 664-673. Cited by 81Web SearchBibTeXDownload |
| 85 | Inferring Web Communities from Link Topology. David Gibson, Jon M. Kleinberg, Prabhakar Raghavan. Hypertext 1998, 225-234. Cited by 694Web SearchBibTeXDownload |
| 84 | Randomized Query Processing in Robot Path Planning. Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, Prabhakar Raghavan. J. Comput. Syst. Sci. (57): 50-66 (1998). Cited by 92Web SearchBibTeXDownload |
| 83 | Dynamic Schemes for Speculative Execution of Code. Prabhakar Raghavan, Hadas Shachnai, Mira Yaniv. MASCOTS 1998, 309. Web SearchBibTeXDownload |
| 82 | Latent Semantic Indexing: A Probabilistic Analysis. Christos H. Papadimitriou, Prabhakar Raghavan, Hisao Tamaki, Santosh Vempala. PODS 1998, 159-168. Cited by 463Web SearchBibTeXDownload |
| 81 | Stochastic Contention Resolution With Short Delays. Prabhakar Raghavan, Eli Upfal. SIAM J. Comput. (28): 709-719 (1998). Web SearchBibTeXDownload |
| 80 | On a theory of computing symposia. Avrim Blum, Prabhakar Raghavan. SIGACT News (29): 104-111 (1998). Web SearchBibTeXDownload |
| 79 | Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications. Rakesh Agrawal, Johannes Gehrke, Dimitrios Gunopulos, Prabhakar Raghavan. SIGMOD Conference 1998, 94-105. Cited by 1375Web SearchBibTeXDownload |
| 78 | Approximation Schemes for Euclidean k-Medians and Related Problems. Sanjeev Arora, Prabhakar Raghavan, Satish Rao. STOC 1998, 106-113. Cited by 211Web SearchBibTeXDownload |
| 77 | Segmentation Problems. Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan. STOC 1998, 473-482. Cited by 103Web SearchBibTeXDownload |
| 76 | Clustering Categorical Data: An Approach Based on Dynamical Systems. David Gibson, Jon M. Kleinberg, Prabhakar Raghavan. VLDB 1998, 311-322. Cited by 280Web SearchBibTeXDownload |
| 75 | 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. (7): 163-178 (1998). Web SearchBibTeXDownload |
| 1997 |
| 74 | 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 (6): 312-340 (1997). Cited by 217Web SearchBibTeXDownload |
| 73 | Storage Management for Evolving Databases. Jon M. Kleinberg, Rajeev Motwani, Prabhakar Raghavan, Suresh Venkatasubramanian. FOCS 1997, 353-362. Cited by 6Web SearchBibTeXDownload |
| 72 | Nonholonomic path planning for pushing a disk among obstacles. Pankaj K. Agarwal, Jean-Claude Latombe, Rajeev Motwani, Prabhakar Raghavan. ICRA 1997, 3124-3129. Web SearchBibTeXDownload |
| 71 | 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. (16): 759-774 (1997). Cited by 190Web SearchBibTeXDownload |
| 70 | How much can hardware help routing?. Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal. J. ACM (44): 726-741 (1997). Cited by 35Web SearchBibTeXDownload |
| 69 | The Robot Localization Problem. Leonidas J. Guibas, Rajeev Motwani, Prabhakar Raghavan. SIAM J. Comput. (26): 1120-1138 (1997). Cited by 88Web SearchBibTeXDownload |
| 68 | Navigating in Unfamiliar Geometric Terrain. Avrim Blum, Prabhakar Raghavan, Baruch Schieber. SIAM J. Comput. (26): 110-137 (1997). Cited by 182Web SearchBibTeXDownload |
| 67 | 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 (28): 75-93 (1997). Web SearchBibTeXDownload |
| 66 | Information Retrieval Algorithms: A Survey. Prabhakar Raghavan. SODA 1997, 11-18. Cited by 54Web SearchBibTeXDownload |
| 65 | Locality-Preserving Hashing in Multidimensional Spaces. Piotr Indyk, Rajeev Motwani, Prabhakar Raghavan, Santosh Vempala. STOC 1997, 618-625. Cited by 98Web SearchBibTeXDownload |
| 64 | Randomized Algorithms. Rajeev Motwani, Prabhakar Raghavan. The Computer Science and Engineering Handbook 1997, 141-161. Cited by 3408Web SearchBibTeX |
| 63 | Using Taxonomy, Discriminants, and Signatures for Navigating in Text Databases. Soumen Chakrabarti, Byron Dom, Rakesh Agrawal, Prabhakar Raghavan. VLDB 1997, 446-455. Cited by 112Web SearchBibTeXDownload |
| 62 | Constrained TSP and Low-Power Computing. Moses Charikar, Rajeev Motwani, Prabhakar Raghavan, Craig Silverstein. WADS 1997, 104-115. Cited by 8Web SearchBibTeXDownload |
| 1996 |
| 61 | Randomized Algorithms. Rajeev Motwani, Prabhakar Raghavan. ACM Comput. Surv. (28): 33-37 (1996). Cited by 3408Web SearchBibTeXDownload |
| 60 | Computational Geometry Impact Potential: A Business and Industrial Perspective. Prabhakar Raghavan. CCCG 1996, 276. Web SearchBibTeX |
| 59 | A Theory of Wormhole Routing in Parallel Computers. Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal. IEEE Trans. Computers (45): 704-713 (1996). Cited by 76Web SearchBibTeXDownload |
| 58 | Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata. Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa. Inf. Comput. (130): 101-129 (1996). Cited by 7Web SearchBibTeXDownload |
| 57 | A Linear Method for Deviation Detection in Large Databases. Andreas Arning, Rakesh Agrawal, Prabhakar Raghavan. KDD 1996, 164-169. Cited by 216Web SearchBibTeXDownload |
| 56 | Adversarial Queueing Theory. Allan Borodin, Jon M. Kleinberg, Prabhakar Raghavan, Madhu Sudan, David P. Williamson. STOC 1996, 376-385. Web SearchBibTeXDownload |
| 55 | Combinatorial and Experimental Results for Randomized Point Matching Algorithms. Sandy Irani, Prabhakar Raghavan. Symposium on Computational Geometry 1996, 68-77. Cited by 36Web SearchBibTeXDownload |
| 1995 |
| 54 | 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. (56): 79-81 (1995). Cited by 13Web SearchBibTeXDownload |
| 53 | Competitive Paging with Locality of Reference. Allan Borodin, Sandy Irani, Prabhakar Raghavan, Baruch Schieber. J. Comput. Syst. Sci. (50): 244-258 (1995). Cited by 196Web SearchBibTeXDownload |
| 52 | Robust Algorithms for Packet Routing in a Mesh. Prabhakar Raghavan. Mathematical Systems Theory (28): 1-11 (1995). Cited by 33Web SearchBibTeXDownload |
| 51 | Randomized query processing in robot path planning (Extended Abstract). Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, Prabhakar Raghavan. STOC 1995, 353-362. Web SearchBibTeXDownload |
| 50 | Stochastic contention resolution with short delays. Prabhakar Raghavan, Eli Upfal. STOC 1995, 229-237. Cited by 45Web SearchBibTeXDownload |
| 49 | Motion planning for a steering-constrained robot through moderate obstacles. Pankaj K. Agarwal, Prabhakar Raghavan, Hisao Tamaki. STOC 1995, 343-352. Cited by 57Web SearchBibTeXDownload |
| 1994 |
| 48 | Guest Editor's Foreword: Special Issue on On-Line Algorithms. Prabhakar Raghavan. Algorithmica (11): 1 (1994). Web SearchBibTeXDownload |
| 47 | Motion Planning on a Graph (Extended Abstract). Christos H. Papadimitriou, Prabhakar Raghavan, Madhu Sudan, Hisao Tamaki. FOCS 1994, 511-520. Web SearchBibTeXDownload |
| 46 | Randomized Approximation Algorithms in Combinatorial Optimization. Prabhakar Raghavan. FSTTCS 1994, 300-317. Cited by 36Web SearchBibTeXDownload |
| 45 | Memory versus randomization in on-line algorithms. Prabhakar Raghavan, Marc Snir. IBM Journal of Research and Development (38): 683-708 (1994). Cited by 165Web SearchBibTeXDownload |
| 44 | The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection. Kazuo Iwano, Prabhakar Raghavan, Hisao Tamaki. ISAAC 1994, 29-37. Cited by 17Web SearchBibTeXDownload |
| 43 | Trading Space for Time in Undirected s-t Connectivity. Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal. SIAM J. Comput. (23): 324-334 (1994). Cited by 48Web SearchBibTeXDownload |
| 42 | Computing with Noisy Information. Uriel Feige, Prabhakar Raghavan, David Peleg, Eli Upfal. SIAM J. Comput. (23): 1001-1018 (1994). Cited by 56Web SearchBibTeXDownload |
| 41 | The minimum latency problem. Avrim Blum, Prasad Chalasani, Don Coppersmith, William R. Pulleyblank, Prabhakar Raghavan, Madhu Sudan. STOC 1994, 163-171. Cited by 141Web SearchBibTeXDownload |
| 40 | Efficient routing in all-optical networks. Prabhakar Raghavan, Eli Upfal. STOC 1994, 134-143. Cited by 272Web SearchBibTeXDownload |
| 1993 |
| 39 | Randomized Algorithms and Pseudorandom Numbers. Howard J. Karloff, Prabhakar Raghavan. J. ACM (40): 454-476 (1993). Cited by 46Web SearchBibTeXDownload |
| 38 | Random Walks on Weighted Graphs and Applications to On-line Algorithms. Don Coppersmith, Peter Doyle, Prabhakar Raghavan, Marc Snir. J. ACM (40): 421-453 (1993). Cited by 121Web SearchBibTeXDownload |
| 37 | Fast Deflection Routing for Packets and Worms (Extended Summary). Amotz Bar-Noy, Prabhakar Raghavan, Baruch Schieber, Hisao Tamaki. PODC 1993, 75-86. Cited by 64Web SearchBibTeXDownload |
| 36 | How much can hardware help routing?. Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal. STOC 1993, 573-582. Cited by 35Web SearchBibTeXDownload |
| 1992 |
| 35 | Integer Programming in VLSI Design. Prabhakar Raghavan. Discrete Applied Mathematics (40): 29-43 (1992). Cited by 5Web SearchBibTeX |
| 34 | A Theory of Wormhole Routing in Parallel Computers (Extended Abstract). Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal. FOCS 1992, 563-572. Web SearchBibTeXDownload |
| 33 | Exact Analysis of Hot-Potato Routing (Extended Abstract). Uriel Feige, Prabhakar Raghavan. FOCS 1992, 553-562. Cited by 100Web SearchBibTeXDownload |
| 32 | Markov Paging (Extended Abstract). Anna R. Karlin, Steven J. Phillips, Prabhakar Raghavan. FOCS 1992, 208-217. Web SearchBibTeXDownload |
| 31 | An Experimental Study of Wormhole Routing in Parallel Computers. Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal. Heinz Nixdorf Symposium 1992, 156-165. Cited by 2Web SearchBibTeXDownload |
| 30 | Optimal Time Bounds for Some Proximity Problems in the Plane. Alok Aggarwal, Herbert Edelsbrunner, Prabhakar Raghavan, Prasoon Tiwari. Inf. Process. Lett. (42): 55-60 (1992). Cited by 21Web SearchBibTeXDownload |
| 29 | The Robot Localization Problem in Two Dimensions. Leonidas J. Guibas, Rajeev Motwani, Prabhakar Raghavan. SODA 1992, 259-268. Cited by 47Web SearchBibTeXDownload |
| 28 | Fast Geometric Approximation Techniques and Geometric Embedding Problems. Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber. Theor. Comput. Sci. (106): 265-281 (1992). Cited by 25Web SearchBibTeXDownload |
| 1991 |
| 27 | Multiterminal Global Routing: A Deterministic Approximation Scheme. Prabhakar Raghavan, Clark D. Thompson. Algorithmica (6): 73-82 (1991). Cited by 35Web SearchBibTeXDownload |
| 26 | Deferred Data Structure for the Nearest Neighbor Problem. Alok Aggarwal, Prabhakar Raghavan. Inf. Process. Lett. (40): 119-122 (1991). Cited by 4Web SearchBibTeXDownload |
| 25 | On the Parallel Complexity of Evaluating Game Trees. Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal. SODA 1991, 404-413. Cited by 3Web SearchBibTeXDownload |
| 24 | Competitive Paging with Locality of Reference (Preliminary Version). Allan Borodin, Sandy Irani, Prabhakar Raghavan, Baruch Schieber. STOC 1991, 249-259. Web SearchBibTeXDownload |
| 23 | Navigating in Unfamiliar Geometric Terrain (Preliminary Version). Avrim Blum, Prabhakar Raghavan, Baruch Schieber. STOC 1991, 494-504. Web SearchBibTeXDownload |
| 1990 |
| 22 | Time-Space Tradeoffs for Undirected Graph Traversal. Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa. FOCS 1990, 429-438. Cited by 13Web SearchBibTeXDownload |
| 21 | 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, 285-296. Cited by 81Web SearchBibTeXDownload |
| 20 | Randomized Broadcast in Networks. Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal. SIGAL International Symposium on Algorithms 1990, 128-137. Cited by 88Web SearchBibTeXDownload |
| 19 | Random Walks on Weighted Graphs, and Applications to On-line Algorithms (Preliminary Version). Don Coppersmith, Peter Doyle, Prabhakar Raghavan, Marc Snir. STOC 1990, 369-378. Web SearchBibTeXDownload |
| 18 | Computing with Unreliable Information (Preliminary Version). Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal. STOC 1990, 128-137. Cited by 46Web SearchBibTeXDownload |
| 1989 |
| 17 | Memory Versus Randomization in On-line Algorithms (Extended Abstract). Prabhakar Raghavan, Marc Snir. ICALP 1989, 687-703. Web SearchBibTeXDownload |
| 16 | Program Correctness: Can One Test For It?. Manuel Blum, Prabhakar Raghavan. IFIP Congress 1989, 127-134. Web SearchBibTeX |
| 15 | Parallel Graph Algorithms That Are Efficient on Average. Don Coppersmith, Prabhakar Raghavan, Martin Tompa. Inf. Comput. (81): 318-333 (1989). Cited by 24Web SearchBibTeXDownload |
| 14 | Robust Algorithms for Packet Routing in a Mesh. Prabhakar Raghavan. SPAA 1989, 344-350. Cited by 33Web SearchBibTeXDownload |
| 13 | Trading Space for Time in Undirected s-t Connectivity. Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal. STOC 1989, 543-549. Cited by 48Web SearchBibTeXDownload |
| 12 | 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, 574-586. Web SearchBibTeXDownload |
| 11 | Fast Geometric Approximation Techniques and Geometric Embedding Problems. Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber. Symposium on Computational Geometry 1989, 292-301. Cited by 25Web SearchBibTeXDownload |
| 1988 |
| 10 | Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs. Prabhakar Raghavan. J. Comput. Syst. Sci. (37): 130-143 (1988). Cited by 498Web SearchBibTeXDownload |
| 9 | Deferred Data Structuring. Richard M. Karp, Rajeev Motwani, Prabhakar Raghavan. SIAM J. Comput. (17): 883-902 (1988). Cited by 18Web SearchBibTeXDownload |
| 8 | Energy Consumption in VLSI Circuits (Preliminary Version). Alok Aggarwal, Ashok K. Chandra, Prabhakar Raghavan. STOC 1988, 205-216. Cited by 16Web SearchBibTeXDownload |
| 7 | Randomized Algorithms and Pseudorandom Numbers. Howard J. Karloff, Prabhakar Raghavan. STOC 1988, 310-321. Cited by 46Web SearchBibTeXDownload |
| 1987 |
| 6 | Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Prabhakar Raghavan, Clark D. Thompson. Combinatorica (7): 365-374 (1987). Cited by 561Web SearchBibTeXDownload |
| 5 | Parallel Graph Algorithms that Are Efficient on Average. Don Coppersmith, Prabhakar Raghavan, Martin Tompa. FOCS 1987, 260-269. Web SearchBibTeXDownload |
| 1986 |
| 4 | A language for describing rectilinear Steiner tree configurations. Antony P.-C. Ng, Clark D. Thompson, Prabhakar Raghavan. DAC 1986, 659-662. Cited by 5Web SearchBibTeXDownload |
| 3 | Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs. Prabhakar Raghavan. FOCS 1986, 10-18. Cited by 498Web SearchBibTeXDownload |
| 2 | Deferred Data Structuring: Query-Driven Preprocessing for Geometric Search Problems. Rajeev Motwani, Prabhakar Raghavan. Symposium on Computational Geometry 1986, 303-312. Cited by 4Web SearchBibTeXDownload |
| 1985 |
| 1 | Provably Good Routing in Graphs: Regular Arrays. Prabhakar Raghavan, Clark D. Thompson. STOC 1985, 79-87. Cited by 62Web SearchBibTeXDownload |