Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Meena Mahajan
2010 – today
- 2013
[j31]Meena Mahajan, B. V. Raghavendra Rao: Small Space Analogues of Valiant's Classes and the Limitations of Skew Formulas. Computational Complexity 22(1): 1-38 (2013)- [j30]Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer: Verifying proofs in constant depth. TOCT 5(1): 2 (2013)
- 2012
- [j29]Andreas Krebs, Nutan Limaye, Meena Mahajan: Counting Paths in VPA Is Complete for #NC 1. Algorithmica 64(2): 279-294 (2012)
- [j28]Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer: Counting classes and the fine structure between NC1 and L. Theor. Comput. Sci. 417: 36-49 (2012)
- [j27]Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan: The planar k-means problem is NP-hard. Theor. Comput. Sci. 442: 13-21 (2012)
- [c32]Meena Mahajan, Nitin Saurabh, Karteek Sreenivasaiah: Counting paths in planar width 2 branching programs. CATS 2012: 59-68
- [c31]Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah: The Complexity of Unary Subset Sum. COCOON 2012: 458-469
- [c30]Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah: Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs. MFCS 2012: 655-667
- [i15]Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer: Verifying Proofs in Constant Depth. Electronic Colloquium on Computational Complexity (ECCC) 19: 79 (2012)
- 2011
- [c29]Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer: Verifying Proofs in Constant Depth. MFCS 2011: 84-95
- 2010
- [j26]Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar: Longest Paths in Planar DAGs in Unambiguous Log-Space. Chicago J. Theor. Comput. Sci. 2010 (2010)
- [j25]Meena Mahajan, Jayalal M. N. Sarma: On the Complexity of Matrix Rank and Rigidity. Theory Comput. Syst. 46(1): 9-26 (2010)
- [j24]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)
- [j23]Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan: Planarity, Determinants, Permanents, and (Unique) Matchings. TOCT 1(3) (2010)
- [c28]Andreas Krebs, Nutan Limaye, Meena Mahajan: Counting Paths in VPA Is Complete for #NC1. COCOON 2010: 44-53
- [c27]Kamal Lodaya, Meena Mahajan: Frontmatter, Table of Contents, Preface, Conference Organization, Author Index. FSTTCS 2010
- [c26]Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer: Counting Classes and the Fine Structure between NC1 and L. MFCS 2010: 306-317
- [e2]Kamal Lodaya, Meena Mahajan (Eds.): IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India. LIPIcs 8, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2010, ISBN 978-3-939897-23-1
- [i14]Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer: Counting Classes and the Fine Structure between NC1 and L. Electronic Colloquium on Computational Complexity (ECCC) 17: 101 (2010)
- [i13]Andreas Krebs, Nutan Limaye, Meena Mahajan: Counting paths in VPA is complete for #NC1. Electronic Colloquium on Computational Complexity (ECCC) 17: 103 (2010)
2000 – 2009
- 2009
- [j22]Nutan Limaye, Meena Mahajan, Jayalal M. N. Sarma: Upper Bounds for Monotone Planar Circuit Value and Variants. Computational Complexity 18(3): 377-412 (2009)
- [j21]Nutan Limaye, Meena Mahajan, Antoine Meyer: On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata. Journal of Automata, Languages and Combinatorics 14(3/4): 211-235 (2009)
- [j20]Meena Mahajan, Venkatesh Raman, Somnath Sikdar: Parameterizing above or below guaranteed values. J. Comput. Syst. Sci. 75(2): 137-153 (2009)
- [c25]Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar: Longest Paths in Planar DAGs in Unambiguous Logspace. CATS 2009: 99-105
- [c24]
- [c23]Nutan Limaye, Meena Mahajan: Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata. LATA 2009: 493-504
- [c22]Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan: The Planar k-Means Problem is NP-Hard. WALCOM 2009: 274-285
- 2008
- [j19]Raghav Kulkarni, Meena Mahajan, Kasturi R. Varadarajan: Some perfect matchings and perfect half-integral matchings in NC. Chicago J. Theor. Comput. Sci. 2008 (2008)
- [j18]Meena Mahajan, Jayalal M. N. Sarma: Rigidity of a simple extended lower triangular matrix. Inf. Process. Lett. 107(5): 149-153 (2008)
- [j17]Martin Kutz, Khaled M. Elbassioni, Irit Katriel, Meena Mahajan: Simultaneous matchings: Hardness and approximation. J. Comput. Syst. Sci. 74(5): 884-897 (2008)
- [c21]Nutan Limaye, Meena Mahajan, Antoine Meyer: On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata. CSR 2008: 240-251
- [c20]Meena Mahajan, B. V. Raghavendra Rao: Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae. MFCS 2008: 455-466
- [i12]Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar: Longest paths in Planar DAGs in Unambiguous Logspace. CoRR abs/0802.1699 (2008)
- [i11]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)
- 2007
- [j16]Meena Mahajan: Polynomial Size Log Depth Circuits: Between NC1 and AC1. Bulletin of the EATCS 91: 42-56 (2007)
- [j15]Meena Mahajan, Raghavan Rama, S. Vijayakumar: Block Sorting: A Characterization and some Heuristics. Nord. J. Comput. 14(1-2): 126-150 (2007)
- [c19]Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan: Planarity, Determinants, Permanents, and (Unique) Matchings. CSR 2007: 115-126
- [c18]Meena Mahajan, Jayalal M. N. Sarma: On the Complexity of Matrix Rank and Rigidity. CSR 2007: 269-280
- [c17]Nutan Limaye, Meena Mahajan, B. V. Raghavendra Rao: Arithmetizing Classes Around NC 1 and L. STACS 2007: 477-488
- [i10]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
- [j14]Meena Mahajan, Raghavan Rama, S. Vijayakumar: On sorting by 3-bounded transpositions. Discrete Mathematics 306(14): 1569-1585 (2006)
- [j13]Meena Mahajan, Raghavan Rama, Venkatesh Raman, S. Vijaykumar: Approximate Block Sorting. Int. J. Found. Comput. Sci. 17(2): 337-356 (2006)
- [c16]Thanh Minh Hoang, Meena Mahajan, Thomas Thierauf: On the Bipartite Unique Perfect Matching Problem. ICALP (1) 2006: 453-464
- [c15]Meena Mahajan, Venkatesh Raman, Somnath Sikdar: Parameterizing MAX SNP Problems Above Guaranteed Values. IWPEC 2006: 38-49
- [c14]Nutan Limaye, Meena Mahajan, Jayalal M. N. Sarma: Evaluating Monotone Circuits on Cylinders, Planes and Tori. STACS 2006: 660-671
- [i9]Nutan Limaye, Meena Mahajan, Jayalal M. N. Sarma: Evaluating Monotone Circuits on Cylinders, Planes and Tori. Electronic Colloquium on Computational Complexity (ECCC)(009) (2006)
- [i8]Meena Mahajan, Jayalal M. N. Sarma: On the Complexity of Rank and Rigidity. Electronic Colloquium on Computational Complexity (ECCC) 13(100) (2006)
- 2005
- [c13]Khaled M. Elbassioni, Irit Katriel, Martin Kutz, Meena Mahajan: Simultaneous Matchings. ISAAC 2005: 106-115
- 2004
- [j12]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)
- [j11]Eric Allender, Meena Mahajan: The complexity of planarity testing. Inf. Comput. 189(1): 117-134 (2004)
- [c12]Meena Mahajan, Raghavan Rama, S. Vijayakumar: Towards Constructing Optimal Strip Move Sequences. COCOON 2004: 33-42
- [c11]Raghav Kulkarni, Meena Mahajan: Seeking a Vertex of the Planar Matching Polytope in NC. ESA 2004: 472-483
- [e1]Kamal Lodaya, Meena Mahajan (Eds.): FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings. Lecture Notes in Computer Science 3328, Springer 2004, ISBN 3-540-24058-6
- 2003
- [j10]Meena Mahajan, Raghavan Rama, Vijayakumar Sundarrajan: On Sorting by 3-Bounded Transpositions. Electronic Notes in Discrete Mathematics 15: 115-118 (2003)
- [j9]Eric Allender, Vikraman Arvind, Meena Mahajan: Arithmetic Complexity, Kleene Closure, and Formal Power Series. Theory Comput. Syst. 36(4): 303-328 (2003)
- [c10]Meena Mahajan, Raghavan Rama, Venkatesh Raman, S. Vijayakumar: Merging and Sorting By Strip Moves. FSTTCS 2003: 314-325
- 2000
- [c9]
- [c8]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
- [i7]Meena Mahajan, V. Vinay: A note on the hardness of the characteristic polynomial. Electronic Colloquium on Computational Complexity (ECCC) 7(88) (2000)
1990 – 1999
- 1999
- [j8]Meena Mahajan, Venkatesh Raman: Parameterizing above Guaranteed Values: MaxSat and MaxCut. J. Algorithms 31(2): 335-354 (1999)
- [j7]Meena Mahajan, V. Vinay: Determinant: Old Algorithms, New Insights. SIAM J. Discrete Math. 12(4): 474-490 (1999)
- [c7]Meena Mahajan, P. R. Subramanya, V. Vinay: A Combinatorial Algorithm for Pfaffians. COCOON 1999: 134-143
- [i6]Eric Allender, Vikraman Arvind, Meena Mahajan: Arithmetic Complexity, Kleene Closure, and Formal Power Series. Electronic Colloquium on Computational Complexity (ECCC) 6(8) (1999)
- [i5]Meena Mahajan, P. R. Subramanya, V. Vinay: A Combinatorial Algorithm for Pfaffians. Electronic Colloquium on Computational Complexity (ECCC) 6(30) (1999)
- 1998
- [j6]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)
- [c6]
- [i4]Meena Mahajan, V. Vinay: Determinant: Old Algorithms, New Insights. Electronic Colloquium on Computational Complexity (ECCC) 5(12) (1998)
- 1997
- [j5]Meena Mahajan, V. Vinay: Determinant: Combinatorics, Algorithms, and Complexity. Chicago J. Theor. Comput. Sci. 1997 (1997)
- [c5]
- [i3]Meena Mahajan, Venkatesh Raman: Parametrizing Above Guaranteed Values: MaxSat and MaxCut. Electronic Colloquium on Computational Complexity (ECCC) 4(33) (1997)
- [i2]Meena Mahajan, V. Vinay: Determinant: Combinatorics, Algorithms, and Complexity. Electronic Colloquium on Computational Complexity (ECCC) 4(36) (1997)
- 1995
- [j4]Meena Mahajan, N. V. Vinodchandran: A Note on Mod and Generalised Mod Classes. Inf. Process. Lett. 55(1): 27-31 (1995)
- [j3]Kamala Krithivasan, Meena Mahajan: Nondeterministic, Probabilistic and Alternating Computations on Cellular Array Models. Theor. Comput. Sci. 143(1): 23-49 (1995)
- [c4]
- [i1]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)
- 1994
- [j2]Meena Mahajan, Thomas Thierauf, N. V. Vinodchandran: A Note on SpanP Functions. Inf. Process. Lett. 51(1): 7-10 (1994)
- [c3]Meena Mahajan, V. Vinay: Non-commutative Computation, Depth Reduction, and Skew Circuits (Extended Abstract). FSTTCS 1994: 48-59
- 1993
- [j1]Meena Mahajan, Kamala Krithivasan: Language Classes Defined by Time-Bounded Relativised Cellular Automata. ITA 27(5): 403-432 (1993)
- [c2]Kamala Krithivasan, Meena Mahajan: Nondeterministic, Probabilistic and Alternating Computations on Cellular Array Models. Developments in Language Theory 1993: 342-354
- 1991
- [c1]Meena Mahajan, Kamala Krithivasan: Relativised Cellular Automata and Complexity Classes. FSTTCS 1991: 172-185
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-06 20:13 CEST by the dblp team