Amit Chakrabarti
Professor
Department of Computer Science
Dartmouth College
United States of America
Biography
Amit Chakrabarti is currently working as Professor of Computer Science at Dartmouth College, USA. He is interested broadly in theoretical computer science: the study and discovery of fundamental computational principles that are mathematical truths, unaffected by changes in computing technology and hardware.
Research Interest
Theory of computation including computational complexity, with an emphasis on lower bounds, Discrete mathematics, Algorithms and data structures, with an emphasis on algorithms for massive data streams, and for combinatorial optimization.
Publications
-
A. Chakrabarti and O. Regev. “An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distanceâ€, SIAM J. Comput., 41:5 (2012) 1299-1317.
-
A. Chakrabarti, L. K. Fleischer, C. Weibel. “When the Cut Condition is Enough: A Complete Characterization for Multiflow Problems in Series-Parallel Networks,†in Proc. 44th Ann. ACM Symp. Theory Comput. (STOC 2012) 19-26.
-
A. Chakrabarti, G. Cormode, A. McGregor, J. Thaler, and S. Venkatasubramanian. “Verifiable Stream Computation and Arthur–Merlin Communication,†(with G. Cormode, A. McGregor, J. Thaler, S. Venkatasubramanian), in Proc. 30th Ann. Conf. Comput. Complexity (CCC 2015).
