Prabhakar Raghavan

According to our database1, Prabhakar Raghavan authored at least 191 papers between 1985 and 2016.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Awards

ACM Fellow

ACM Fellow 2001, "For contributions to the theory and practice of randomized algorithms.".

IEEE Fellow

IEEE Fellow 2000, "For contributions to the theory and practice of randomized algorithms.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2016
The Limits of Popularity-Based Recommendations, and the Role of Social Ties.
CoRR, 2016

The Limits of Popularity-Based Recommendations, and the Role of Social Ties.
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016

2013
Models for the Compressible Web.
SIAM J. Comput., 2013

2012
Rajeev Motwani (1962-2009).
Theory of Computing, 2012

Are web users really Markovian?
Proceedings of the 21st World Wide Web Conference 2012, 2012

2011
An algorithmic treatment of strong queries.
Proceedings of the Forth International Conference on Web Search and Web Data Mining, 2011

Optimizing two-dimensional search results presentation.
Proceedings of the Forth International Conference on Web Search and Web Data Mining, 2011

Markov Layout.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010
Search is dead!: long live search.
Proceedings of the 19th International Conference on World Wide Web, 2010

The Quantitative Analysis of User Behavior Online - Data, Models and Algorithms.
Proceedings of the Algorithm Theory, 2010

Heavy Tails and Models for the Web and Social Networks.
Proceedings of the Distributed Computing and Networking, 11th International Conference, 2010

The FUNnest Talks That belong to FUN (Abstract).
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

The Quantitative Analysis of User Behavior Online - Data, Models and Algorithms.
Proceedings of the Computer Science, 2010

2009
Some results of Christos Papadimitriou on internet structure, network routing, and web information.
Computer Science Review, 2009

Compressed web indexes.
Proceedings of the 18th International Conference on World Wide Web, 2009

Online story scheduling in web advertising.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Next Generation Web Search.
Proceedings of the Search Computing: Challenges and Directions [outcome of the first SeCO Workshop on Search Computing Challenges and Directions, 2009

On compressing social networks.
Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, June 28, 2009

Models for the Compressible Web.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2008
Heavy Tails and Web Models.
Proceedings of the Scalable Uncertainty Management, Second International Conference, 2008

The Changing Face of Web Search.
Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

Introduction to information retrieval.
Cambridge University Press, ISBN: 978-0-521-86571-5, 2008

2007
Visualizing tags over time.
TWEB, 2007

Finding near neighbors through cluster pruning.
Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007

Web Search: Bridging Information Retrieval and Microeconomic Modeling.
Proceedings of the High Performance Computing, 2007

Web search: from information retrieval to microeconomic modeling.
Proceedings of the Sixteenth ACM Conference on Information and Knowledge Management, 2007

2006
Guest Editors' Introduction.
World Wide Web, 2006

Core algorithms in the CLEVER system.
ACM Trans. Internet Techn., 2006

Using PageRank to Characterize Web Structure.
Internet Mathematics, 2006

Visualizing tags over time.
Proceedings of the 15th international conference on World Wide Web, 2006

The changing face of web search: algorithms, auctions and advertising.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

The Changing Face of Web Search.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2006

The Changing Face of Web Search.
Proceedings of the 7th International Conference on Mobile Data Management (MDM 2006), 2006

2005
On the Bursty Evolution of Blogspace.
World Wide Web, 2005

Automatic Subspace Clustering of High Dimensional Data.
Data Min. Knowl. Discov., 2005

Current trends in the integration of searching and browsing.
Proceedings of the 14th international conference on World Wide Web, 2005

Incentive Networks.
Proceedings of the Third Latin American Web Congress (LA-Web 2005), 1 October, 2005

Incentive networks.
Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2005

Variable latent semantic indexing.
Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2005

Query Incentive Networks.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

Encoding XML in Vector Spaces.
Proceedings of the Advances in Information Retrieval, 2005

Query Incentive Networks.
Proceedings of the Advances in Computer Science, 2005

2004
Segmentation problems.
J. ACM, 2004

Structure and evolution of blogspace.
Commun. ACM, 2004

Multidimensional Cube Packing.
Algorithmica, 2004

Anti-aliasing on the web.
Proceedings of the 13th international conference on World Wide Web, 2004

Propagation of trust and distrust.
Proceedings of the 13th international conference on World Wide Web, 2004

Text Centric Structure Extraction and Exploitation (abstract only).
Proceedings of the Seventh International Workshop on the Web and Databases, 2004

Efficiency-Quality Tradeoffs for Vector Score Aggregation.
Proceedings of the (e)Proceedings of the Thirtieth International Conference on Very Large Data Bases, Toronto, Canada, August 31, 2004


Social Networks and the Web.
Proceedings of the Advances in Web Intelligence, 2004

2003
Dynamic schemes for speculative execution of code.
Perform. Eval., 2003

Building low-diameter peer-to-peer networks.
IEEE Journal on Selected Areas in Communications, 2003

Auditing Boolean attributes.
J. Comput. Syst. Sci., 2003

Editorial: Preserving excellence through change.
J. ACM, 2003

On the bursty evolution of blogspace.
Proceedings of the Twelfth International World Wide Web Conference, 2003

Symphony: Distributed Hashing in a Small World.
Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems, 2003

Extracting and Exploiting Structure in Text Search.
Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, 2003

SETS: search enhanced by topic segmentation.
Proceedings of the SIGIR 2003: Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, July 28, 2003

2002
A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search.
Theor. Comput. Sci., 2002

Query Strategies for Priced Information.
J. Comput. Syst. Sci., 2002

More on random walks, electrical networks, and the harmonic k-server algorithm.
Inf. Process. Lett., 2002

Social Networks: From the Web to the Enterprise.
IEEE Internet Computing, 2002

The Web and Social Networks.
IEEE Computer, 2002

Competitive recommendation systems.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Mining Significant Associations in Large Scale Text Corpora.
Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), 2002

