Quick Links
Raghunath Tewari
PhD (University of Nebraska - Lincoln)
Assistant Professor, Department of Computer Science and Engineering
Research Interest
Computational Complexity Theory, Graph Theory.
Office
RM 514,
Department of Computer Science and Engineering
IIT Kanpur,
Kanpur 208016
Specialization
Computational Complexity Theory, Graph Theory.
Education
PhD, University of Nebraska - Lincoln, 2011Thesis Title:Unambiguous Logarithmic Space Bounded ComputationsThesis Supervisor:Dr. Vinodchandran Variyam
M.S., University of Nebraska - Lincoln, 2007
B.Sc., Chennai Mathematical Institute, 2005
Teaching Area
Theoretical Computer Science, Introduction to Programming
Selected Publications
Directed Planar Reachability is in Unambiguous Logspace (with Chris Bourke and N. V. Vinodchandran). ACM Transactions on Computation Theory, 1(1), pages 1-17, 2009.
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs (with Samir Datta, Raghav Kulkarni and N. V. Vinodchandran). Journal of Computer and System Sciences, 78(3), pages 765-779, May 2012.
Green's Theorem and Isolation in Planar Graphs (with N. V. Vinodchandran). Information and Computation, 215, pages 1-7, June 2012.
On the Power of Unambiguity in Logspace (with A. Pavan and N. V. Vinodchandran). Computational Complexity, 21(4), pages 643-670, December 2012.
Improved bounds on Bipartite Matching on surfaces (with Samir Datta, Arjun Gopalan and Raghav Kulkarni). In Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, pages 254- 265, 2012.
Awards & Fellowships
Outstanding Ph.D. Student Award
Outstanding Masters Student Award