Search filters

List of works by Prabhakar Raghavan

A deterministic (2−2/(k+1))n algorithm for k-SAT based on local search

A microeconomic view of data mining

article published in 1998

A theory of wormhole routing in parallel computers

Adversarial queuing theory

article published in 2001

An algorithmic treatment of strong queries

Are web users really Markovian?

Auditing Boolean attributes

article published in 2003

Automatic Subspace Clustering of High Dimensional Data

article by Rakesh Agrawal et al published July 2005 in Data Mining and Knowledge Discovery

Building low-diameter peer-to-peer networks

Chapter 2: Next Generation Web Search

Compressed web indexes

Core algorithms in the CLEVER system

scholarly article by Ravi Kumar et al published 1 May 2006 in ACM Transactions on Internet Technology

Deferred data structure for the nearest neighbor problem

Dynamic schemes for speculative execution of code

Editorial

Finding near neighbors through cluster pruning

Geographic routing in social networks

scientific article

Graph structure in the Web

Graph structure in the web ⬇️

scholarly article

Guest Editors’ Introduction

Guest editor's foreword

Incentive Networks

Introduction to Information Retrieval

book edition from 2008

Latent Semantic Indexing: A Probabilistic Analysis

article

Locality-preserving hashing in multidimensional spaces

Markov Layout

article published in 2011

Mining the Web's link structure

Models for the Compressible Web

More on random walks, electrical networks, and the harmonic -server algorithm

Multidimensional Cube Packing

On compressing social networks

On the Bursty Evolution of Blogspace

Optimizing two-dimensional search results presentation

Query Strategies for Priced Information

Random walks on weighted graphs and applications to on-line algorithms

scholarly article by Don Coppersmith et al published 1 July 1993 in Journal of the ACM

Randomized algorithms

scholarly article by Rajeev Motwani & Prabhakar Raghavan published 1 March 1996 in ACM Computing Surveys

Randomized algorithms and pseudorandom numbers

scholarly article by Howard J. Karloff & Prabhakar Raghavan published 1 July 1993 in Journal of the ACM

Randomized rounding: A technique for provably good algorithms and algorithmic proofs

scientific article (publication date: December 1987)

Recommendation Systems: A Probabilistic Analysis

scholarly article by Ravi Kumar et al published August 2001 in Journal of Computer and System Sciences

Robust algorithms for packet routing in a mesh

scholarly article by Prabhakar Raghavan published January 1995 in Theory of Computing Systems

Scoring, term weighting, and the vector space model

article

Search is dead!

Segmentation problems

Social networks: from the Web to the enterprise

Some results of Christos Papadimitriou on internet structure, network routing, and web information

Storage management for evolving databases

Structure and evolution of blogspace

The Changing Face of Web Search

The Changing Face of Web Search

The worst-case running time of the random simplex algorithm is exponential in the height

article by Andrei Z. Broder et al published October 1995 in Information Processing Letters

Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata

Trawling the Web for emerging cyber-communities

Variable latent semantic indexing

Visualizing tags over time

scholarly article by Micah Dubinko et al published 1 August 2007 in ACM Transactions on the Web

Visualizing tags over time

scholarly article published 2006

Paulina is supported by:

About Paulina

Help