معرفی
Amit Chakrabarti is a Professor in the Department of Computer Science at Dartmouth College, part of the School of Arts and Sciences. He holds a B.Tech. from IIT Bombay and a Ph.D. from Princeton University. His research focuses on theoretical computer science, emphasizing computational complexity, data stream algorithms, and approximation algorithms. He has contributed to foundational work in communication complexity, lower bounds, and graph algorithms.
Chakrabarti has received prestigious awards including the NSF CAREER Award and the Karen E. Wetterhahn Award. He has organized workshops such as the Banff Communication Complexity and Applications conference and contributed to the IHP thematic program in Paris. He teaches courses like Data Stream Algorithms and Computational Complexity, and has advised numerous graduate and undergraduate students.
His current research explores connections between information theory and complexity, memory-efficient graph algorithms, and algebraic techniques in computational complexity. Chakrabarti has served on committees for major conferences (e.g., FOCS, SODA) and editorial roles for Information Processing Letters.
