Senior Research Fellow

Theoretical Computer Science

The Institute of Mathematical Sciences, Chennai.

Theoretical Computer Science

The Institute of Mathematical Sciences, Chennai.

I am a PhD student working under the guidance of Prof. Meena Mahajan. I have been working on problems related to the computational complexity of proof systems, and also on problems involving arithmetic circuits.

In general, I am interested in problems that involve computation and combinatorics. A lot of my research so far involves studying computation with very small resources.

Office: New Building, #110.

Ph: 044-22543110

Email: karteek@imsc.res.in

Building above read-once polynomials: identity testing and hardness of representation.

Meena Mahajan, B. V. Raghavendra Rao and Karteek Sreenivasaiah.

Accepted to COCOON 2014.

Space Efficient Approximation Algorithms for Subset Sum and related Problems.

Anna Gal, Jiang-Tang Jiang, Nutan Limaye and Karteek Sreenivasaiah.

Manuscript.

Monomials, Multilinearity and Identity Testing in Simple Read-Restricted Circuits.

Meena Mahajan, B. V. Raghavendra Rao and Karteek Sreenivasaiah.

*Theoretical Computer Science*524, 90–102, 2014.

A preliminary version appeared in Proceedings of the 37th*International Symposium on Mathematical Foundations of Computer Science (MFCS 2012)*.

Springer-Verlag LNCS Volume 7464, pp.655–667.

Small Depth Proof Systems.

Andreas Krebs, Nutan Limaye, Meena Mahajan, and Karteek Sreenivasaiah.

Proceedings of 38th*International Symposium on Mathematical Foundations of Computer Science (MFCS 2013)*,

Springer-Verlag LNCS Volume 8087, pp.583–594.

Verifying Proofs in Constant Depth.

Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, and Heribert Vollmer.

*ACM Transactions on Computation Theory (ToCT)*,Vol 5 issue 1 May 2013, article 2: 1–23.

A preliminary version appeared in Proceedings of 36th*International Symposium on Mathematical Foundations of Computer Science (MFCS 2011)*,

Springer-Verlag LNCS Volume 6907, pp.84–95.

The complexity of unary subset sum.

Nutan Limaye, Meena Mahajan and Karteek Sreenivasaiah.

Proceedings of 18th Annual*International Computing and Combinatorics Conference (COCOON 2012)*,

Springer-Verlag LNCS Volume 7434, pp.458–469.

Counting paths in planar width 2 branching programs.

Meena Mahajan, Nitin Saurabh and Karteek Sreenivasaiah.

Proceedings of the 18th /Computing: the Australasian Theory Symposium (CATS 2012),

CRPIT series Volume 128, pp. 59–68