Rahul Santhanam
استاد · Computational Complexity Theory
University of California, Berkeleyمعرفی
Rahul Santhanam is a Professor of Computer Science at the University of Oxford and a Tutorial Fellow at Magdalen College. His research focuses on theoretical computer science, particularly computational complexity theory and its connections to learning, cryptography, logic, and game theory.
- PhD in Computer Science, University of Chicago (2005)
- Postdoctoral research: Simon Fraser University, University of Toronto
- Lecturer at University of Edinburgh (2008), promoted to Reader (2013)
- Joined University of Oxford in 2016
His research spans computational complexity, exact algorithms, fine-grained complexity, and circuit complexity. Key themes include bounded rationality and probabilistic computation.
His publications from 2004–2010 reflect a long-term focus on lower bounds, probabilistic time hierarchies, satisfiability algorithms, and probabilistically checkable proofs (PCPs). Trends include intersections between cryptographic complexity and theoretical foundations.
Scientific awards include the ERC Consolidator Grant ALUnif (2013–2019), supporting work on algorithms and lower bounds.
- Current student:
- Matthew Gray Past students:
- Levente Bodnar
- Thomas Orton
- Ninad Rajgopal
