Kamesh Munagala is Associate Professor of Computer Science at Duke University, where he has been employed since 2004. He obtained his PhD from Stanford University in 2003 and BTech from IIT Bombay in 1998. He is broadly interested in algorithm design and discrete optimization, particularly in scenarios where inputs are uncertain. His work is both methodological, encompassing approximation and online algorithms and algorithmic game theory, as well as applied to domains such as e-commerce, databases, data analysis, and networks. He is a recipient of the NSF CAREER Award (2008), the Alfred P. Sloan Research Fellowship (2009), and the best paper award at the WWW 2009 conference. He was a Visiting Research Professor at Twitter in 2012, served as the Director of Graduate Studies for the Duke CS department from 2012 to 2015, and currently serves as an Area Editor for PeerJ Computer Science.
- Algorithms and Uncertainty, Fall 2016. Visiting Scientist and Workshop Organizer.