BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × China
1 × France
1 × Greece
1 × Portugal
1 × Spain
1 × United Kingdom
2 × Italy
22 × USA
4 × Canada
Collaborated with:
E.Upfal J.M.Kleinberg R.Kumar A.Tomkins C.H.Papadimitriou R.Agrawal B.Schieber C.D.Thompson M.Snir S.Rajagopalan A.Borodin D.Gibson H.Tamaki A.K.Chandra V.Kakade S.Vempala R.Motwani A.Blum H.J.Karloff M.Sudan D.Coppersmith A.R.Karlin M.Charikar F.Chierichetti A.Panconesi P.K.C.Singitham M.S.Mahabhashyam M.Bawa G.S.Manku P.Drineas I.Kerenidis S.Arora S.Rao A.Arning P.K.Agarwal A.Aggarwal A.P.Ng R.Fagin J.Mao A.Dasgupta J.Gehrke D.Gunopulos P.Indyk S.Chakrabarti B.Dom L.E.Kavraki J.Latombe S.Irani P.Doyle U.Feige D.Peleg A.Z.Broder D.P.Williamson W.L.Ruzzo R.Smolensky P.Tiwari S.Lattanzi M.Mitzenmacher M.Sozio A.Tiberi C.Y.Chung R.Lieu J.Liu A.K.Luk D.Sivakumar V.Guruswami A.Sahai P.Chalasani W.R.Pulleyblank R.Rubinfeld M.Abrol N.Latarche U.Mahadevan R.Mukherjee M.Tourn J.Wang G.Zhang
Talks about:
random (5) web (5) algorithm (4) search (4) graph (4) data (4) segment (3) problem (3) network (3) cluster (3)

Person: Prabhakar Raghavan

DBLP DBLP: Raghavan:Prabhakar

Contributed to:

KDD 20092009
CIKM 20072007
PODS 20072007
STOC 20062006
ECIR 20052005
KDD 20052005
VLDB 20042004
SIGIR 20032003
SIGMOD 20032003
CIKM 20022002
STOC 20022002
VLDB 20012001
PODS 20002000
STOC 20002000
STOC 19991999
VLDB 19991999
HT 19981998
PODS 19981998
SIGMOD 19981998
STOC 19981998
VLDB 19981998
STOC 19971997
VLDB 19971997
KDD 19961996
STOC 19961996
STOC 19951995
STOC 19941994
STOC 19931993
STOC 19911991
STOC 19901990
ICALP 19891989
STOC 19891989
STOC 19881988
DAC 19861986
STOC 19851985

Wrote 46 papers:

