BibSLEIGH — Ravi

Travelled to:

1 × Australia
1 × Norway
1 × Portugal
1 × The Netherlands
1 × United Kingdom
2 × China
2 × France
2 × Greece
2 × Italy
20 × USA
3 × Canada

Collaborated with:

A.Tomkins D.Sivakumar A.Dasgupta M.Mahdian N.N.Dalvi S.Vassilvitskii R.Rubinfeld R.Fagin F.Chierichetti P.Raghavan A.Anagnostopoulos B.Pang J.Novak T.S.Jayram S.Rajagopalan F.Ergün B.Bahmani E.Upfal T.Sarlós D.Chakrabarti K.Punera R.V.Guha L.Backstrom T.Batu M.Ajtai ∅ R.Jones A.Vattani E.Vee J.Leskovec S.Lattanzi C.Olston M.A.Soliman M.McGlohon J.M.Kleinberg A.Sasturkar S.Gollapudi D.Gibson U.Mahadevan Z.Bar-Yossef M.Fontoura V.Josifovski D.Lokshtanov A.Machanavajjhala V.Rastogi S.Alaei A.Malekian Q.Mei K.L.Klinkner R.Sundaram S.Khot Y.Rabani S.Dasgupta B.Codenotti P.Gemmell A.Epasto V.S.Mirrokni B.Moseley A.Andoni M.Patrascu B.Reed U.Srivastava T.Bompada C.Chang J.Chen R.Shenoy D.Gruhl M.Charikar S.Kannan M.Viswanathan M.Mitzenmacher A.Panconesi P.G.Kolaitis S.Dill K.S.McCurley A.Tuzhilin C.Faloutsos D.Jensen G.Kossinets R.Ramakrishnan P.Bohannon S.Keerthi S.Merugu A.Z.Broder R.Motwani S.U.Nabar R.Panigrahy Y.Xu

Talks about:

web (9) social (7) network (6) algorithm (5) search (5) approxim (4) similar (4) cluster (4) effici (4) graph (4)

Person: Ravi Kumar

DBLP: Kumar:Ravi

Contributed to:

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1999

1998

1997

Wrote 61 papers:

