معرفی
Deeparnab Chakrabarty is an Associate Professor in the Department of Computer Science at Dartmouth College, specializing in theoretical computer science and algorithms. His research examines computational efficiency boundaries through the lens of mathematical optimization, addressing problems in machine learning, big-data analysis, and algorithmic economics.
He teaches undergraduate courses in Discrete Mathematics and Algorithms, while his research group investigates submodular minimization, clustering algorithms, and property testing. Recent publications feature advances in monotonicity testing, graph connectivity algorithms, and fair clustering methods.
As advisor to PhD candidates and undergraduate researchers, he mentors students in algorithmic theory and applied mathematics. His work has appeared in premier venues including FOCS, STOC, and SODA conferences.
