त्वरित संपर्क
राघुनाथ तिवारी
PhD (University of Nebraska - Lincoln)
Associate Professor, Department of Computer Science and Engineering
शोध करना दिलचस्पी
Computational Complexity Theory, Graph Theory.
Office
RM 514,
Department of Computer Science and Engineering
IIT Kanpur,
Kanpur 208016
विशेषज्ञता
Computational Complexity Theory, Graph Theory.
शिक्षा
PhD, University of Nebraska - Lincoln, 2011
Thesis Title:Unambiguous Logarithmic Space Bounded Computations
Thesis Supervisor:Dr. Vinodchandran Variyam
M.S., University of Nebraska - Lincoln, 2007
B.Sc., Chennai Mathematical Institute, 2005
शिक्षण क्षेत्र
Theoretical Computer Science, Introduction to Programming
चयनित प्रकाशन
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.
पुरस्कार एवं फैलोशिप
Outstanding Ph.D. Student Award
Outstanding Masters Student Award