DiSC - Author Index

Prabhakar Raghavan

Online DBLP entries are available for Prabhakar Raghavan and the following references. (The DiSC DBLP references below have been taken from the Novemember 1998 DBLP.)

David Gibson , Jon M. Kleinberg , Prabhakar Raghavan: Inferring Web Communities from Link Topology. Hypertext 1998 : 225-234

Christos H. Papadimitriou , Prabhakar Raghavan, Hisao Tamaki , Santosh Vempala : Latent Semantic Indexing: A Probabilistic Analysis. PODS 1998 : 159-168

Rakesh Agrawal , Johannes Gehrke , Dimitrios Gunopulos , Prabhakar Raghavan: Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications. SIGMOD Conference 1998 : 94-105

Sanjeev Arora , Prabhakar Raghavan, Satish Rao : Approximation Schemes for Euclidean k -Medians and Related Problems. STOC 1998 : 106-113

Jon M. Kleinberg , Christos H. Papadimitriou , Prabhakar Raghavan: Segmentation Problems. STOC 1998 : 473-482

David Gibson , Jon M. Kleinberg , Prabhakar Raghavan: Clustering Categorical Data: An Approach Based on Dynamical Systems. VLDB 1998 : 311-322

Lydia E. Kavraki , Jean-Claude Latombe , Rajeev Motwani , Prabhakar Raghavan: Randomized Query Processing in Robot Path Planning. JCSS 57 (1): 50-66 (1998)

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 Journal 7 (3): 163-178 (1998)

Piotr Indyk , Rajeev Motwani , Prabhakar Raghavan, Santosh Vempala : Locality-Preserving Hashing in Multidimensional Spaces. STOC 1997 : 618-625

Rajeev Motwani , Prabhakar Raghavan: Randomized Algorithms. The Computer Science and Engineering Handbook 1997 : 141-161

Soumen Chakrabarti , Byron Dom , Rakesh Agrawal , Prabhakar Raghavan: Using Taxonomy, Discriminants, and Signatures for Navigating in Text Databases. VLDB 1997 : 446-455

Moses Charikar , Rajeev Motwani , Prabhakar Raghavan, Craig Silverstein : Constrained TSP and Low-Power Computing. WADS 1997 : 104-115

Ashok K. Chandra , Prabhakar Raghavan, Walter L. Ruzzo , Roman Smolensky , Prasoon Tiwari : The Electrical Resistance of a Graph Captures its Commute and Cover Times. Computational Complexity 6 (4): 312-340 (1997)

Allan Borodin , Prabhakar Raghavan, Baruch Schieber , Eli Upfal : How Much Can Hardware Help Routing? JACM 44 (5): 726-741 (1997)

Avrim Blum , Prabhakar Raghavan, Baruch Schieber : Navigating in Unfamiliar Geometric Terrain. SIAM J. Comput. 26 (1): 110-137 (1997)

Leonidas J. Guibas , Rajeev Motwani , Prabhakar Raghavan: The Robot Localization Problem. SIAM J. Comput. 26 (4): 1120-1138 (1997)

Andreas Arning , Rakesh Agrawal , Prabhakar Raghavan: A Linear Method for Deviation Detection in Large Databases. KDD 1996 : 164-169

Allan Borodin , Jon M. Kleinberg , Prabhakar Raghavan, Madhu Sudan , David P. Williamson : Adversarial Queueing Theory. STOC 1996 : 376-385

Sandy Irani , Prabhakar Raghavan: Combinatorial and Experimental Results for Randomized Point Matching Algorithms. Symposium on Computational Geometry 1996 : 68-77

Rajeev Motwani , Prabhakar Raghavan: Randomized Algorithms. Computing Surveys 28 (1): 33-37 (1996)

Sergio Felperin , Prabhakar Raghavan, Eli Upfal : A Theory of Wormhole Routing in Parallel Computers. IEEE Transactions on Computers 45 (6): 704-713 (1996)

Paul Beame , Allan Borodin , Prabhakar Raghavan, Walter L. Ruzzo , Martin Tompa : Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata. Information and Computation 130 (2): 101-129 (1996)

Prabhakar Raghavan, Eli Upfal : Stochastic Contention Resolution With Short Delays. STOC 1995 : 229-237

Pankaj K. Agarwal , Prabhakar Raghavan, Hisao Tamaki : Motion Planning for a Steering-Constrained Robot Through Moderate Obstacles. STOC 1995 : 343-352

Lydia E. Kavraki , Jean-Claude Latombe , Rajeev Motwani , Prabhakar Raghavan: Randomized Query Processing in Robot Motion Planning (Extended Abstract). STOC 1995 : 353-362

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. IPL 56 (2): 79-81 (1995)

Allan Borodin , Sandy Irani , Prabhakar Raghavan, Baruch Schieber : Competitive Paging with Locality of Reference. JCSS 50 (2): 244-258 (1995)

Prabhakar Raghavan: Robust Algorithms for Packet Routing in a Mesh. Mathematical Systems Theory 28 (1): 1-11 (1995)

Christos H. Papadimitriou , Prabhakar Raghavan, Madhu Sudan , Hisao Tamaki : Motion Planning on a Graph (Extended Abstract). FOCS 1994 : 511-520

Prabhakar Raghavan: Randomized Approximation Algorithms in Combinatorial Optimization. FSTTCS 1994 : 300-317

Prabhakar Raghavan, Eli Upfal : Efficient Routing in All-Optical Networks. STOC 1994 : 134-143

Avrim Blum , Prasad Chalasani , Don Coppersmith , William R. Pulleyblank , Prabhakar Raghavan, Madhu Sudan : The Minimum Latency Problem. STOC 1994 : 163-171

