Sudipto Guha

Affiliations:
  • University of Pennsylvania, Philadelphia, PA, USA


According to our database1, Sudipto Guha authored at least 134 papers between 1997 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Correlation Clustering in Data Streams.
Algorithmica, 2021

2019
Distributed Partial Clustering.
ACM Trans. Parallel Comput., 2019

2018
Access to Data and Number of Iterations: Dual Primal Algorithms for Maximum Matching under Resource Constraints.
ACM Trans. Parallel Comput., 2018

SpotLight: Detecting Anomalies in Streaming Graphs.
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

Semi-Supervised Learning on Data Streams via Temporal Label Propagation.
Proceedings of the 35th International Conference on Machine Learning, 2018

Elastic Nonnegative Matrix Factorization.
Proceedings of the 2018 IEEE International Conference on Data Mining Workshops, 2018

Histograms, Wavelets, Streams and Approximation.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2016
Robust Random Cut Forest Based Anomaly Detection on Streams.
Proceedings of the 33nd International Conference on Machine Learning, 2016

Clustering Data Streams.
Proceedings of the Data Stream Management - Processing High-Speed Data Streams, 2016

2015
Behavioral Intervention and Non-Uniform Bootstrap Percolation.
CoRR, 2015

Vertex and Hyperedge Connectivity in Dynamic Graph Streams.
Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

2014
Near Linear Time Approximation Schemes for Uncapacitated and Capacitated b-Matching Problems in Nonbipartite Graphs.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Stochastic Regret Minimization via Thompson Sampling.
Proceedings of The 27th Conference on Learning Theory, 2014

2013
Linear programming in the semi-streaming model with application to the maximum matching problem.
Inf. Comput., 2013

Approximation Algorithms for Bayesian Multi-Armed Bandit Problems.
CoRR, 2013

Approximate Indexability and Bandit Problems with Concave Rewards and Delayed Feedback.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

Spectral Sparsification in Dynamic Graph Streams.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012
Special Issue in Honor of Rajeev Motwani (1962-2009): Guest Editors' Foreword.
Theory Comput., 2012

Adaptive Uncertainty Resolution in Bayesian Combinatorial Optimization Problems.
ACM Trans. Algorithms, 2012

REX: Recursive, Delta-Based Data-Centric Computation.
Proc. VLDB Endow., 2012

Graph Synopses, Sketches, and Streams: A Survey.
Proc. VLDB Endow., 2012

Analyzing graph structure via linear measurements.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Graph sketches: sparsification, spanners, and subgraphs.
Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2012

2011
Laminar Families and Metric Embeddings: Non-bipartite Maximum Matching Problem in the Semi-Streaming Model
CoRR, 2011

Modeling the Parallel Execution of Black-Box Services.
Proceedings of the 3rd USENIX Workshop on Hot Topics in Cloud Computing, 2011

2010
How to probe for an extreme value.
ACM Trans. Algorithms, 2010

SmartCIS: integrating digital and physical environments.
SIGMOD Rec., 2010

Dynamic Join Optimization in Multi-Hop Wireless Sensor Networks.
Proc. VLDB Endow., 2010

Approximation algorithms for restless bandit problems.
J. ACM, 2010

Iterated Allocations with Delayed Feedback
CoRR, 2010

Approximation Schemes for Sequential Posted Pricing in Multi-unit Auctions.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Selective Call Out and Real Time Bidding.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

2009
Sublinear estimation of entropy and information distances.
ACM Trans. Algorithms, 2009

Throughput maximization of real-time scheduling with batching.
ACM Trans. Algorithms, 2009

A Constant Factor Approximation for the Single Sink Edge Installation Problem.
SIAM J. Comput., 2009

Stream Order and Order Statistics: Quantile Estimation in Random-Order Streams.
SIAM J. Comput., 2009

Special Issue On The Thirty-Eighth Annual ACM Symposium On Theory Of Computing (STOC 2006).
SIAM J. Comput., 2009

Improving the Performance of List Intersection.
Proc. VLDB Endow., 2009