Using PageRank to Characterize Web Structure.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

Thematic mapping - from unstructured documents to taxonomies.
Proceedings of the 2002 ACM CIKM International Conference on Information and Knowledge Management, 2002

2001
Recommendation Systems: A Probabilistic Analysis.
J. Comput. Syst. Sci., 2001

Adversarial queuing theory.
J. ACM, 2001

Multidimensional Cube Packing.
Electronic Notes in Discrete Mathematics, 2001

Structured and Unstructured Search in Enterprises.
IEEE Data Eng. Bull., 2001

Social Networks on the Web and in the Enterprise.
Proceedings of the Web Intelligence: Research and Development, 2001

On Semi-Automated Web Taxonomy Construction.
Proceedings of the Fourth International Workshop on the Web and Databases, 2001

Navigating large-scale semi-structured data in business portals.
Proceedings of the VLDB 2001, 2001

Building Low-Diameter P2P Networks.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000
Clustering Categorical Data: An Approach Based on Dynamical Systems.
VLDB J., 2000

Markov Paging.
SIAM J. Comput., 2000

Latent Semantic Indexing: A Probabilistic Analysis.
J. Comput. Syst. Sci., 2000

Graph structure in the Web.
Computer Networks, 2000

Guest Editors' Foreword.
Algorithmica, 2000

Random walks with "back buttons" (extended abstract).
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Query strategies for priced information (extended abstract).
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

The Web as a Graph.
Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2000

Auditing Boolean Attributes.
Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2000

Graph Structure of the Web: A Survey.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Random graph models for the web graph.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999
A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata.
SIAM J. Comput., 1999

Mining the Web's Link Structure.
IEEE Computer, 1999

Combinatorial and experimental results for randomized point matching algorithms.
Comput. Geom., 1999

Trawling the Web for Emerging Cyber-Communities.
Computer Networks, 1999

Topic Distillation and Spectral Filtering.
Artif. Intell. Rev., 1999

Extracting Large-Scale Knowledge Bases from the Web.
Proceedings of the VLDB'99, 1999

On targeting Markov segments.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

The Web as a Graph: Measurements, Models, and Methods.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

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

On a theory of computing symposia.
SIGACT News, 1998

Stochastic Contention Resolution With Short Delays.
SIAM J. Comput., 1998

Randomized Query Processing in Robot Path Planning.
J. Comput. Syst. Sci., 1998

A Microeconomic View of Data Mining.
Data Min. Knowl. Discov., 1998

Automatic Resource Compilation by Analyzing Hyperlink Structure and Associated Text.
Computer Networks, 1998

Clustering Categorical Data: An Approach Based on Dynamical Systems.
Proceedings of the VLDB'98, 1998

Segmentation Problems.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Approximation Schemes for Euclidean k-Medians and Related Problems.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications.
Proceedings of the SIGMOD 1998, 1998

Latent Semantic Indexing: A Probabilistic Analysis.
Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1998

Dynamic Schemes for Speculative Execution of Code.
Proceedings of the MASCOTS 1998, 1998

Inferring Web Communities from Link Topology.
Proceedings of the HYPERTEXT '98. Proceedings of the Ninth ACM Conference on Hypertext and Hypermedia: Links, Objects, Time and Space, 1998

Recommendation Systems: A Probabilistic Analysis.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

Computing on data streams.
Proceedings of the External Memory Algorithms, 1998

1997
Strategic directions in research in theory of computing.
SIGACT News, 1997

The Robot Localization Problem.
SIAM J. Comput., 1997

Navigating in Unfamiliar Geometric Terrain.
SIAM J. Comput., 1997

How much can hardware help routing?
J. ACM, 1997

A Random Sampling Scheme for Path Planning.
I. J. Robotics Res., 1997

The Electrical Resistance of a Graph Captures its Commute and Cover Times.
Computational Complexity, 1997

Constrained TSP and Low-Power Computing.
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Using Taxonomy, Discriminants, and Signatures for Navigating in Text Databases.
Proceedings of the VLDB'97, 1997

Locality-Preserving Hashing in Multidimensional Spaces.
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Information Retrieval Algorithms: A Survey.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Nonholonomic path planning for pushing a disk among obstacles.
Proceedings of the 1997 IEEE International Conference on Robotics and Automation, 1997

Storage Management for Evolving Databases.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