KDD-2015-ChierichettiEKL #algorithm #network #performance #social: Efficient Algorithms for Public-Private Social Networks (FC, AE, RK, SL, VSM), pp. 139–148.
KDD-2014-ChierichettiDK #clustering #correlation #pipes and filters: Correlation clustering in MapReduce (FC, NND, RK), pp. 641–650.
ICML-c1-2013-KumarLVV #bound: Near-Optimal Bounds for Cross-Validation via Loss Stability (RK, DL, SV, AV), pp. 27–35.
KDD-2012-BahmaniKMU #evolution #graph #rank: PageRank on an evolving graph (BB, RK, MM, EU), pp. 24–32.
KDD-2012-DasguptaKS #social: Social sampling (AD, RK, DS), pp. 235–243.
VLDB-2012-BahmaniKV #pipes and filters #streaming: Densest Subgraph in Streaming and MapReduce (BB, RK, SV), pp. 454–465.
VLDB-2012-BahmaniMVKV #scalability: Scalable K-Means++ (BB, BM, AV, RK, SV), pp. 622–633.
KDD-2011-DalviKMR #nearest neighbour #using: Sampling hidden objects using nearest-neighbor oracles (NND, RK, AM, VR), pp. 1325–1333.
KDD-2011-DasguptaKS #performance: Fast locality-sensitive hashing (AD, RK, TS), pp. 1073–1081.
VLDB-2011-DalviKS #automation #scalability #web: Automatic Wrappers for Large Scale Web Extraction (NND, RK, MAS), pp. 219–230.
KDD-2010-AlaeiKMV #representation: Balanced allocation with succinct representation (SA, RK, AM, EV), pp. 523–532.
KDD-2010-KumarMM: Dynamics of conversations (RK, MM, MM), pp. 553–562.
STOC-2010-DasguptaKS: A sparse Johnson: Lindenstrauss transform (AD, RK, TS), pp. 341–350.
CIKM-2009-DalviKPT: A translation model for matching reviews to objects (NND, RK, BP, AT), pp. 167–176.
CIKM-2009-MeiKKT #analysis #framework #sequence: An analysis framework for search sequences (QM, KLK, RK, AT), pp. 1991–1994.
ICALP-v2-2009-AnagnostopoulosKMU #how: Sort Me If You Can: How to Sort Dynamic Data (AA, RK, MM, EU), pp. 339–350.
KDD-2009-BackstromKK #optimisation #problem #scheduling #web: Optimizing web traffic via the media scheduling problem (LB, JMK, RK), pp. 89–98.
KDD-2009-ChierichettiKLMPR #network #on the #social: On compressing social networks (FC, RK, SL, MM, AP, PR), pp. 219–228.
KDD-2009-Kumar #challenge #mining #web: Mining web logs: applications and challenges (RK), pp. 3–4.
PODS-2009-ChierichettiKV #similarity: Similarity caching (FC, RK, SV), pp. 127–136.
PODS-2009-DalviKPRTBKM #concept #web: A web of concepts (NND, RK, BP, RR, AT, PB, SK, SM), pp. 1–12.
CIKM-2008-JonesKPT #privacy: Vanity fair: privacy in querylog bundles (RJ, RK, BP, AT), pp. 853–862.
KDD-2008-AnagnostopoulosKM #correlation #network #social: Influence and correlation in social networks (AA, RK, MM), pp. 7–15.
KDD-2008-ChakrabartiKP #generative #web: Generating succinct titles for web URLs (DC, RK, KP), pp. 79–87.
KDD-2008-DasguptaKS: De-duping URLs via rewrite rules (AD, RK, AS), pp. 186–194.
KDD-2008-KumarTFJKLT #network #social: Social networks: looking ahead (RK, AT, CF, DJ, GK, JL, AT), p. 1060.
KDD-2008-LeskovecBKT #evolution #network #social: Microscopic evolution of social networks (JL, LB, RK, AT), pp. 462–470.
PODS-2008-AnagnostopoulosDK #algorithm #approximate #clustering: Approximation algorithms for co-clustering (AA, AD, RK), pp. 201–210.
SIGMOD-2008-AndoniFKPS #classification #performance #rank #similarity: Corrigendum to “efficient similarity search and classification via rank aggregation” by Ronald Fagin, Ravi Kumar and D. Sivakumar (proc. SIGMOD’03) (AA, RF, RK, MP, DS), pp. 1375–1376.
SIGMOD-2008-OlstonRSKT: Pig latin: a not-so-foreign language for data processing (CO, BR, US, RK, AT), pp. 1099–1110.
VLDB-2008-FontouraJKOTV #taxonomy #using: Relaxation in text search using taxonomies (MF, VJ, RK, CO, AT, SV), pp. 672–683.
CIKM-2007-JonesKPT #privacy #query #quote #what: “I know what you did last summer”: query logs and user privacy (RJ, RK, BP, AT), pp. 909–914.
SIGIR-2007-BompadaCCKS #metric #on the #robust: On the robustness of relevance measures with incomplete judgments (TB, CCC, JC, RK, RS), pp. 359–366.
CIKM-2006-BroderFJKMNPTX #corpus #query: Estimating corpus size via queries (AZB, MF, VJ, RK, RM, SUN, RP, AT, YX), pp. 594–603.
KDD-2006-ChakrabartiKT #clustering: Evolutionary clustering (DC, RK, AT), pp. 554–560.
KDD-2006-KumarNT #evolution #network #online #social: Structure and evolution of online social networks (RK, JN, AT), pp. 611–617.
KDD-2006-KumarPT #segmentation #topic: Hierarchical topic segmentation of websites (RK, KP, AT), pp. 257–266.
PODS-2006-GollapudiKS #clustering #programmable: Programmable clustering (SG, RK, DS), pp. 348–354.
KDD-2005-DasguptaKRT #semantics: Variable latent semantic indexing (AD, RK, PR, AT), pp. 13–21.
KDD-2005-GruhlGKNT #online #power of #predict: The predictive power of online chatter (DG, RVG, RK, JN, AT), pp. 78–87.
KDD-2005-GuhaKSS #documentation #weaving #web: Unweaving a web of documents (RVG, RK, DS, RS), pp. 574–579.
PODS-2005-FaginGKNST #database #multi: Multi-structural databases (RF, RVG, RK, JN, DS, AT), pp. 184–195.
VLDB-2005-FaginKKNST #database #implementation #multi #performance #scalability: Efficient Implementation of Large-Scale Multi-Structural Databases (RF, PGK, RK, JN, DS, AT), pp. 958–969.
VLDB-2005-GibsonKT #graph #scalability: Discovering Large Dense Subgraphs in Massive Graphs (DG, RK, AT), pp. 721–732.
KDD-2004-KumarMS #approach #graph: A graph-theoretic approach to extract storylines from search results (RK, UM, DS), pp. 216–225.
PODS-2004-FaginKSMV #ranking: Comparing and Aggregating Rankings with Ties (RF, RK, MM, DS, EV), pp. 47–58.
STOC-2004-BatuKR #algorithm #sublinear #testing: Sublinear algorithms for testing monotone and unimodal distributions (TB, RK, RR), pp. 381–390.
SIGMOD-2003-FaginKS #classification #performance #rank #similarity: Efficient similarity search and classification via rank aggregation (RF, RK, DS), pp. 301–312.
STOC-2003-JayramKKR #bound #problem: Cell-probe lower bounds for the partial match problem (TSJ, SK, RK, YR), pp. 667–672.
STOC-2003-JayramKS #complexity: Two applications of information complexity (TSJ, RK, DS), pp. 673–682.
STOC-2002-AjtaiJKS #approximate #data type: Approximate counting of inversions in a data stream (MA, TSJ, RK, DS), pp. 370–379.
STOC-2002-BatuDKR #approximate #complexity: The complexity of approximating entropy (TB, SD, RK, RR), pp. 678–687.
STOC-2001-AjtaiKS #algorithm #problem: A sieve algorithm for the shortest lattice vector problem (MA, RK, DS), pp. 601–610.
STOC-2001-Bar-YossefKS #algorithm #bound: Sampling algorithms: lower bounds and applications (ZBY, RK, DS), pp. 266–275.
VLDB-2001-DillKMRST #self #web: Self-similarity in the Web (SD, RK, KSM, SR, DS, AT), pp. 69–78.
PODS-2000-KumarRRSTU #graph #web: The Web as a Graph (RK, PR, SR, DS, AT, EU), pp. 1–10.
STOC-1999-CharikarKRRT #markov #on the: On targeting Markov segments (MC, RK, PR, SR, AT), pp. 99–108.
STOC-1999-ErgunKR #approximate #performance: Fast Approximate PCPs (FE, RK, RR), pp. 41–50.
VLDB-1999-KumarRRT #knowledge base #scalability #web: Extracting Large-Scale Knowledge Bases from the Web (RK, PR, SR, AT), pp. 639–650.
STOC-1998-ErgunKKRV: Spot-Checkers (FE, SK, RK, RR, MV), pp. 259–268.
ICALP-1997-CodenottiEGK: Checking Properties of Polynomials (BC, FE, PG, RK), pp. 203–213.