Nitin Saurabh

Research Interests

My research interest lies in Theoretical Computer Science. I am interested in Computational Complexity Theory (particularly Boolean and Arithmetic circuit complexity), Analysis of Boolean functions and Parameterized Complexity.

Education

• Ph.D., Computer Science, The Institute of Mathematical Sciences, Chennai, India, August 2010 - present .

• B.Sc. (Hons.), Mathematics and Computer Science, Chennai Mathematical Institute, Chennai, India, August 2007- April 2010.
  

Publications

• Counting paths in planar width 2 branching programs.

  Meena Mahajan and Nitin Saurabh and Karteek Sreenivasaiah.
  The 18th CATS symposium (Computing: the Australasian Theory Symposium), 30 Jan -- 2 Feb 2012, Melbourne, Australia, CRPIT series Vol.\ 128, pp.\ 59--68.

• Algebraic Models of Computation.

  Master's Thesis. Institute of Mathematical Sciences, May 2012.

Contact

The Institute of Mathematical Sciences
C.I.T. Campus, Taramani
Chennai 600 113
India

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