BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × China
1 × Greece
1 × Italy
1 × Norway
1 × Portugal
10 × USA
2 × Canada
2 × France
Collaborated with:
R.Kumar R.Fagin S.Gollapudi A.Tomkins T.S.Jayram M.Ajtai D.Ravichandran S.Baluja S.Lattanzi ∅ R.V.Guha A.Dasgupta J.Novak U.Mahadevan Z.Bar-Yossef S.Rajagopalan J.Cai A.Nerurkar R.Sundaram R.Seth M.Covell A.Andoni M.Patrascu M.Mahdian E.Vee P.G.Kolaitis S.Dill K.S.McCurley P.Raghavan E.Upfal
Talks about:
similar (5) algorithm (4) effici (4) classif (3) search (3) aggreg (3) graph (3) time (3) rank (3) web (3)

Person: D. Sivakumar

DBLP DBLP: Sivakumar:D=

Contributed to:

KDD 20122012
KDIR 20112011
KDIR 20092009
STOC 20092009
SIGMOD 20082008
PODS 20062006
KDD 20052005
PODS 20052005
VLDB 20052005
CIKM 20042004
KDD 20042004
PODS 20042004
SIGMOD 20032003
STOC 20032003
STOC 20022002
STOC 20012001
VLDB 20012001
PODS 20002000
STOC 19991999

Wrote 21 papers:

KDD-2012-DasguptaKS #social
Social sampling (AD, RK, DS), pp. 235–243.
KDIR-2011-SethCRSB #analysis #query #similarity
A Tale of Two (Similar) Cities — Inferring City Similarity through Geo-spatial Query Log Analysis (RS, MC, DR, DS, SB), pp. 179–189.
KDIR-2009-BalujaRS #classification #graph #performance
Text Classification through Time — Efficient Label Propagation in Time-Based Graphs (SB, DR, DS), pp. 174–182.
STOC-2009-LattanziS #network
Affiliation networks (SL, DS), pp. 427–434.
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.
PODS-2006-GollapudiKS #clustering #programmable
Programmable clustering (SG, RK, DS), pp. 348–354.
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.
CIKM-2004-GollapudiS #algorithm #analysis #framework #set
Framework and algorithms for trend analysis in massive temporal data sets (SG, DS), pp. 168–177.
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.
SIGMOD-2003-FaginKS #classification #performance #rank #similarity
Efficient similarity search and classification via rank aggregation (RF, RK, DS), pp. 301–312.
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-Sivakumar #algorithm #complexity
Algorithmic derandomization via complexity theory (DS), pp. 619–626.
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-CaiNS #probability #theorem
Hardness and Hierarchy Theorems for Probabilistic Quasi-Polynomial Time (JyC, AN, DS), pp. 726–735.
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.