Raghavan, Prabhakar.
Prabhakar Raghavan Senior Vice President at Google
Prabhakar Raghavan
Raghavan, Prabhakar, 1949-....
![Sudoc [ABES], France](/viaf/images/flags/SUDOC.png "Sudoc [ABES], France")
VIAF ID: 41077677 (Personal)
Permalink: http://viaf.org/viaf/41077677
Preferred Forms
-
100 0 _
‡a
Prabhakar Raghavan
-
100 0 _
‡a
Prabhakar Raghavan
‡c
Senior Vice President at Google
-
200 _ |
‡a
Raghavan
‡b
Prabhakar
-
100 1 _
‡a
Raghavan, Prabhakar
-
100 1 _ ‡a Raghavan, Prabhakar
-
100 1 _ ‡a Raghavan, Prabhakar
-
100 1 _ ‡a Raghavan, Prabhakar
-
100 1 _ ‡a Raghavan, Prabhakar
-
100 1 _ ‡a Raghavan, Prabhakar
-
100 1 _
‡a
Raghavan, Prabhakar
-
100 1 0
‡a
Raghavan, Prabhakar
-
100 1 _
‡a
Raghavan, Prabhakar,
‡d
1949-....
-
100 1 _ ‡a Raghavan, Prabhakar.
4xx's: Alternate Name Forms (10)
5xx's: Related Names (1)
Works
| Title | Sources |
|---|---|
| Adversarial queuing theory |
|
| An algorithmic treatment of strong queries |
|
| Are web users really Markovian? |
|
| Auditing Boolean attributes |
|
| Automatic Subspace Clustering of High Dimensional Data |
|
| Building low-diameter peer-to-peer networks |
|
| The Changing Face of Web Search |
|
| Chapter 2: Next Generation Web Search |
|
| Compressed web indexes |
|
| Core algorithms in the CLEVER system |
|
| Deferred data structure for the nearest neighbor problem |
|
| A deterministic (2−2/(k+1))n algorithm for k-SAT based on local search |
|
| Dynamic schemes for speculative execution of code |
|
| Editorial |
|
| Finding near neighbors through cluster pruning |
|
| Guest editor's foreword |
|
| Incentive Networks |
|
| Introduction to information retrieval |
|
| Joho kensaku no kiso. |
|
| Markov Layout |
|
| 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 |
|
| n94109145 |
|
| On compressing social networks |
|
| Optimizing two-dimensional search results presentation |
|
| Query Strategies for Priced Information |
|
| Randomized algorithms |
|
| Recommendation Systems: A Probabilistic Analysis |
|
| Robust algorithms for packet routing in a mesh |
|
| Scoring, term weighting, and the vector space model |
|
| 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 |
|
| A theory of wormhole routing in parallel computers |
|
| 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 |
|
| The worst-case running time of the random simplex algorithm is exponential in the height |
|
| সম্পাদকীয় |
|
| 情報検索の基礎 |
|
