• 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

Office

RM 514,
Department of Computer Science and Engineering
IIT Kanpur,
Kanpur 208016

Office Phone: 0512-2597174

Email: This email address is being protected from spambots. You need JavaScript enabled to view it.