 | 2012 |
| 24 |  | Andreas Krebs,
Nutan Limaye,
Meena Mahajan:
Counting Paths in VPA Is Complete for #NC 1.
Algorithmica 64(2): 279-294 (2012) |
| 2011 |
| 23 |  | Andreas Krebs,
Nutan Limaye,
Srikanth Srinivasan:
Streaming Algorithms for Recognizing Nearly Well-Parenthesized Expressions.
MFCS 2011: 412-423 |
| 22 |  | Ajesh Babu,
Nutan Limaye,
Jaikumar Radhakrishnan,
Girish Varma:
Streaming algorithms for language recognition problems
CoRR abs/1104.0848: (2011) |
| 2010 |
| 21 |  | Andreas Krebs,
Nutan Limaye,
Meena Mahajan:
Counting Paths in VPA Is Complete for #NC1.
COCOON 2010: 44-53 |
| 20 |  | Ajesh Babu,
Nutan Limaye,
Girish Varma:
Streaming Algorithms for Some Problems in Log-Space.
TAMC 2010: 94-104 |
| 19 |  | Nutan Limaye,
Meena Mahajan,
Prajakta Nimbhorkar:
Longest Paths in Planar DAGs in Unambiguous Log-Space.
Chicago J. Theor. Comput. Sci. 2010: (2010) |
| 18 |  | Andreas Krebs,
Nutan Limaye,
Meena Mahajan:
Counting paths in VPA is complete for #NC1.
Electronic Colloquium on Computational Complexity (ECCC) 17: 103 (2010) |
| 17 |  | Ajesh Babu,
Nutan Limaye,
Girish Varma:
Streaming algorithms for some problems in log-space.
Electronic Colloquium on Computational Complexity (ECCC) 17: 94 (2010) |
| 16 |  | Samir Datta,
Raghav Kulkarni,
Nutan Limaye,
Meena Mahajan:
Planarity, Determinants, Permanents, and (Unique) Matchings.
TOCT 1(3): (2010) |
| 15 |  | Nutan Limaye,
Meena Mahajan,
B. V. Raghavendra Rao:
Arithmetizing Classes Around NC\textsf{NC}1 and L\textsf{L}.
Theory Comput. Syst. 46(3): 499-522 (2010) |
| 2009 |
| 14 |  | Samir Datta,
Nutan Limaye,
Prajakta Nimbhorkar,
Thomas Thierauf,
Fabian Wagner:
Planar Graph Isomorphism is in Log-Space.
IEEE Conference on Computational Complexity 2009: 203-214 |
| 13 |  | Nutan Limaye,
Meena Mahajan:
Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata.
LATA 2009: 493-504 |
| 12 |  | Nutan Limaye,
Meena Mahajan,
Jayalal M. N. Sarma:
Upper Bounds for Monotone Planar Circuit Value and Variants.
Computational Complexity 18(3): 377-412 (2009) |
| 11 |  | Fabian Wagner,
Samir Datta,
Nutan Limaye,
Prajakta Nimbhorkar,
Thomas Thierauf:
Planar Graph Isomorphism is in Log-space.
Electronic Colloquium on Computational Complexity (ECCC) 16: 52 (2009) |
| 2008 |
| 10 |  | Nutan Limaye,
Meena Mahajan,
Antoine Meyer:
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata.
CSR 2008: 240-251 |
| 9 |  | Samir Datta,
Nutan Limaye,
Prajakta Nimbhorkar:
3-connected Planar Graph Isomorphism is in Log-space.
FSTTCS 2008: 155-162 |
| 8 |  | Nutan Limaye,
Meena Mahajan,
Prajakta Nimbhorkar:
Longest paths in Planar DAGs in Unambiguous Logspace
CoRR abs/0802.1699: (2008) |
| 7 |  | Samir Datta,
Nutan Limaye,
Prajakta Nimbhorkar:
3-connected Planar Graph Isomorphism is in Log-space
CoRR abs/0806.1041: (2008) |
| 6 |  | Samir Datta,
Nutan Limaye,
Prajakta Nimbhorkar,
Thomas Thierauf,
Fabian Wagner:
A Log-space Algorithm for Canonization of Planar Graphs
CoRR abs/0809.2319: (2008) |
| 2007 |
| 5 |  | Samir Datta,
Raghav Kulkarni,
Nutan Limaye,
Meena Mahajan:
Planarity, Determinants, Permanents, and (Unique) Matchings.
CSR 2007: 115-126 |
| 4 |  | Nutan Limaye,
Meena Mahajan,
B. V. Raghavendra Rao:
Arithmetizing Classes Around NC 1 and L.
STACS 2007: 477-488 |
| 3 |  | Nutan Limaye,
Meena Mahajan,
B. V. Raghavendra Rao:
Arithmetizing classes around NC^1 and L.
Electronic Colloquium on Computational Complexity (ECCC) 14(087): (2007) |
| 2006 |
| 2 |  | Nutan Limaye,
Meena Mahajan,
Jayalal M. N. Sarma:
Evaluating Monotone Circuits on Cylinders, Planes and Tori.
STACS 2006: 660-671 |
| 1 |  | Nutan Limaye,
Meena Mahajan,
Jayalal M. N. Sarma:
Evaluating Monotone Circuits on Cylinders, Planes and Tori
Electronic Colloquium on Computational Complexity (ECCC)(009): (2006) |