BibSLEIGH — Sudipto

Travelled to:

1 × Australia
1 × France
1 × Germany
1 × Iceland
1 × Norway
1 × Poland
1 × Spain
1 × Switzerland
1 × The Netherlands
14 × USA
3 × Canada
3 × Greece

Collaborated with:

A.McGregor N.Koudas K.Munagala K.Shim K.J.Ahn J.Naor B.Schieber D.Srivastava Z.G.Ives P.Indyk S.R.Mihaylov S.Muthukrishnan M.Strauss A.Goel C.Chekuri M.Jacob D.Gunopulos Z.Huang B.Harb ∅ A.Bar-Noy M.Charikar A.C.Gilbert D.Tench S.Babu D.Tsirogiannis N.Bansal C.Kim J.Woo A.Meyerson G.Even R.Rastogi A.Marathe N.Thaper É.Tardos D.B.Shmoys A.Moss G.Cormode A.Wirth M.Vlachos H.V.Jagadish T.Yu J.Chuzhoy E.Halperin S.Khanna G.Kortsarz Y.Kotidis M.Liu Z.Bao B.T.Loo P.P.Talukdar M.S.Mehmood K.Crammer F.C.N.Pereira

Talks about:

stream (15) approxim (14) data (11) algorithm (9) histogram (6) effici (5) graph (5) problem (4) optim (4) multi (4)

Person: Sudipto Guha

DBLP: Guha:Sudipto

Contributed to:

2015

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1999

1998

Wrote 46 papers:

ICML-2015-AhnCGMW #clustering #correlation #data type: Correlation Clustering in Data Streams (KJA, GC, SG, AM, AW), pp. 2237–2246.
PODS-2015-GuhaMT #graph: Vertex and Hyperedge Connectivity in Dynamic Graph Streams (SG, AM, DT), pp. 241–247.
PODS-2012-AhnGM #graph #sketching: Graph sketches: sparsification, spanners, and subgraphs (KJA, SG, AM), pp. 5–14.
VLDB-2012-GuhaM #graph #overview #sketching: Graph Synopses, Sketches, and Streams: A Survey (SG, AM), pp. 2030–2031.
VLDB-2012-MihaylovIG #named #recursion: REX: Recursive, Delta-Based Data-Centric Computation (SRM, ZGI, SG), pp. 1280–1291.
ICALP-v2-2011-AhnG #linear #problem #programming: Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem (KJA, SG), pp. 526–538.
VLDB-2010-MihaylovJIG #multi #network #optimisation: Dynamic Join Optimization in Multi-Hop Wireless Sensor Networks (SRM, MJ, ZGI, SG), pp. 1279–1290.
ICALP-v1-2009-GuhaH #bound #order #random #theorem: Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams (SG, ZH), pp. 513–524.
ICALP-v2-2009-AhnG #graph: Graph Sparsification in the Semi-streaming Model (KJA, SG), pp. 328–338.
ICALP-v2-2009-GuhaM #metric #multi: Multi-armed Bandits with Metric Switching Costs (SG, KM), pp. 496–507.
PODS-2009-GuhaM #clustering #nondeterminism: Exceeding expectations and clustering uncertain data (SG, KM), pp. 269–278.
SIGMOD-2009-BabuGM #learning #nondeterminism #scalability: Large-scale uncertainty management systems: learning and exploiting your data (SB, SG, KM), pp. 995–998.
SIGMOD-2009-LiuMBJILG #named #physics: SmartCIS: integrating digital and physical environments (ML, SRM, ZB, MJ, ZGI, BTL, SG), pp. 1111–1114.
VLDB-2009-TsirogiannisGK #performance: Improving the Performance of List Intersection (DT, SG, NK), pp. 838–849.
ICALP-A-2008-GuhaM #bound #multi: Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination (SG, AM), pp. 760–772.
SIGMOD-2008-BansalGK #ad hoc: Ad-hoc aggregations of ranked lists in the presence of hierarchies (NB, SG, NK), pp. 67–78.
VLDB-2008-TalukdarJMCIPG #learning #query: Learning to create data-integrating queries (PPT, MJ, MSM, KC, ZGI, FCNP, SG), pp. 785–796.
ICALP-2007-GuhaM #bound #estimation #multi #streaming: Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming (SG, AM), pp. 704–715.
STOC-2007-GuhaM #algorithm #approximate #learning #problem: Approximation algorithms for budgeted learning problems (SG, KM), pp. 104–113.
PODS-2006-GoelGM #modelling #optimisation #using: Asking the right questions: model-driven optimization using probes (AG, SG, KM), pp. 203–212.
PODS-2006-GuhaM #approximate #order: Approximate quantiles and the order of the stream (SG, AM), pp. 273–279.
KDD-2005-GuhaH #data type #fault: Wavelet synopsis for data streams: minimizing non-euclidean error (SG, BH), pp. 88–97.
VLDB-2005-Guha #algorithm #performance: Space Efficiency in Synopsis Construction Algorithms (SG), pp. 409–420.
VLDB-2005-GuhaS #algorithm #data type #performance: Offline and Data Stream Algorithms for Efficient Computation of Synopsis Structures (SG, KS), p. 1364.
STOC-2004-ChuzhoyGHKKN #approximate #symmetry: Asymmetric k-center is log* n-hard to approximate (JC, SG, EH, SK, GK, JN), pp. 21–27.
VLDB-2004-GuhaKMS #approximate: Merging the Results of Approximate Match Operations (SG, NK, AM, DS), pp. 636–647.
VLDB-2004-GuhaKS #approximate #named #streaming: XWAVE: Approximate Extended Wavelets for Streaming Data (SG, CK, KS), pp. 288–299.
VLDB-2004-GuhaSW #algorithm #fault #named: REHIST: Relative Error Histogram Construction Algorithms (SG, KS, JW), pp. 300–311.
ICALP-2003-ChekuriGN #approximate: Approximating Steiner k-Cuts (CC, SG, JN), pp. 189–199.
KDD-2003-GuhaGK #correlation #data type: Correlating synchronous and asynchronous data streams (SG, DG, NK), pp. 529–534.
VLDB-2003-KoudasGGSV #approximate #constraints #optimisation #parametricity #performance #query: Efficient Approximation Of Optimization Queries Under Parametric Aggregation Constraints (SG, DG, NK, DS, MV), pp. 778–789.
ICALP-2002-GuhaIMS #data type #performance: Histogramming Data Streams with Fast Per-Item Processing (SG, PI, SM, MS), pp. 681–692.
PODS-2002-GuhaKS #algorithm #performance: Fast Algorithms For Hierarchical Range Histogram Construction (SG, NK, DS), pp. 180–187.
SIGMOD-2002-GuhaJKSY #approximate #xml: Approximate XML joins (SG, HVJ, NK, DS, TY), pp. 287–298.
SIGMOD-2002-ThaperGIK #multi: Dynamic multidimensional histograms (NT, SG, PI, NK), pp. 428–439.
STOC-2002-GilbertGIKMS #algorithm #approximate #maintenance #performance: Fast, small-space algorithms for approximate histogram maintenance (ACG, SG, PI, YK, SM, MS), pp. 389–398.
STOC-2002-GilbertGIMS #fourier: Near-optimal sparse fourier representations via sampling (ACG, SG, PI, SM, MS), pp. 152–161.
STOC-2001-GuhaKS: Data-streams and histograms (SG, NK, KS), pp. 471–475.
STOC-2001-GuhaMM #approximate #constant #problem: A constant factor approximation for the single sink edge installation problems (SG, AM, KM), pp. 383–388.
STOC-2000-EvenGS #approximate #graph: Improved approximations of crossings in graph drawings (GE, SG, BS), pp. 296–305.
STOC-1999-Bar-NoyGNS #approximate #multi #realtime #scheduling #throughput: Approximating the Throughput of Multiple Machines Under Real-Time Scheduling (ABN, SG, JN, BS), pp. 622–631.
STOC-1999-CharikarGTS #algorithm #approximate #problem: A Constant-Factor Approximation Algorithm for the k-Median Problem (MC, SG, ÉT, DBS), pp. 1–10.
STOC-1999-GuhaMNS #performance: Efficient Recovery from Power Outage (SG, AM, JN, BS), pp. 574–582.
SIGMOD-1998-GuhaRS #algorithm #clustering #database #named #performance #scalability: CURE: An Efficient Clustering Algorithm for Large Databases (SG, RR, KS), pp. 73–84.
STOC-1998-Bar-NoyGNS #multi #network: Multicasting in Heterogeneous Networks (ABN, SG, JN, BS), pp. 448–453.
STOC-1998-CharikarCGG #algorithm #approximate: Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and k-Median (MC, CC, AG, SG), pp. 114–123.