Sudipto Guha
Associate Professor
Computer and Information Science (CIS)
Honors and Awards: NSF CAREER Award - 2007, Alfred P. Sloan Faculty Research Fellow - 2004
Research Expertise: Algorithms and Complexity
Sudipto studies the design and implementation of a wide range of computational systems, from resource constrained devices, such as sensors, up through massively parallel and distributed systems. Using an algorithmic framework, Sudipto seeks to design systems that are correct, efficient, and optimized, despite their bidirectional asymptotic scale and seeming lack of similarity to human information processes. Sudipto's recent work focuses on clustering and location theory, statistics and learning theory, database query optimization and mining, approximation algorithms for stochastic control, communication complexity and data stream algorithms.
Member of:
- Linear programming in the semi-streaming model with application to the maximum matching problem, Ahn, K.J. | Guha, S., Information and Computation, 2013
- Graph synopses, sketches, and streams: A survey, Guha, S. | McGregor, A., Proceedings of the VLDB Endowment, 2012
- Rex: Recursive, deltabased datacentric computation, Mihaylov, S.R. | Ives, Z.G. | Guha, S., Proceedings of the VLDB Endowment, 2012
- Graph sketches: Sparsification, spanners, and subgraphs, Ahn, K.J. | Guha, S. | McGregor, A., Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2012
- Analyzing graph structure via linear measurements, Ahn, K.J. | Guha, S. | McGregor, A., Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2012


