Welcome to my homepage

I was a graduate student in IMSc and my advisor was V. Arvind. I will be joining as a post-doctoral fellow at Israel Institute of Technology, Technion, Israel from April 22nd, 2009. Partha MukhopadhyayThe Institute of Mathematical Sciences

C. I. T. Campus, Taramani, Chennai-600113.

Office Phone: 91-44-22543240.

Email: partham[AT]imsc[DOT]res[DOT]in

- 2004-current: Ph.D.(Computer Science) at The Institute of Mathematical Sciences, Chennai

- 2000-2002: M.Tech.(CS) from Indian Statistical Institute, Kolkata
- 1996-2000 : B.E. (Electronics) from Jadavpur University, Kolkata

### Quantum Query Complexity of Multilinear Identity Testing.

V. Arvind, Partha Mukhopadhyay.

STACS 2009.### Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size.

V. Arvind, Partha Mukhopadhyay.

RANDOM 2008.### New results on Noncommutative and Commutative Polynomial Identity Testing.

V. Arvind, Partha Mukhopadhyay, Srikanth Srinivasan.

CCC 2008.### The Monomial Ideal Membership Problem and Polynomial Identity Testing.

V. Arvind, Partha Mukhopadhyay.

18th International Symposium on Algorithms and Computation (ISAAC 2007), Sendai, Japan, December 17-19, 2007, Proceedings. Lecture Notes in Computer Science 4835 Springer 2007, 800-811.### On Isomorphism and Canonization of Tournaments and Hypertournaments.

V. Arvind, Bireswar Das and Partha Mukhopadhyay.

Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC 2006). LNCS, Springer, to appear, Kolkata, Dec 18-20, 2006.### The Complexity of Black-Box Ring Problems.

V. Arvind, Bireswar Das, and Partha Mukhopadhyay.

Proceedings of the The Twelfth Annual International Computing and Combinatorics Conference (COCOON'06), LNCS, Springer, to appear, Taipei, Taiwan, August 15-18, 2006.