Prabhakar Raghavan: Guest Editor's Foreword: Special Issue on On-Line Algorithms. Algorithmica 11 (1): 1 (1994)

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)

Uriel Feige , Prabhakar Raghavan, David Peleg , Eli Upfal : Computing with Noisy Information. SIAM J. Comput. 23 (5): 1001-1018 (1994)

Allan Borodin , Prabhakar Raghavan, Baruch Schieber , Eli Upfal : How Much Can Hardware Help Routing? (Extended Abstract). STOC 1993 : 573-582

Don Coppersmith , Peter Doyle , Prabhakar Raghavan, Marc Snir : Random Walks on Weighted Graphs and Applications to On-line Algorithms. JACM 40 (3): 421-453 (1993)

Howard J. Karloff , Prabhakar Raghavan: Randomized Algorithms and Pseudorandom Numbers. JACM 40 (3): 454-476 (1993)

Anna R. Karlin , Steven J. Phillips , Prabhakar Raghavan: Markov Paging (Extended Abstract). FOCS 1992 : 208-217

Uriel Feige , Prabhakar Raghavan: Exact Analysis of Hot-Potato Routing (Extended Abstract). FOCS 1992 : 553-562

Sergio Felperin , Prabhakar Raghavan, Eli Upfal : A Theory of Wormhole Routing in Parallel Computers (Extended Abstract). FOCS 1992 : 563-572

Amotz Bar-Noy , Prabhakar Raghavan, Baruch Schieber , Hisao Tamaki : Fast Deflection Routing for Packets and Worms (Extended Summary). PODC 1992 : 75-86

Alok Aggarwal , Herbert Edelsbrunner , Prabhakar Raghavan, Prasoon Tiwari : Optimal Time Bounds for Some Proximity Problems in the Plane. IPL 42 (1): 55-60 (1992)

Marshall W. Bern , Howard J. Karloff , Prabhakar Raghavan, Baruch Schieber : Fast Geometric Approximation Techniques and Geometric Embedding Problems. TCS 106 (2): 265-281 (1992)

Andrei Z. Broder , Anna R. Karlin , Prabhakar Raghavan, Eli Upfal : On the Parallel Complexity of Evaluating Game Trees. SODA 1991 : 404-413

Allan Borodin , Sandy Irani , Prabhakar Raghavan, Baruch Schieber : Competitive Paging with Locality of Reference (Preliminary Version). STOC 1991 : 249-259

Avrim Blum , Prabhakar Raghavan, Baruch Schieber : Navigating in Unfamiliar Geometric Terrain (Preliminary Version). STOC 1991 : 494-504

Prabhakar Raghavan, Clark D. Thompson : Multiterminal Global Routing: A Deterministic Approximation Scheme. Algorithmica 6 (1): 73-82 (1991)

Alok Aggarwal , Prabhakar Raghavan: Deferred Data Structure for the Nearest Neighbor Problem. IPL 40 (3): 119-122 (1991)

Christos Kaklamanis , Anna R. Karlin , Frank Thomson Leighton , Victor Milenkovic , Prabhakar Raghavan, S. Rao , Clark D. Thomborson , A. Tsantilas : Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract). FOCS 1990 : 285-296

Paul Beame , Allan Borodin , Prabhakar Raghavan, Walter L. Ruzzo , Martin Tompa : Time-Space Tradeoffs for Undirected Graph Traversal. FOCS 1990 : 429-438

Uriel Feige , David Peleg , Prabhakar Raghavan, Eli Upfal : Computing with Unreliable Information (Preliminary Version). STOC 1990 : 128-137

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

Prabhakar Raghavan, Marc Snir : Memory Versus Randomization in On-line Algorithms (Extended Abstract). ICALP 1989 : 687-703

Manuel Blum , Prabhakar Raghavan: Program Correctness: Can One Test For It? IFIP 1989 : 127-134

Andrei Z. Broder , Anna R. Karlin , Prabhakar Raghavan, Eli Upfal : Trading Space for Time in Undirected s-t Connectivity. STOC 1989 : 543-549

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

Marshall W. Bern , Howard J. Karloff , Prabhakar Raghavan, Baruch Schieber : Fast Geometric Approximation Techniques and Geometric Embedding Problems. Symposium on Computational Geometry 1989 : 292-301

Don Coppersmith , Prabhakar Raghavan, Martin Tompa : Parallel Graph Algorithms That Are Efficient on Average. Information and Computation 81 (3): 318-333 (1989)

Alok Aggarwal , Ashok K. Chandra , Prabhakar Raghavan: Energy Consumption in VLSI Circuits (Preliminary Version). STOC 1988 : 205-216

Howard J. Karloff , Prabhakar Raghavan: Randomized Algorithms and Pseudorandom Numbers. STOC 1988 : 310-321

Prabhakar Raghavan: Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs. JCSS 37 (2): 130-143 (1988)

Richard M. Karp , Rajeev Motwani , Prabhakar Raghavan: Deferred Data Structuring. SIAM J. Comput. 17 (5): 883-902 (1988)

Don Coppersmith , Prabhakar Raghavan, Martin Tompa : Parallel Graph Algorithms that Are Efficient on Average. FOCS 1987 : 260-269

Prabhakar Raghavan: Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs. FOCS 1986 : 10-18

Prabhakar Raghavan, Clark D. Thompson : Provably Good Routing in Graphs: Regular Arrays. STOC 1985 : 79-87

DBLP: Copyright ©1999 by Michael Ley (ley@uni-trier.de).