Madhur received a B. Tech. in Computer Science and Engineering from IIT Kanpur in 2005 and a Ph. D. in Computer Science from UC Berkeley in 2009. He spent two years as a postdoc at the Institute for Advanced Study and Princeton University, before joining TTIC in 2011.
Madhur’s interests include complexity theory, approximation algorithms, hardness of approximation and pseudorandomness. His dissertation focussed on studying the effectiveness and limitations of various convex relaxations in approximating combinatorial optimization problems. His work focussed on studying various hierarchies of linear and semidefinite programs, and understanding their usefulness for designing approximation algorithms. Madhur has also worked on understanding the notions of pseudorandomness in computer science and arithmetic combinatorics. He explored connections between different proof techniques used in the two areas.
Dr. Tulsiani also has a personally maintained website which can be found at http://www.ttic.edu/tulsiani.