Randomized Algorithms.
Proceedings of the Computer Science and Engineering Handbook, 1997

1996
A Theory of Wormhole Routing in Parallel Computers.
IEEE Trans. Computers, 1996

Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata.
Inf. Comput., 1996

Randomized Algorithms.
ACM Comput. Surv., 1996

Adversarial Queueing Theory.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

A Linear Method for Deviation Detection in Large Databases.
Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96), 1996

Combinatorial and Experimental Results for Randomized Point Matching Algorithms.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Computational Geometry Impact Potential: A Business and Industrial Perspective.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995
Randomized Algorithms.
SIGACT News, 1995

Robust Algorithms for Packet Routing in a Mesh.
Mathematical Systems Theory, 1995

Competitive Paging with Locality of Reference.
J. Comput. Syst. Sci., 1995

The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height.
Inf. Process. Lett., 1995

Stochastic contention resolution with short delays.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Randomized query processing in robot path planning (Extended Abstract).
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Motion planning for a steering-constrained robot through moderate obstacles.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Randomized Algorithms.
Cambridge University Press, ISBN: 0-521-47465-5, 1995

1994
Computing with Noisy Information.
SIAM J. Comput., 1994

Trading Space for Time in Undirected s-t Connectivity.
SIAM J. Comput., 1994

Memory versus randomization in on-line algorithms.
IBM Journal of Research and Development, 1994

On the minimum latency problem.
CoRR, 1994

Guest Editor's Foreword: Special Issue on On-Line Algorithms.
Algorithmica, 1994

Efficient routing in all-optical networks.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

The minimum latency problem.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Randomized Approximation Algorithms in Combinatorial Optimization.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

Motion Planning on a Graph (Extended Abstract)
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993
Randomized Algorithms and Pseudorandom Numbers.
J. ACM, 1993

Random Walks on Weighted Graphs and Applications to On-line Algorithms.
J. ACM, 1993

How much can hardware help routing?
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Fast Deflection Routing for Packets and Worms (Extended Summary).
Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

1992
Fast Geometric Approximation Techniques and Geometric Embedding Problems.
Theor. Comput. Sci., 1992

Optimal Time Bounds for Some Proximity Problems in the Plane.
Inf. Process. Lett., 1992

Integer Programming in VLSI Design.
Discrete Applied Mathematics, 1992

The Robot Localization Problem in Two Dimensions.
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

An Experimental Study of Wormhole Routing in Parallel Computers.
Proceedings of the Parallel Architectures and Their Efficient Use, 1992

Markov Paging (Extended Abstract)
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

A Theory of Wormhole Routing in Parallel Computers (Extended Abstract)
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

Exact Analysis of Hot-Potato Routing (Extended Abstract)
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991
Deferred Data Structure for the Nearest Neighbor Problem.
Inf. Process. Lett., 1991

Multiterminal Global Routing: A Deterministic Approximation Scheme.
Algorithmica, 1991

Competitive Paging with Locality of Reference (Preliminary Version)
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Navigating in Unfamiliar Geometric Terrain (Preliminary Version)
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

On the Parallel Complexity of Evaluating Game Trees.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

A Statistical Adversary for On-line Algorithms.
Proceedings of the On-Line Algorithms, 1991

Competitive Paging with Locality of Reference (Brief Summary).
Proceedings of the On-Line Algorithms, 1991

Navigating in Unfamiliar Geometric Terrain (Extended Summary).
Proceedings of the On-Line Algorithms, 1991

1990
Randomized Broadcast in Networks.
Random Struct. Algorithms, 1990

Computing with Unreliable Information (Preliminary Version)
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Random Walks on Weighted Graphs, and Applications to On-line Algorithms (Preliminary Version)
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Randomized Broadcast in Networks.
Proceedings of the Algorithms, 1990

Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

Time-Space Tradeoffs for Undirected Graph Traversal
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989
Parallel Graph Algorithms That Are Efficient on Average
Inf. Comput., June, 1989

The Electrical Resistance of a Graph Captures its Commute and Cover Times (Detailed Abstract)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Trading Space for Time in Undirected s-t Connectivity
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Robust Algorithms for Packet Routing in a Mesh.
SPAA, 1989

Program Correctness: Can One Test For It?
IFIP Congress, 1989

Memory Versus Randomization in On-line Algorithms (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

Fast Geometric Approximation Techniques and Geometric Embedding Problems.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988
Deferred Data Structuring.
SIAM J. Comput., 1988

Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs.
J. Comput. Syst. Sci., 1988

Randomized Algorithms and Pseudorandom Numbers
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Energy Consumption in VLSI Circuits (Preliminary Version)
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

1987
Randomized rounding: a technique for provably good algorithms and algorithmic proofs.
Combinatorica, 1987

Parallel Graph Algorithms that Are Efficient on Average
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986
Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

A language for describing rectilinear Steiner tree configurations.
Proceedings of the 23rd ACM/IEEE Design Automation Conference. Las Vegas, 1986

Deferred Data Structuring: Query-Driven Preprocessing for Geometric Search Problems.
Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985
Provably Good Routing in Graphs: Regular Arrays
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985


  Loading...