2009 |
53 | EE | Nutan Limaye,
Meena Mahajan:
Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata.
LATA 2009: 493-504 |
52 | EE | Meena Mahajan,
Prajakta Nimbhorkar,
Kasturi Varadarajan:
The Planar k-Means Problem is NP-Hard.
WALCOM 2009: 274-285 |
51 | EE | Meena Mahajan,
Venkatesh Raman,
Somnath Sikdar:
Parameterizing above or below guaranteed values.
J. Comput. Syst. Sci. 75(2): 137-153 (2009) |
2008 |
50 | EE | Nutan Limaye,
Meena Mahajan,
Antoine Meyer:
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata.
CSR 2008: 240-251 |
49 | EE | Meena Mahajan,
B. V. Raghavendra Rao:
Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae.
MFCS 2008: 455-466 |
48 | EE | Nutan Limaye,
Meena Mahajan,
Prajakta Nimbhorkar:
Longest paths in Planar DAGs in Unambiguous Logspace
CoRR abs/0802.1699: (2008) |
47 | EE | Meena Mahajan,
B. V. Raghavendra Rao:
Arithmetic circuits, syntactic multilinearity, and the limitations of skew formulae.
Electronic Colloquium on Computational Complexity (ECCC) 15(048): (2008) |
46 | EE | Meena Mahajan,
Jayalal M. N. Sarma:
Rigidity of a simple extended lower triangular matrix.
Inf. Process. Lett. 107(5): 149-153 (2008) |
45 | EE | Martin Kutz,
Khaled M. Elbassioni,
Irit Katriel,
Meena Mahajan:
Simultaneous matchings: Hardness and approximation.
J. Comput. Syst. Sci. 74(5): 884-897 (2008) |
2007 |
44 | EE | Samir Datta,
Raghav Kulkarni,
Nutan Limaye,
Meena Mahajan:
Planarity, Determinants, Permanents, and (Unique) Matchings.
CSR 2007: 115-126 |
43 | EE | Meena Mahajan,
Jayalal M. N. Sarma:
On the Complexity of Matrix Rank and Rigidity.
CSR 2007: 269-280 |
42 | EE | Nutan Limaye,
Meena Mahajan,
B. V. Raghavendra Rao:
Arithmetizing Classes Around NC 1 and L.
STACS 2007: 477-488 |
41 | EE | 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 |
40 | EE | Thanh Minh Hoang,
Meena Mahajan,
Thomas Thierauf:
On the Bipartite Unique Perfect Matching Problem.
ICALP (1) 2006: 453-464 |
39 | EE | Meena Mahajan,
Venkatesh Raman,
Somnath Sikdar:
Parameterizing MAX SNP Problems Above Guaranteed Values.
IWPEC 2006: 38-49 |
38 | EE | Nutan Limaye,
Meena Mahajan,
Jayalal M. N. Sarma:
Evaluating Monotone Circuits on Cylinders, Planes and Tori.
STACS 2006: 660-671 |
37 | EE | Meena Mahajan,
Raghavan Rama,
S. Vijayakumar:
On sorting by 3-bounded transpositions.
Discrete Mathematics 306(14): 1569-1585 (2006) |
36 | EE | Nutan Limaye,
Meena Mahajan,
Jayalal M. N. Sarma:
Evaluating Monotone Circuits on Cylinders, Planes and Tori
Electronic Colloquium on Computational Complexity (ECCC)(009): (2006) |
35 | EE | Meena Mahajan,
Jayalal M. N. Sarma:
On the Complexity of Rank and Rigidity.
Electronic Colloquium on Computational Complexity (ECCC) 13(100): (2006) |
34 | EE | Meena Mahajan,
Raghavan Rama,
Venkatesh Raman,
S. Vijaykumar:
Approximate Block Sorting.
Int. J. Found. Comput. Sci. 17(2): 337-356 (2006) |
2005 |
33 | EE | Khaled M. Elbassioni,
Irit Katriel,
Martin Kutz,
Meena Mahajan:
Simultaneous Matchings.
ISAAC 2005: 106-115 |
2004 |
32 | | Kamal Lodaya,
Meena Mahajan:
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings
Springer 2004 |
31 | EE | Meena Mahajan,
Raghavan Rama,
S. Vijayakumar:
Towards Constructing Optimal Strip Move Sequences.
COCOON 2004: 33-42 |
30 | EE | Raghav Kulkarni,
Meena Mahajan:
Seeking a Vertex of the Planar Matching Polytope in NC.
ESA 2004: 472-483 |
29 | EE | Meena Mahajan,
P. R. Subramanya,
V. Vinay:
The combinatorial approach yields an NC algorithm for computing Pfaffians.
Discrete Applied Mathematics 143(1-3): 1-16 (2004) |
28 | EE | Eric Allender,
Meena Mahajan:
The complexity of planarity testing.
Inf. Comput. 189(1): 117-134 (2004) |
2003 |
27 | EE | Meena Mahajan,
Raghavan Rama,
Venkatesh Raman,
S. Vijayakumar:
Merging and Sorting By Strip Moves.
FSTTCS 2003: 314-325 |
26 | EE | Meena Mahajan,
Raghavan Rama,
Vijayakumar Sundarrajan:
On Sorting by 3-Bounded Transpositions.
Electronic Notes in Discrete Mathematics 15: 115-118 (2003) |
25 | EE | Eric Allender,
Vikraman Arvind,
Meena Mahajan:
Arithmetic Complexity, Kleene Closure, and Formal Power Series.
Theory Comput. Syst. 36(4): 303-328 (2003) |
2000 |
24 | EE | Eric Allender,
Meena Mahajan:
The Complexity of Planarity Testing.
STACS 2000: 87-98 |
23 | EE | Meena Mahajan,
Kasturi R. Varadarajan:
A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract).
STOC 2000: 351-357 |
22 | EE | Meena Mahajan,
V. Vinay:
A note on the hardness of the characteristic polynomial
Electronic Colloquium on Computational Complexity (ECCC) 7(88): (2000) |
1999 |
21 | EE | Meena Mahajan,
P. R. Subramanya,
V. Vinay:
A Combinatorial Algorithm for Pfaffians.
COCOON 1999: 134-143 |
20 | EE | Meena Mahajan,
P. R. Subramanya,
V. Vinay:
A Combinatorial Algorithm for Pfaffians
Electronic Colloquium on Computational Complexity (ECCC) 6(30): (1999) |
19 | EE | Eric Allender,
Vikraman Arvind,
Meena Mahajan:
Arithmetic Complexity, Kleene Closure, and Formal Power Series
Electronic Colloquium on Computational Complexity (ECCC) 6(8): (1999) |
18 | | Meena Mahajan,
Venkatesh Raman:
Parameterizing above Guaranteed Values: MaxSat and MaxCut.
J. Algorithms 31(2): 335-354 (1999) |
17 | EE | Meena Mahajan,
V. Vinay:
Determinant: Old Algorithms, New Insights.
SIAM J. Discrete Math. 12(4): 474-490 (1999) |
1998 |
16 | EE | Meena Mahajan,
V. Vinay:
Determinant: Old Algorithms, New Insights (Extended Abstract).
SWAT 1998: 276-287 |
15 | EE | Meena Mahajan,
V. Vinay:
Determinant: Old Algorithms, New Insights
Electronic Colloquium on Computational Complexity (ECCC) 5(12): (1998) |
14 | EE | Eric Allender,
Jia Jiao,
Meena Mahajan,
V. Vinay:
Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds.
Theor. Comput. Sci. 209(1-2): 47-86 (1998) |
1997 |
13 | | Meena Mahajan,
V. Vinay:
A Combinatorial Algorithm for the Determinant.
SODA 1997: 730-738 |
12 | EE | Meena Mahajan,
V. Vinay:
Determinant: Combinatorics, Algorithms, and Complexity.
Chicago J. Theor. Comput. Sci. 1997: (1997) |
11 | EE | Meena Mahajan,
Venkatesh Raman:
Parametrizing Above Guaranteed Values: MaxSat and MaxCut
Electronic Colloquium on Computational Complexity (ECCC) 4(33): (1997) |
10 | EE | Meena Mahajan,
V. Vinay:
Determinant: Combinatorics, Algorithms, and Complexity
Electronic Colloquium on Computational Complexity (ECCC) 4(36): (1997) |
1995 |
9 | | Satyanarayana V. Lokam,
Meena Mahajan,
V. Vinay:
Logspace Verifiers, NC, and NP.
ISAAC 1995: 52-61 |
8 | EE | Eric Allender,
Jia Jiao,
Meena Mahajan,
V. Vinay:
Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds
Electronic Colloquium on Computational Complexity (ECCC) 2(43): (1995) |
7 | EE | Meena Mahajan,
N. V. Vinodchandran:
A Note on Mod and Generalised Mod Classes.
Inf. Process. Lett. 55(1): 27-31 (1995) |
6 | EE | Kamala Krithivasan,
Meena Mahajan:
Nondeterministic, Probabilistic and Alternating Computations on Cellular Array Models.
Theor. Comput. Sci. 143(1): 23-49 (1995) |
1994 |
5 | | Meena Mahajan,
V. Vinay:
Non-commutative Computation, Depth Reduction, and Skew Circuits (Extended Abstract).
FSTTCS 1994: 48-59 |
4 | | Meena Mahajan,
Thomas Thierauf,
N. V. Vinodchandran:
A Note on SpanP Functions.
Inf. Process. Lett. 51(1): 7-10 (1994) |
1993 |
3 | | Kamala Krithivasan,
Meena Mahajan:
Nondeterministic, Probabilistic and Alternating Computations on Cellular Array Models.
Developments in Language Theory 1993: 342-354 |
2 | | Meena Mahajan,
Kamala Krithivasan:
Language Classes Defined by Time-Bounded Relativised Cellular Automata.
ITA 27(5): 403-432 (1993) |
1991 |
1 | | Meena Mahajan,
Kamala Krithivasan:
Relativised Cellular Automata and Complexity Classes.
FSTTCS 1991: 172-185 |