Rahul Santhanam had his undergraduate education in India, and then received a PhD in Computer Science from the University of Chicago in 2005. After postdoctoral research stints in Vancouver and Toronto, he joined the School of Informatics at the University of Edinburgh, working there as Lecturer (2008-2013), and then as Reader (2013-2015). In Jan 2016, he moved to Oxford as Professor of Computer Science and Tutorial Fellow at Magdalen College.
Professor Santhanam mainly gives tutorials in theoretical computer science in college.
Professor Santhanam’s primary research interests are in algorithms and complexity theory.
(1) “Fighting Perebor: New and Improved Algorithms for Formula and QBF Satisfiability”, in Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science, pp 183–192, 2010.
(2) “Infeasibility of Instance Compression and Succinct PCPs for NP”
(with Lance Fortnow), in Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp 133–142, 2008.
(3) “Circuit Lower Bounds for Merlin-Arthur Classes”, in Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pp 275–283, 2007.
(4) “Hierarchy Theorems for Probabilistic Polynomial Time” (with Lance Fortnow), in Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp 316–324, 2004.