dblp.uni-trier.dewww.uni-trier.de

Meena Mahajan

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
43EENutan Limaye, Meena Mahajan, Antoine Meyer: On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata. CSR 2008: 240-251
42EENutan Limaye, Meena Mahajan, Prajakta Nimbhorkar: Longest paths in Planar DAGs in Unambiguous Logspace CoRR abs/0802.1699: (2008)
2007
41EESamir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan: Planarity, Determinants, Permanents, and (Unique) Matchings. CSR 2007: 115-126
40EEMeena Mahajan, Jayalal M. N. Sarma: On the Complexity of Matrix Rank and Rigidity. CSR 2007: 269-280
39EENutan Limaye, Meena Mahajan, B. V. Raghavendra Rao: Arithmetizing Classes Around NC 1 and L. STACS 2007: 477-488
2006
38EEThanh Minh Hoang, Meena Mahajan, Thomas Thierauf: On the Bipartite Unique Perfect Matching Problem. ICALP (1) 2006: 453-464
37EEMeena Mahajan, Venkatesh Raman, Somnath Sikdar: Parameterizing MAX SNP Problems Above Guaranteed Values. IWPEC 2006: 38-49
36EENutan Limaye, Meena Mahajan, Jayalal M. N. Sarma: Evaluating Monotone Circuits on Cylinders, Planes and Tori. STACS 2006: 660-671
35EEMeena Mahajan, Raghavan Rama, S. Vijayakumar: On sorting by 3-bounded transpositions. Discrete Mathematics 306(14): 1569-1585 (2006)
34EENutan Limaye, Meena Mahajan, Jayalal M. N. Sarma: Evaluating Monotone Circuits on Cylinders, Planes and Tori Electronic Colloquium on Computational Complexity (ECCC)(009): (2006)
33EEMeena Mahajan, Raghavan Rama, Venkatesh Raman, S. Vijaykumar: Approximate Block Sorting. Int. J. Found. Comput. Sci. 17(2): 337-356 (2006)
2005
32EEKhaled M. Elbassioni, Irit Katriel, Martin Kutz, Meena Mahajan: Simultaneous Matchings. ISAAC 2005: 106-115
2004
31 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
30EEMeena Mahajan, Raghavan Rama, S. Vijayakumar: Towards Constructing Optimal Strip Move Sequences. COCOON 2004: 33-42
29EERaghav Kulkarni, Meena Mahajan: Seeking a Vertex of the Planar Matching Polytope in NC. ESA 2004: 472-483
28EEMeena 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)
27EEEric Allender, Meena Mahajan: The complexity of planarity testing. Inf. Comput. 189(1): 117-134 (2004)
2003
26EEMeena Mahajan, Raghavan Rama, Venkatesh Raman, S. Vijayakumar: Merging and Sorting By Strip Moves. FSTTCS 2003: 314-325
25EEEric Allender, Vikraman Arvind, Meena Mahajan: Arithmetic Complexity, Kleene Closure, and Formal Power Series. Theory Comput. Syst. 36(4): 303-328 (2003)
2000
24EEEric Allender, Meena Mahajan: The Complexity of Planarity Testing. STACS 2000: 87-98
23EEMeena 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
22EEMeena Mahajan, V. Vinay: A note on the hardness of the characteristic polynomial Electronic Colloquium on Computational Complexity (ECCC) 7(88): (2000)
1999
21EEMeena Mahajan, P. R. Subramanya, V. Vinay: A Combinatorial Algorithm for Pfaffians. COCOON 1999: 134-143
20EEMeena Mahajan, P. R. Subramanya, V. Vinay: A Combinatorial Algorithm for Pfaffians Electronic Colloquium on Computational Complexity (ECCC) 6(30): (1999)
19EEEric 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)
17EEMeena Mahajan, V. Vinay: Determinant: Old Algorithms, New Insights. SIAM J. Discrete Math. 12(4): 474-490 (1999)
1998
16EEMeena Mahajan, V. Vinay: Determinant: Old Algorithms, New Insights (Extended Abstract). SWAT 1998: 276-287
15EEMeena Mahajan, V. Vinay: Determinant: Old Algorithms, New Insights Electronic Colloquium on Computational Complexity (ECCC) 5(12): (1998)
14EEEric 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
12EEMeena Mahajan, V. Vinay: Determinant: Combinatorics, Algorithms, and Complexity. Chicago J. Theor. Comput. Sci. 1997: (1997)
11EEMeena Mahajan, Venkatesh Raman: Parametrizing Above Guaranteed Values: MaxSat and MaxCut Electronic Colloquium on Computational Complexity (ECCC) 4(33): (1997)
10EEMeena 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
8EEEric 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)
7EEMeena Mahajan, N. V. Vinodchandran: A Note on Mod and Generalised Mod Classes. Inf. Process. Lett. 55(1): 27-31 (1995)
6EEKamala 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

Coauthor Index

1Eric Allender [8] [14] [19] [24] [25] [27]
2Vikraman Arvind [19] [25]
3Samir Datta [41]
4Khaled M. Elbassioni [32]
5Thanh Minh Hoang [38]
6Jia Jiao [8] [14]
7Irit Katriel [32]
8Kamala Krithivasan [1] [2] [3] [6]
9Raghav Kulkarni [29] [41]
10Martin Kutz [32]
11Nutan Limaye [34] [36] [39] [41] [42] [43]
12Kamal Lodaya [31]
13Satyanarayana V. Lokam [9]
14Antoine Meyer [43]
15Prajakta Nimbhorkar [42]
16Raghavan Rama [26] [30] [33] [35]
17Venkatesh Raman [11] [18] [26] [33] [37]
18B. V. Raghavendra Rao [39]
19Jayalal M. N. Sarma [34] [36] [40]
20Somnath Sikdar [37]
21P. R. Subramanya [20] [21] [28]
22Thomas Thierauf [4] [38]
23Kasturi R. Varadarajan [23]
24S. Vijayakumar [26] [30] [35]
25S. Vijaykumar [33]
26V. Vinay [5] [8] [9] [10] [12] [13] [14] [15] [16] [17] [20] [21] [22] [28]
27N. V. Vinodchandran (N. Variyam Vinodchandran) [4] [7]

Colors in the list of coauthors

Copyright © Wed May 28 02:56:03 2008 by Michael Ley (ley@uni-trier.de)