2023 2024 Student Forum > Management Forum > Main Forum

 
  #2  
10th July 2015, 09:18 AM
Super Moderator
 
Join Date: Apr 2013
Re: Nutan iitb

Nutan Limaye is the Assistant Professor of Department of Computer Science and Engineering Indian Institute of Technology, Bombay.

Education
Ph.D. in Computer Science
Theorerical Computer Science Department
The Institute of Mathematical Sciences , Chennai, India
(August 2005 -- August 2009 under the guidance of Prof. Meena Mahajan.)

Masters (with thesis) in Computer Science
Theoretical Computer Science Department
The Institute of Mathematical Sciences, Chennai, India
(August 2003 -- August 2005 under the guidance of Prof. Meena Mahajan.)

Bachelors in Computer Engineering
Sardar Patel College of Engineering, Mumbai, India.
(July 1999 -- June 2003)

Research Interests
My research interests include algorithms and complexity theory

PUBLICATIONS
Shifted partial derivative complexity of Elementary Symmetric Polynomials

with Herve Fournier, Meena Mahajan, Srikanth Srinivasan

40th Mathematical Foundations of Computer Science, MFCS, 2015.
[PDF] [Abstract +]

Skew circuits of small width.

with Nikhil Balaji, Andreas Krebs

21st International Computing and Combinatorics Conference, COCOON 2015.
An extended version is on Electronic Colloquium on Computational Complexity (ECCC) TR14-183 (2014)
[PDF] [Abstract +]

An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas

with Neeraj Kayal, Chandan Saha, Srikanth Srinivasan

The 55th Annual Symposium on Foundations of Computer Science, FOCS, 2014
An extended version is on Electronic Colloquium on Computational Complexity (ECCC) TR14-005 (2014)
[PDF] [Abstract +]

Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas

with Neeraj Kayal, Chandan Saha, Srikanth Srinivasan

Appeared in 46th Annual Symposium on the Theory of Computing, STOC, 2014.
An extended version is on Electronic Colloquium on Computational Complexity (ECCC) TR14-005 (2014)
[PDF] [Abstract +]

Lower bounds for depth 4 formulas computing iterated matrix multiplication

with Herve Fournier, Guillaume Malod, Srikanth Srinivasan

Appeared in 46th Annual Symposium on the Theory of Computing, STOC, 2014.
A preliminary version is on Electronic Colloquium on Computational Complexity (ECCC) 20: 100 (2013)
[PDF] [Abstract +]

DLOGTIME proof systems

with Andreas Krebs

In proceedings of the Foundations of Software Technology and Theoretical Computer Science, FSTTCS, December 12-14, 2013.
[PDF] [Abstract +]

Small depth proof systems

with Andreas Krebs, Meena Mahajan, Karteek Sreenivasaiah

In proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science 2013, MFCS, August 26-30, 2013.
[PDF] [Abstract +]

The complexity of unary subset sum

with Meena Mahajan, Karteek Sreenivasaiah

To appear in proceedings of the 18th Annual International Computing and Combinatorics Conference, COCOON, August 20-22, 2012.
[PDF] [Abstract +]

Streaming algorithms for recognizing nearly well-parenthesized expressions

with Andreas Krebs, Srikanth Srinivasan

To appear in proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science, MFCS, August 22-24, 2011.
[PDF] [Abstract +]

Counting paths in VPA is complete for #NC1.

with Andreas Krebs, Meena Mahajan

To appear in proceedings of the 16th International Computing and Combinatorics Conference, COCOON, July 19-21, 2010.
[PDF] [Abstract +]

Streaming algorithms for some problems in log-space.

with Ajesh Babu and Girish Varma

To appear in proceedings of the 7th Annual Conference on Theory and Applications of Models of Computation, (TAMC) Prague, Czech Republic, June 7-11, 2010
[PDF] [Abstract +]

Planar graph isomorphism is in log-space.

with Samir Datta, Prajakta Nimbhorkar, Thomas Thierauf, and Fabian Wagner

Appeared in proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity CCC, July 15--18, 2009, Paris, France. pp. 203--214.
[PDF] [Abstract +]

Membership testing: Removing extra stacks from multi-stack pushdown automata.

with Meena Mahajan

in Proceedings of 3rd International Conference on Language and Automata Theory and Applications LATA, April 2009, Tarragona, Spain. Springer-Verlag Lecture Notes in Computer Science series Volume 5457 pp. 493--504.
[PDF] [Abstract +]

Longest paths in planar DAGs in unambiguous logspace.

with Meena Mahajan and Prajakta Nimbhorkar.

To appear in Chicago Journal of Theoretical Computer Science, special issue for CATS 2009.

A preliminary version appeared in Proceedings of Computing: The Australasian Theory Symposium, CATS, January 2009, New Zealand. CRPIT Series Volume 94, pp. 99--105.
[PDF] [Abstract +]

3-connected planar graph isomorphism in Logspace.

with Samir Datta and Prajakta Nimbhorkar.

Appeared in Proceedings of Foundations of Software Technology and Theoretical Computer Science, FSTTCS, December 9-11, 2008, Bangalore, India.
[PDF] [Abstract +]

On the complexity of membership and counting in height-deterministic pushdown automata.

with Meena Mahajan and Antoine Meyer.

A preliminary version appeared in Proceedings of 3rd International Computer Science Symposium in Russia CSR, June 7--12, 2008, Moscow. Springer-Verlag Lecture Notes in Computer Science series Volume 5010 pp. 240--251.

Submitted to Chicago Journal of Theoretical Computer Science.
[PDF] [Abstract +]




Contact;
email: nutan [at] cse [dot] iitb [dot] ac [dot] in
phone: +91 22 2576 7732
office: F-5, Old CSE Building.
mail: Indian Institute of Technology, Bombay
Computer Science and Engineering Department
Powai, Mumbai - 400076.



Quick Reply
Your Username: Click here to log in

Message:
Options

Thread Tools Search this Thread



All times are GMT +5. The time now is 08:01 PM.


Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2024, vBulletin Solutions Inc.
SEO by vBSEO 3.6.0 PL2

1 2 3 4