| 2007 |
|---|
| 156 | EE | Prabhakar Raghavan:
Web search: from information retrieval to microeconomic modeling.
CIKM 2007: 1-2 |
| 155 | EE | Prabhakar Raghavan:
Web Search: Bridging Information Retrieval and Microeconomic Modeling.
HiPC 2007: 6 |
| 154 | EE | Flavio Chierichetti,
Alessandro Panconesi,
Prabhakar Raghavan,
Mauro Sozio,
Alessandro Tiberi,
Eli Upfal:
Finding near neighbors through cluster pruning.
PODS 2007: 103-112 |
| 153 | EE | Micah Dubinko,
Ravi Kumar,
Joseph Magnani,
Jasmine Novak,
Prabhakar Raghavan,
Andrew Tomkins:
Visualizing tags over time.
TWEB 1(2): (2007) |
| 2006 |
|---|
| 152 | EE | Prabhakar Raghavan:
The Changing Face of Web Search.
MDM 2006: 2 |
| 151 | EE | Prabhakar Raghavan:
The Changing Face of Web Search.
PAKDD 2006: 11 |
| 150 | EE | Prabhakar Raghavan:
The changing face of web search: algorithms, auctions and advertising.
STOC 2006: 129 |
| 149 | EE | Micah Dubinko,
Ravi Kumar,
Joseph Magnani,
Jasmine Novak,
Prabhakar Raghavan,
Andrew Tomkins:
Visualizing tags over time.
WWW 2006: 193-202 |
| 148 | EE | Ravi Kumar,
Prabhakar Raghavan,
Sridhar Rajagopalan,
Andrew Tomkins:
Core algorithms in the CLEVER system.
ACM Trans. Internet Techn. 6(2): 131-152 (2006) |
| 147 | | Gopal Pandurangan,
Prabhakar Raghavan,
Eli Upfal:
Using PageRank to Characterize Web Structure.
Internet Mathematics 3(1): (2006) |
| 146 | EE | Fred Douglis,
Prabhakar Raghavan:
Guest Editors' Introduction.
World Wide Web 9(4): 367-368 (2006) |
| 2005 |
|---|
| 145 | EE | Prabhakar Raghavan:
Query Incentive Networks.
ASIAN 2005: 19-21 |
| 144 | EE | Vinay Kakade,
Prabhakar Raghavan:
Encoding XML in Vector Spaces.
ECIR 2005: 96-111 |
| 143 | EE | Jon M. Kleinberg,
Prabhakar Raghavan:
Query Incentive Networks.
FOCS 2005: 132-141 |
| 142 | EE | Prabhakar Raghavan:
Incentive networks.
KDD 2005: 1 |
| 141 | EE | Anirban Dasgupta,
Ravi Kumar,
Prabhakar Raghavan,
Andrew Tomkins:
Variable latent semantic indexing.
KDD 2005: 13-21 |
| 140 | EE | Prabhakar Raghavan:
Incentive Networks.
LA-WEB 2005 |
| 139 | EE | 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 |
| 138 | EE | Rakesh Agrawal,
Johannes Gehrke,
Dimitrios Gunopulos,
Prabhakar Raghavan:
Automatic Subspace Clustering of High Dimensional Data.
Data Min. Knowl. Discov. 11(1): 5-33 (2005) |
| 137 | EE | Ravi Kumar,
Jasmine Novak,
Prabhakar Raghavan,
Andrew Tomkins:
On the Bursty Evolution of Blogspace.
World Wide Web 8(2): 159-178 (2005) |
| 2004 |
|---|
| 136 | EE | Prabhakar Raghavan:
Social Networks and the Web.
AWIC 2004: 1 |
| 135 | EE | Pavan Kumar C. Singitham,
Mahathi S. Mahabhashyam,
Prabhakar Raghavan:
Efficiency-Quality Tradeoffs for Vector Score Aggregation.
VLDB 2004: 624-635 |
| 134 | EE | Jasmine Novak,
Prabhakar Raghavan,
Andrew Tomkins:
Anti-aliasing on the web.
WWW 2004: 30-39 |
| 133 | EE | Ramanathan V. Guha,
Ravi Kumar,
Prabhakar Raghavan,
Andrew Tomkins:
Propagation of trust and distrust.
WWW 2004: 403-412 |
| 132 | EE | Yoshiharu Kohayakawa,
Flávio Keidi Miyazawa,
Prabhakar Raghavan,
Yoshiko Wakabayashi:
Multidimensional Cube Packing.
Algorithmica 40(3): 173-187 (2004) |
| 131 | EE | Ravi Kumar,
Jasmine Novak,
Prabhakar Raghavan,
Andrew Tomkins:
Structure and evolution of blogspace.
Commun. ACM 47(12): 35-39 (2004) |
| 130 | EE | Jon M. Kleinberg,
Christos H. Papadimitriou,
Prabhakar Raghavan:
Segmentation problems.
J. ACM 51(2): 263-280 (2004) |
| 2003 |
|---|
| 129 | EE | Mayank Bawa,
Gurmeet Singh Manku,
Prabhakar Raghavan:
SETS: search enhanced by topic segmentation.
SIGIR 2003: 306-313 |
| 128 | EE | Prabhakar Raghavan:
Extracting and Exploiting Structure in Text Search.
SIGMOD Conference 2003: 635 |
| 127 | EE | Gurmeet Singh Manku,
Mayank Bawa,
Prabhakar Raghavan:
Symphony: Distributed Hashing in a Small World.
USENIX Symposium on Internet Technologies and Systems 2003 |
| 126 | EE | Ravi Kumar,
Jasmine Novak,
Prabhakar Raghavan,
Andrew Tomkins:
On the bursty evolution of blogspace.
WWW 2003: 568-576 |
| 125 | EE | Prabhakar Raghavan:
Editorial: Preserving excellence through change.
J. ACM 50(4): 427-428 (2003) |
| 124 | EE | Jon M. Kleinberg,
Christos H. Papadimitriou,
Prabhakar Raghavan:
Auditing Boolean attributes.
J. Comput. Syst. Sci. 66(1): 244-253 (2003) |
| 123 | EE | Prabhakar Raghavan,
Hadas Shachnai,
Mira Yaniv:
Dynamic schemes for speculative execution of code.
Perform. Eval. 53(2): 125-142 (2003) |
| 2002 |
|---|
| 122 | EE | 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 |
| 121 | EE | Gopal Pandurangan,
Prabhakar Raghavan,
Eli Upfal:
Using PageRank to Characterize Web Structure.
COCOON 2002: 330-339 |
| 120 | EE | Prabhakar Raghavan,
Panayiotis Tsaparas:
Mining Significant Associations in Large Scale Text Corpora.
ICDM 2002: 402-409 |
| 119 | EE | Petros Drineas,
Iordanis Kerenidis,
Prabhakar Raghavan:
Competitive recommendation systems.
STOC 2002: 82-90 |
| 118 | EE | Ravi Kumar,
Prabhakar Raghavan,
Sridhar Rajagopalan,
Andrew Tomkins:
The Web and Social Networks.
IEEE Computer 35(11): 32-36 (2002) |
| 117 | EE | Prabhakar Raghavan:
Social Networks: From the Web to the Enterprise.
IEEE Internet Computing 6(1): 91-94 (2002) |
| 116 | EE | 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) |
| 115 | EE | 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) |
| 114 | | 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) |
| 2001 |
|---|
| 113 | | Gopal Pandurangan,
Prabhakar Raghavan,
Eli Upfal:
Building Low-Diameter P2P Networks.
FOCS 2001: 492-499 |
| 112 | EE | 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 |
| 111 | EE | Prabhakar Raghavan:
Social Networks on the Web and in the Enterprise.
Web Intelligence 2001: 58-60 |
| 110 | | Ravi Kumar,
Prabhakar Raghavan,
Sridhar Rajagopalan,
Andrew Tomkins:
On Semi-Automated Web Taxonomy Construction.
WebDB 2001: 91-96 |
| 109 | EE | Prabhakar Raghavan:
Structured and Unstructured Search in Enterprises.
IEEE Data Eng. Bull. 24(4): 15-18 (2001) |
| 108 | EE | Allan Borodin,
Jon M. Kleinberg,
Prabhakar Raghavan,
Madhu Sudan,
David P. Williamson:
Adversarial queuing theory.
J. ACM 48(1): 13-38 (2001) |
| 107 | | Ravi Kumar,
Prabhakar Raghavan,
Sridhar Rajagopalan,
Andrew Tomkins:
Recommendation Systems: A Probabilistic Analysis.
J. Comput. Syst. Sci. 63(1): 42-61 (2001) |
| 2000 |
|---|
| 106 | | Ravi Kumar,
Prabhakar Raghavan,
Sridhar Rajagopalan,
D. Sivakumar,
Andrew Tomkins,
Eli Upfal:
Random graph models for the web graph.
FOCS 2000: 57-65 |
| 105 | | Prabhakar Raghavan:
Graph Structure of the Web: A Survey.
LATIN 2000: 123-125 |
| 104 | EE | Ravi Kumar,
Prabhakar Raghavan,
Sridhar Rajagopalan,
D. Sivakumar,
Andrew Tomkins,
Eli Upfal:
The Web as a Graph.
PODS 2000: 1-10 |
| 103 | EE | Jon M. Kleinberg,
Christos H. Papadimitriou,
Prabhakar Raghavan:
Auditing Boolean Attributes.
PODS 2000: 86-91 |
| 102 | EE | 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 |
| 101 | EE | Moses Charikar,
Ronald Fagin,
Venkatesan Guruswami,
Jon M. Kleinberg,
Prabhakar Raghavan,
Amit Sahai:
Query strategies for priced information (extended abstract).
STOC 2000: 582-591 |
| 100 | EE | Rajeev Motwani,
Prabhakar Raghavan:
Guest Editors' Foreword.
Algorithmica 26(3-4): 311-312 (2000) |
| 99 | EE | Andrei Z. Broder,
Ravi Kumar,
Farzin Maghoul,
Prabhakar Raghavan,
Sridhar Rajagopalan,
Raymie Stata,
Andrew Tomkins,
Janet L. Wiener:
Graph structure in the Web.
Computer Networks 33(1-6): 309-320 (2000) |
| 98 | | Christos H. Papadimitriou,
Prabhakar Raghavan,
Hisao Tamaki,
Santosh Vempala:
Latent Semantic Indexing: A Probabilistic Analysis.
J. Comput. Syst. Sci. 61(2): 217-235 (2000) |
| 97 | EE | Anna R. Karlin,
Steven J. Phillips,
Prabhakar Raghavan:
Markov Paging.
SIAM J. Comput. 30(3): 906-922 (2000) |
| 96 | EE | David Gibson,
Jon M. Kleinberg,
Prabhakar Raghavan:
Clustering Categorical Data: An Approach Based on Dynamical Systems.
VLDB J. 8(3-4): 222-236 (2000) |
| 1999 |
|---|
| 95 | EE | Jon M. Kleinberg,
Ravi Kumar,
Prabhakar Raghavan,
Sridhar Rajagopalan,
Andrew Tomkins:
The Web as a Graph: Measurements, Models, and Methods.
COCOON 1999: 1-17 |
| 94 | EE | Moses Charikar,
Ravi Kumar,
Prabhakar Raghavan,
Sridhar Rajagopalan,
Andrew Tomkins:
On targeting Markov segments.
STOC 1999: 99-108 |
| 93 | EE | Ravi Kumar,
Prabhakar Raghavan,
Sridhar Rajagopalan,
Andrew Tomkins:
Extracting Large-Scale Knowledge Bases from the Web.
VLDB 1999: 639-650 |
| 92 | | 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) |
| 91 | | Sandy Irani,
Prabhakar Raghavan:
Combinatorial and experimental results for randomized point matching algorithms.
Comput. Geom. 12(1-2): 17-31 (1999) |
| 90 | EE | Ravi Kumar,
Prabhakar Raghavan,
Sridhar Rajagopalan,
Andrew Tomkins:
Trawling the Web for Emerging Cyber-Communities.
Computer Networks 31(11-16): 1481-1493 (1999) |
| 89 | | Soumen Chakrabarti,
Byron Dom,
Ravi Kumar,
Prabhakar Raghavan,
Sridhar Rajagopalan,
Andrew Tomkins,
David Gibson,
Jon M. Kleinberg:
Mining the Web's Link Structure.
IEEE Computer 32(8): 60-67 (1999) |
| 88 | | 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) |
| 1998 |
|---|
| 87 | EE | Ravi Kumar,
Prabhakar Raghavan,
Sridhar Rajagopalan,
Andrew Tomkins:
Recommendation Systems: A Probabilistic Analysis.
FOCS 1998: 664-673 |
| 86 | EE | David Gibson,
Jon M. Kleinberg,
Prabhakar Raghavan:
Inferring Web Communities from Link Topology.
Hypertext 1998: 225-234 |
| 85 | EE | Prabhakar Raghavan,
Hadas Shachnai,
Mira Yaniv:
Dynamic Schemes for Speculative Execution of Code.
MASCOTS 1998: 309- |
| 84 | EE | Christos H. Papadimitriou,
Prabhakar Raghavan,
Hisao Tamaki,
Santosh Vempala:
Latent Semantic Indexing: A Probabilistic Analysis.
PODS 1998: 159-168 |
| 83 | EE | Rakesh Agrawal,
Johannes Gehrke,
Dimitrios Gunopulos,
Prabhakar Raghavan:
Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications.
SIGMOD Conference 1998: 94-105 |
| 82 | EE | Sanjeev Arora,
Prabhakar Raghavan,
Satish Rao:
Approximation Schemes for Euclidean k-Medians and Related Problems.
STOC 1998: 106-113 |
| 81 | EE | Jon M. Kleinberg,
Christos H. Papadimitriou,
Prabhakar Raghavan:
Segmentation Problems.
STOC 1998: 473-482 |
| 80 | EE | David Gibson,
Jon M. Kleinberg,
Prabhakar Raghavan:
Clustering Categorical Data: An Approach Based on Dynamical Systems.
VLDB 1998: 311-322 |
| 79 | EE | Soumen Chakrabarti,
Byron Dom,
Prabhakar Raghavan,
Sridhar Rajagopalan,
David Gibson,
Jon M. Kleinberg:
Automatic Resource Compilation by Analyzing Hyperlink Structure and Associated Text.
Computer Networks 30(1-7): 65-74 (1998) |
| 78 | | Jon M. Kleinberg,
Christos H. Papadimitriou,
Prabhakar Raghavan:
A Microeconomic View of Data Mining.
Data Min. Knowl. Discov. 2(4): 311-324 (1998) |
| 77 | | 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) |
| 76 | | Prabhakar Raghavan,
Eli Upfal:
Stochastic Contention Resolution With Short Delays.
SIAM J. Comput. 28(2): 709-719 (1998) |
| 75 | EE | 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) |
| 1997 |
|---|
| 74 | EE | Jon M. Kleinberg,
Rajeev Motwani,
Prabhakar Raghavan,
Suresh Venkatasubramanian:
Storage Management for Evolving Databases.
FOCS 1997: 353-362 |
| 73 | | Prabhakar Raghavan:
Information Retrieval Algorithms: A Survey.
SODA 1997: 11-18 |
| 72 | EE | Piotr Indyk,
Rajeev Motwani,
Prabhakar Raghavan,
Santosh Vempala:
Locality-Preserving Hashing in Multidimensional Spaces.
STOC 1997: 618-625 |
| 71 | EE | Soumen Chakrabarti,
Byron Dom,
Rakesh Agrawal,
Prabhakar Raghavan:
Using Taxonomy, Discriminants, and Signatures for Navigating in Text Databases.
VLDB 1997: 446-455 |
| 70 | | Moses Charikar,
Rajeev Motwani,
Prabhakar Raghavan,
Craig Silverstein:
Constrained TSP and Low-Power Computing.
WADS 1997: 104-115 |
| 69 | | Rajeev Motwani,
Prabhakar Raghavan:
Randomized Algorithms.
The Computer Science and Engineering Handbook 1997: 141-161 |
| 68 | | 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) |
| 67 | | Jérôme Barraquand,
Lydia E. Kavraki,
Jean-Claude Latombe,
Tsai-Yen Li,
Rajeev Motwani,
Prabhakar Raghavan:
A Random Sampling Scheme for Path Planning.
I. J. Robotic Res. 16(6): 759-774 (1997) |
| 66 | EE | Allan Borodin,
Prabhakar Raghavan,
Baruch Schieber,
Eli Upfal:
How much can hardware help routing?
J. ACM 44(5): 726-741 (1997) |
| 65 | | Avrim Blum,
Prabhakar Raghavan,
Baruch Schieber:
Navigating in Unfamiliar Geometric Terrain.
SIAM J. Comput. 26(1): 110-137 (1997) |
| 64 | | Leonidas J. Guibas,
Rajeev Motwani,
Prabhakar Raghavan:
The Robot Localization Problem.
SIAM J. Comput. 26(4): 1120-1138 (1997) |
| 1996 |
|---|
| 63 | | Prabhakar Raghavan:
Computational Geometry Impact Potential: A Business and Industrial Perspective.
CCCG 1996: 276 |
| 62 | | Andreas Arning,
Rakesh Agrawal,
Prabhakar Raghavan:
A Linear Method for Deviation Detection in Large Databases.
KDD 1996: 164-169 |
| 61 | EE | Allan Borodin,
Jon M. Kleinberg,
Prabhakar Raghavan,
Madhu Sudan,
David P. Williamson:
Adversarial Queueing Theory.
STOC 1996: 376-385 |
| 60 | EE | Sandy Irani,
Prabhakar Raghavan:
Combinatorial and Experimental Results for Randomized Point Matching Algorithms.
Symposium on Computational Geometry 1996: 68-77 |
| 59 | | Rajeev Motwani,
Prabhakar Raghavan:
Randomized Algorithms.
ACM Comput. Surv. 28(1): 33-37 (1996) |
| 58 | | Sergio A. Felperin,
Prabhakar Raghavan,
Eli Upfal:
A Theory of Wormhole Routing in Parallel Computers.
IEEE Trans. Computers 45(6): 704-713 (1996) |
| 57 | | 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) |
| 1995 |
|---|
| 56 | | Rajeev Motwani,
Prabhakar Raghavan:
Randomized Algorithms.
Cambridge University Press 1995 |
| 55 | EE | Prabhakar Raghavan,
Eli Upfal:
Stochastic contention resolution with short delays.
STOC 1995: 229-237 |
| 54 | EE | Pankaj K. Agarwal,
Prabhakar Raghavan,
Hisao Tamaki:
Motion planning for a steering-constrained robot through moderate obstacles.
STOC 1995: 343-352 |
| 53 | EE | Lydia E. Kavraki,
Jean-Claude Latombe,
Rajeev Motwani,
Prabhakar Raghavan:
Randomized query processing in robot path planning (Extended Abstract).
STOC 1995: 353-362 |
| 52 | EE | 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) |
| 51 | | Allan Borodin,
Sandy Irani,
Prabhakar Raghavan,
Baruch Schieber:
Competitive Paging with Locality of Reference.
J. Comput. Syst. Sci. 50(2): 244-258 (1995) |
| 50 | | Prabhakar Raghavan:
Robust Algorithms for Packet Routing in a Mesh.
Mathematical Systems Theory 28(1): 1-11 (1995) |
| 1994 |
|---|
| 49 | | Christos H. Papadimitriou,
Prabhakar Raghavan,
Madhu Sudan,
Hisao Tamaki:
Motion Planning on a Graph (Extended Abstract)
FOCS 1994: 511-520 |
| 48 | | Prabhakar Raghavan:
Randomized Approximation Algorithms in Combinatorial Optimization.
FSTTCS 1994: 300-317 |
| 47 | | Kazuo Iwano,
Prabhakar Raghavan,
Hisao Tamaki:
The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection.
ISAAC 1994: 29-37 |
| 46 | EE | Prabhakar Raghavan,
Eli Upfal:
Efficient routing in all-optical networks.
STOC 1994: 134-143 |
| 45 | EE | Avrim Blum,
Prasad Chalasani,
Don Coppersmith,
William R. Pulleyblank,
Prabhakar Raghavan,
Madhu Sudan:
The minimum latency problem.
STOC 1994: 163-171 |
| 44 | | Prabhakar Raghavan:
Guest Editor's Foreword: Special Issue on On-Line Algorithms.
Algorithmica 11(1): 1 (1994) |
| 43 | | 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) |
| 42 | | Uriel Feige,
Prabhakar Raghavan,
David Peleg,
Eli Upfal:
Computing with Noisy Information.
SIAM J. Comput. 23(5): 1001-1018 (1994) |
| 1993 |
|---|
| 41 | | 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
Springer 1993 |
| 40 | | Amotz Bar-Noy,
Prabhakar Raghavan,
Baruch Schieber,
Hisao Tamaki:
Fast Deflection Routing for Packets and Worms (Extended Summary).
PODC 1993: 75-86 |
| 39 | EE | Allan Borodin,
Prabhakar Raghavan,
Baruch Schieber,
Eli Upfal:
How much can hardware help routing?
STOC 1993: 573-582 |
| 38 | EE | 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) |
| 37 | EE | Howard J. Karloff,
Prabhakar Raghavan:
Randomized Algorithms and Pseudorandom Numbers.
J. ACM 40(3): 454-476 (1993) |
| 1992 |
|---|
| 36 | | Anna R. Karlin,
Steven J. Phillips,
Prabhakar Raghavan:
Markov Paging (Extended Abstract)
FOCS 1992: 208-217 |
| 35 | | Uriel Feige,
Prabhakar Raghavan:
Exact Analysis of Hot-Potato Routing (Extended Abstract)
FOCS 1992: 553-562 |
| 34 | | Sergio A. Felperin,
Prabhakar Raghavan,
Eli Upfal:
A Theory of Wormhole Routing in Parallel Computers (Extended Abstract)
FOCS 1992: 563-572 |
| 33 | | Sergio A. Felperin,
Prabhakar Raghavan,
Eli Upfal:
An Experimental Study of Wormhole Routing in Parallel Computers.
Heinz Nixdorf Symposium 1992: 156-165 |
| 32 | EE | Leonidas J. Guibas,
Rajeev Motwani,
Prabhakar Raghavan:
The Robot Localization Problem in Two Dimensions.
SODA 1992: 259-268 |
| 31 | | Prabhakar Raghavan:
Integer Programming in VLSI Design.
Discrete Applied Mathematics 40(1): 29-43 (1992) |
| 30 | | 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) |
| 29 | | 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) |
| 1991 |
|---|
| 28 | | Andrei Z. Broder,
Anna R. Karlin,
Prabhakar Raghavan,
Eli Upfal:
On the Parallel Complexity of Evaluating Game Trees.
SODA 1991: 404-413 |
| 27 | | Allan Borodin,
Sandy Irani,
Prabhakar Raghavan,
Baruch Schieber:
Competitive Paging with Locality of Reference (Preliminary Version)
STOC 1991: 249-259 |
| 26 | | Avrim Blum,
Prabhakar Raghavan,
Baruch Schieber:
Navigating in Unfamiliar Geometric Terrain (Preliminary Version)
STOC 1991: 494-504 |
| 25 | | Prabhakar Raghavan,
Clark D. Thompson:
Multiterminal Global Routing: A Deterministic Approximation Scheme.
Algorithmica 6(1): 73-82 (1991) |
| 24 | | Alok Aggarwal,
Prabhakar Raghavan:
Deferred Data Structure for the Nearest Neighbor Problem.
Inf. Process. Lett. 40(3): 119-122 (1991) |
| 1990 |
|---|
| 23 | | 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 |
| 22 | | Paul Beame,
Allan Borodin,
Prabhakar Raghavan,
Walter L. Ruzzo,
Martin Tompa:
Time-Space Tradeoffs for Undirected Graph Traversal
FOCS 1990: 429-438 |
| 21 | | Uriel Feige,
David Peleg,
Prabhakar Raghavan,
Eli Upfal:
Randomized Broadcast in Networks.
SIGAL International Symposium on Algorithms 1990: 128-137 |
| 20 | | Uriel Feige,
David Peleg,
Prabhakar Raghavan,
Eli Upfal:
Computing with Unreliable Information (Preliminary Version)
STOC 1990: 128-137 |
| 19 | | 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 |
| 18 | | Uriel Feige,
David Peleg,
Prabhakar Raghavan,
Eli Upfal:
Randomized Broadcast in Networks.
Random Struct. Algorithms 1(4): 447-460 (1990) |
| 1989 |
|---|
| 17 | | Prabhakar Raghavan,
Marc Snir:
Memory Versus Randomization in On-line Algorithms (Extended Abstract).
ICALP 1989: 687-703 |
| 16 | | Manuel Blum,
Prabhakar Raghavan:
Program Correctness: Can One Test For It?
IFIP Congress 1989: 127-134 |
| 15 | EE | Prabhakar Raghavan:
Robust Algorithms for Packet Routing in a Mesh.
SPAA 1989: 344-350 |
| 14 | | Andrei Z. Broder,
Anna R. Karlin,
Prabhakar Raghavan,
Eli Upfal:
Trading Space for Time in Undirected s-t Connectivity
STOC 1989: 543-549 |
| 13 | | 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 |
| 12 | EE | 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 |
| 11 | | Don Coppersmith,
Prabhakar Raghavan,
Martin Tompa:
Parallel Graph Algorithms That Are Efficient on Average
Inf. Comput. 81(3): 318-333 (1989) |
| 1988 |
|---|
| 10 | | Alok Aggarwal,
Ashok K. Chandra,
Prabhakar Raghavan:
Energy Consumption in VLSI Circuits (Preliminary Version)
STOC 1988: 205-216 |
| 9 | | Howard J. Karloff,
Prabhakar Raghavan:
Randomized Algorithms and Pseudorandom Numbers
STOC 1988: 310-321 |
| 8 | | Prabhakar Raghavan:
Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs.
J. Comput. Syst. Sci. 37(2): 130-143 (1988) |
| 7 | | Richard M. Karp,
Rajeev Motwani,
Prabhakar Raghavan:
Deferred Data Structuring.
SIAM J. Comput. 17(5): 883-902 (1988) |
| 1987 |
|---|
| 6 | | Don Coppersmith,
Prabhakar Raghavan,
Martin Tompa:
Parallel Graph Algorithms that Are Efficient on Average
FOCS 1987: 260-269 |
| 5 | | Prabhakar Raghavan,
Clark D. Thompson:
Randomized rounding: a technique for provably good algorithms and algorithmic proofs.
Combinatorica 7(4): 365-374 (1987) |
| 1986 |
|---|
| 4 | EE | Antony P.-C. Ng,
Clark D. Thompson,
Prabhakar Raghavan:
A language for describing rectilinear Steiner tree configurations.
DAC 1986: 659-662 |
| 3 | | Prabhakar Raghavan:
Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs
FOCS 1986: 10-18 |
| 2 | EE | Rajeev Motwani,
Prabhakar Raghavan:
Deferred Data Structuring: Query-Driven Preprocessing for Geometric Search Problems.
Symposium on Computational Geometry 1986: 303-312 |
| 1985 |
|---|
| 1 | | Prabhakar Raghavan,
Clark D. Thompson:
Provably Good Routing in Graphs: Regular Arrays
STOC 1985: 79-87 |
