I am a doctoral student in the Computer and Information Science Department at the School of Engineering and Applied Science of the University of Pennsylvania since Fall 2006. My doctoral advisor is Prof. Sanjeev Khanna.
Before joining Penn, I completed my undergraduate in Mathematics from Chennai Mathematical Institute, India. Before that, I finished my schooling from my hometown Durgapur in West Bengal, India.
Email: tanmoy AT seas DOT upenn DOT edu, tanmoych1985 AT gmail DOT com
My research interests lie in Theoretical Computer Science. My current area of interest is, broadly, algorithms and computational complexity.
1. Network Design for Vertex Connectivity (with Julia Chuzhoy and Sanjeev Khanna ): Appeared in the 40th ACM Symposium on Theory of Computation (STOC), 2008.
2. One-input-face MPCVP is Hard for L, but in LogDCFL (with Samir Datta): A shorter version appeared in the Proceedings of the 26th Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS), 2006, pp. 57-68.
3. Grid Graph Reachability Problems (with Eric Allender, David A. Mix Barrington, Samir Datta and Sambuddha Roy): A shorter version appeared in the Proceedings of the 21st Annual IEEE Conference on Computational Complexity (CCC), 2006, pp. 299--313.
1. Generalization of a Result of Erdos : I generalized a result proved by Paul Erdos on sum-free subsets of sets of integers, during an independent study course in May-June, 2004, on Probabilistic Methods under Prof. K. V. Subrahmanyam.
2. Turing Degrees and Post's Problem : I prepared this report during an independent study course in May-June, 2006, under Prof. David Madore, while visiting the Ecole Normale Superieure, Paris.