KDD-2009-ChierichettiKLMPR #network #on the #social
On compressing social networks (FC, RK, SL, MM, AP, PR), pp. 219–228.
CIKM-2007-Raghavan #information retrieval #modelling #web
Web search: from information retrieval to microeconomic modeling (PR), pp. 1–2.
PODS-2007-ChierichettiPRSTU #clustering
Finding near neighbors through cluster pruning (FC, AP, PR, MS, AT, EU), pp. 103–112.
STOC-2006-Raghavan #algorithm #web
The changing face of web search: algorithms, auctions and advertising (PR), p. 129.
ECIR-2005-KakadeR #encoding #xml
Encoding XML in Vector Spaces (VK, PR), pp. 96–111.
KDD-2005-DasguptaKRT #semantics
Variable latent semantic indexing (AD, RK, PR, AT), pp. 13–21.
KDD-2005-Raghavan #network
Incentive networks (PR), p. 1.
VLDB-2004-SingithamMR #trade-off
Efficiency-Quality Tradeoffs for Vector Score Aggregation (PKCS, MSM, PR), pp. 624–635.
SIGIR-2003-BawaMR #named #segmentation #set #topic
SETS: search enhanced by topic segmentation (MB, GSM, PR), pp. 306–313.
Extracting and Exploiting Structure in Text Search (PR), p. 635.
CIKM-2002-ChungLLLMR #documentation #taxonomy
Thematic mapping — from unstructured documents to taxonomies (CYC, RL, JL, AKL, JM, PR), pp. 608–610.
STOC-2002-DrineasKR #recommendation
Competitive recommendation systems (PD, IK, PR), pp. 82–90.
VLDB-2001-AbrolLMMMRTWZ #navigation #scalability
Navigating large-scale semi-structured data in business portals (MA, NL, UM, JM, RM, PR, MT, JW, GZ), pp. 663–666.
Auditing Boolean Attributes (JMK, CHP, PR), pp. 86–91.
PODS-2000-KumarRRSTU #graph #web
The Web as a Graph (RK, PR, SR, DS, AT, EU), pp. 1–10.
STOC-2000-CharikarFGKRS #query
Query strategies for priced information (MC, RF, VG, JMK, PR, AS), pp. 582–591.
STOC-2000-FaginKKRRRST #random
Random walks with “back buttons” (RF, ARK, JMK, PR, SR, RR, MS, AT), pp. 484–493.
STOC-1999-CharikarKRRT #markov #on the
On targeting Markov segments (MC, RK, PR, SR, AT), pp. 99–108.
VLDB-1999-KumarRRT #knowledge base #scalability #web
Extracting Large-Scale Knowledge Bases from the Web (RK, PR, SR, AT), pp. 639–650.
HT-1998-GibsonKR #community #web
Inferring Web Communities from Link Topology (DG, JMK, PR), pp. 225–234.
PODS-1998-PapadimitriouRTV #analysis #probability #semantics
Latent Semantic Indexing: A Probabilistic Analysis (CHP, PR, HT, SV), pp. 159–168.
SIGMOD-1998-AgrawalGGR #automation #clustering #data mining #mining
Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications (RA, JG, DG, PR), pp. 94–105.
STOC-1998-AroraRR #approximate #problem
Approximation Schemes for Euclidean k-Medians and Related Problems (SA, PR, SR), pp. 106–113.
STOC-1998-KleinbergPR #problem #segmentation
Segmentation Problems (JMK, CHP, PR), pp. 473–482.
VLDB-1998-GibsonKR #approach #category theory #clustering
Clustering Categorical Data: An Approach Based on Dynamical Systems (DG, JMK, PR), pp. 311–322.
STOC-1997-IndykMRV #multi
Locality-Preserving Hashing in Multidimensional Spaces (PI, RM, PR, SV), pp. 618–625.
VLDB-1997-ChakrabartiDAR #database #navigation #taxonomy #using
Using Taxonomy, Discriminants, and Signatures for Navigating in Text Databases (SC, BD, RA, PR), pp. 446–455.
KDD-1996-ArningAR #database #detection #linear #scalability
A Linear Method for Deviation Detection in Large Databases (AA, RA, PR), pp. 164–169.
Adversarial Queueing Theory (AB, JMK, PR, MS, DPW), pp. 376–385.
Motion planning for a steering-constrained robot through moderate obstacles (PKA, PR, HT), pp. 343–352.
STOC-1995-KavrakiLMR #query #random
Randomized query processing in robot path planning (LEK, JCL, RM, PR), pp. 353–362.
STOC-1995-RaghavanU #probability
Stochastic contention resolution with short delays (PR, EU), pp. 229–237.
STOC-1994-BlumCCPRS #latency #problem
The minimum latency problem (AB, PC, DC, WRP, PR, MS), pp. 163–171.
STOC-1994-RaghavanU #network #performance
Efficient routing in all-optical networks (PR, EU), pp. 134–143.
STOC-1993-BorodinRSU #hardware #how #question
How much can hardware help routing? (AB, PR, BS, EU), pp. 573–582.
STOC-1991-BlumRS #geometry #navigation
Navigating in Unfamiliar Geometric Terrain (AB, PR, BS), pp. 494–504.
STOC-1991-BorodinIRS #locality
Competitive Paging with Locality of Reference (AB, SI, PR, BS), pp. 249–259.
STOC-1990-CoppersmithDRS #algorithm #graph #online #random
Random Walks on Weighted Graphs, and Applications to On-line Algorithms (DC, PD, PR, MS), pp. 369–378.
Computing with Unreliable Information (UF, DP, PR, EU), pp. 128–137.
ICALP-1989-RaghavanS #algorithm #memory management #online
Memory Versus Randomization in On-line Algorithms (PR, MS), pp. 687–703.
Trading Space for Time in Undirected s-t Connectivity (AZB, ARK, PR, EU), pp. 543–549.
STOC-1989-ChandraRRST #graph
The Electrical Resistance of a Graph Captures its Commute and Cover Times (AKC, PR, WLR, RS, PT), pp. 574–586.
STOC-1988-AggarwalCR #energy
Energy Consumption in VLSI Circuits (AA, AKC, PR), pp. 205–216.
STOC-1988-KarloffR #algorithm #pseudo #random
Randomized Algorithms and Pseudorandom Numbers (HJK, PR), pp. 310–321.
A language for describing rectilinear Steiner tree configurations (APCN, CDT, PR), pp. 659–662.
STOC-1985-RaghavanT #array #graph
Provably Good Routing in Graphs: Regular Arrays (PR, CDT), pp. 79–87.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.