Large-scale uncertainty management systems: learning and exploiting your data.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2009

Exceeding expectations and clustering uncertain data.
Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009

Tight results for clustering and summarizing data streams.
Proceedings of the Database Theory, 2009

Multi-armed Bandits with Metric Switching Costs.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

Graph Sparsification in the Semi-streaming Model.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008
Wavelet synopsis for hierarchical range queries with workloads.
VLDB J., 2008

On the space-time of optimal, approximate and streaming algorithms for synopsis construction problems.
VLDB J., 2008

Approximation Algorithms for Wavelet Transform Coding of Data Streams.
IEEE Trans. Inf. Theory, 2008

Learning to create data-integrating queries.
Proc. VLDB Endow., 2008

Sketching information divergences.
Mach. Learn., 2008

Sequential Design of Experiments via Linear Programming
CoRR, 2008

Information Acquisition and Exploitation in Multichannel Wireless Networks
CoRR, 2008

Ad-hoc aggregations of ranked lists in the presence of hierarchies.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008

Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

A substrate for in-network sensor data integration.
Proceedings of the 5th Workshop on Data Management for Sensor Networks, 2008

2007
Histograms, Wavelets, Streams, and Approximation.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

A Note on Linear Time Algorithms for Maximum Error Histograms.
IEEE Trans. Knowl. Data Eng., 2007

Space-Efficient Sampling.
Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics, 2007

Approximation algorithms for budgeted learning problems.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Model-driven optimization using adaptive probes.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Approximation Algorithms for Partial-Information Based Stochastic Control with Markovian Rewards.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

Nonlinear Approximation and Image Representation using Wavelets.
Proceedings of the Web Information Retrieval and Linear Algebra Algorithms, 11.02., 2007

2006
Approximation and streaming algorithms for histogram construction problems.
ACM Trans. Database Syst., 2006

Integrating XML data sources using approximate joins.
ACM Trans. Database Syst., 2006

The Steiner <i>k</i>-Cut Problem.
SIAM J. Discret. Math., 2006

Streaming and sublinear approximation of entropy and information distances.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Optimizing transmission rate in wireless channels using adaptive probes.
Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems, 2006

Approximate quantiles and the order of the stream.
Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006

Asking the right questions: model-driven optimization using probes.
Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006

Reasoning About Approximate Match Query Results.
Proceedings of the 22nd International Conference on Data Engineering, 2006

Jointly optimal transmission and probing strategies for multichannel wireless systems.
Proceedings of the 40th Annual Conference on Information Sciences and Systems, 2006

2005
Improved Combinatorial Algorithms for Facility Location Problems.
SIAM J. Comput., 2005

Asymmetric <i>k</i>-center is log<sup>*</sup> <i>n</i>-hard to approximate.
J. ACM, 2005

How far will you walk to find your shortcut: Space Efficient Synopsis Construction Algorithms
CoRR, 2005

Offline and Data Stream Algorithms for Efficient Computation of Synopsis Structures.
Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30, 2005

Space Efficiency in Synopsis Construction Algorithms.
Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30, 2005

Wavelet synopsis for data streams: minimizing non-euclidean error.
Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2005

2004
REHIST: Relative Error Histogram Construction Algorithms.
Proceedings of the (e)Proceedings of the Thirtieth International Conference on Very Large Data Bases, VLDB 2004, Toronto, Canada, August 31, 2004

XWAVE: Approximate Extended Wavelets for Streaming Data.
Proceedings of the (e)Proceedings of the Thirtieth International Conference on Very Large Data Bases, VLDB 2004, Toronto, Canada, August 31, 2004

Merging the Results of Approximate Match Operations.
Proceedings of the (e)Proceedings of the Thirtieth International Conference on Very Large Data Bases, VLDB 2004, Toronto, Canada, August 31, 2004

Asymmetric k-center is log<sup>*</sup> <i>n</i>-hard to approximate.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Machine Minimization for Scheduling Jobs with Interval Constraints.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

Inferring Mixtures of Markov Chains.
Proceedings of the Learning Theory, 17th Annual Conference on Learning Theory, 2004

