Debmalya Panigrahi
About
I am a Professor of Computer Science at Duke University, where I currently also serve as Associate Chair. Previously, I (briefly) worked at Microsoft Research and Bell Labs, and was a visitor at Google Research and the Simons Institute for Theory of Computing. I obtained my PhD in theoretical computer science at the Massachusetts Institute of Technology under the supervision of Prof. David Karger by defending this. Prior to that, I studied at the Indian Institute of Science (advised by Prof. Ramesh Hariharan) and at Jadavpur University. A long time ago, I grew up in the industrial town of Durgapur where I went to St. Xavier's School.
Research Performance Summary
First Recorded Paper
An O (mn) Gomory-Hu tree construction algorithm for unweighted graphs
Year: 2007
Citations: 105
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Latest Recorded Paper
Nearly Tight Bounds for the Online Sorting Problem
Year: 2026
Citations: 0
Venue: Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms
Last 10 Years Publication Activity
This timeline shows the professor's yearly publication activity.