Madhur Tulsiani

Madhur Tulsiani is a Professor at the University of Chicago's Department of Computer Science and a researcher at the Toyota Technological Institute at Chicago (TTIC). His research focuses on theoretical computer science, particularly complexity theory and algorithm design, with applications in coding theory and information theory. He has been supported by NSF grants 1254044, 1816372, and 2326685.

Education:

• Bachelor’s in Computer Science, IIT Kanpur (2001-2005)
• Ph.D. in Computer Science, UC Berkeley (2005-2009), advised by Luca Trevisan
• Postdoctoral fellowships at the Institute for Advanced Study (IAS) and Princeton University

Research Interests:

• Mathematical foundations of computation
• Complexity theory and algorithm design
• Coding theory and error-correcting codes
• Sum-of-Squares hierarchies and approximation algorithms

Recent Contributions:

• Pioneering work on list decodable codes and expander-based constructions
• Advances in approximation algorithms for high-dimensional expanders
• Lower bounds for Sum-of-Squares algorithms using high-dimensional expanders

Teaching:

• Information and Coding Theory
• Mathematical Toolkit (linear algebra/probability)
• Summer REU programs in theoretical computer science

Students:

• Advised PhD students including Fernando Granha Jeronimo, Goutham Rajendran, and Shashank Srivastava
• Co-advised students with Sasha Razborov, Janos Simon, and others

Labs/Groups: Member of the Theoretical Computer Science Group at TTIC and UChicago, contributing to cross-disciplinary research in algorithms and complexity.