2003
Clustering Data Streams: Theory and Practice.
IEEE Trans. Knowl. Data Eng., 2003

A constant factor approximation algorithm for the fault-tolerant facility location problem.
J. Algorithms, 2003

Capacitated vertex covering.
J. Algorithms, 2003

Asymmetric k-center is log<sup>*</sup>n-hard to Approximate
Electron. Colloquium Comput. Complex., 2003

Hierarchical Reliable Multicast: Performance Analysis and Optimal Placement of Proxies.
Comput. Commun., 2003

Efficient Approximation Of Optimization Queries Under Parametric Aggregation Constraints.
Proceedings of 29th International Conference on Very Large Data Bases, 2003

Application of the two-sided depth test to CSG rendering.
Proceedings of the 2003 Symposium on Interactive 3D Graphics, 2003

Correlating synchronous and asynchronous data streams.
Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 24, 2003

Index-Based Approximate XML Joins.
Proceedings of the 19th International Conference on Data Engineering, 2003

Approximating Steiner k-Cuts.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Compression of Partially Ordered Strings.
Proceedings of the CONCUR 2003, 2003

Techniques for Clustering Massive Data Sets.
Proceedings of the Clustering and Information Retrieval, 2003

2002
Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas.
SIAM J. Comput., 2002

A Constant-Factor Approximation Algorithm for the k-Median Problem.
J. Comput. Syst. Sci., 2002

Near-optimal sparse fourier representations via sampling.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Fast, small-space algorithms for approximate histogram maintenance.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Generalized clustering.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Improved algorithms for the data placement problem.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Capacitated vertex covering with applications.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Dynamic multidimensional histograms.
Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, 2002

Approximate XML joins.
Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, 2002

Fast Algorithms For Hierarchical Range Histogram Construction.
Proceedings of the Twenty-first ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2002

Streaming-Data Algorithms for High-Quality Clustering.
Proceedings of the 18th International Conference on Data Engineering, San Jose, CA, USA, February 26, 2002

Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation.
Proceedings of the 18th International Conference on Data Engineering, San Jose, CA, USA, February 26, 2002

Histogramming Data Streams with Fast Per-Item Processing.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001
Approximating the Throughput of Multiple Machines in Real-Time Scheduling.
SIAM J. Comput., 2001

Cure: An Efficient Clustering Algorithm for Large Databases.
Inf. Syst., 2001

A constant factor approximation for the single sink edge installation problems.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Data-streams and histograms.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Improved algorithms for fault tolerant facility location.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000
Approximation algorithms for facility location problems.
PhD thesis, 2000

Message Multicasting in Heterogeneous Networks.
SIAM J. Comput., 2000

ROCK: A Robust Clustering Algorithm for Categorical Attributes.
Inf. Syst., 2000

Improved approximations of crossings in graph drawings.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Clustering Data Streams.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

Hierarchical Placement and Network Design Problems.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

Nested Graph Dissection and Approximation Algorithms.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999
Greedy Strikes Back: Improved Facility Location Algorithms.
J. Algorithms, 1999

Approximation Algorithms for Directed Steiner Problems.
J. Algorithms, 1999

Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets.
Inf. Comput., 1999

Efficient Recovery from Power Outage (Extended Abstract).
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

A Constant-Factor Approximation Algorithm for the <i>k</i>-Median Problem (Extended Abstract).
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Approximating the Throughput of Multiple Machines Under Real-Time Scheduling.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Improved Combinatorial Algorithms for the Facility Location and k-Median Problems.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

1998
Facility Location with Dynamic Distance Functions.
J. Comb. Optim., 1998

Approximation Algorithms for Connected Dominating Sets.
Algorithmica, 1998

Facility Location with Dynamic Distance Function (Extended Abstract).
Proceedings of the Algorithm Theory, 1998

Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and <i>k</i>-Median.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Multicasting in Heterogeneous Networks.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Approximating a Finite Metric by a Small Number of Tree Metrics.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997
Connected facility location problems.
Proceedings of the Network Design: Connectivity and Facilities Location, 1997


  Loading...