The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Meena Mahajan" ( http://dblp.L3S.de/Authors/Meena_Mahajan )

  Author page on DBLP  Author page in RDF  Community of Meena Mahajan in ASPL-2

Publication years (Num. hits)
1991-1998 (16) 1999-2004 (16) 2005-2008 (21) 2009-2010 (15) 2011-2012 (2)
Publication types (Num. hits)
article(40) inproceedings(28) proceedings(2)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 70 publication records. Showing 70 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer Counting classes and the fine structure between NC1 and L. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer Verifying Proofs in Constant Depth. Search on Bibsonomy MFCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan Planarity, Determinants, Permanents, and (Unique) Matchings. Search on Bibsonomy TOCT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Andreas Krebs, Nutan Limaye, Meena Mahajan Counting paths in VPA is complete for #NC1. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer Counting Classes and the Fine Structure between NC1 and L. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar Longest Paths in Planar DAGs in Unambiguous Log-Space. Search on Bibsonomy Chicago J. Theor. Comput. Sci. The full citation details ... 2010 DBLP  BibTeX  RDF
1Nutan Limaye, Meena Mahajan, B. V. Raghavendra Rao Arithmetizing Classes Around NC\textsf{NC}1 and L\textsf{L}. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Meena Mahajan, Jayalal M. N. Sarma On the Complexity of Matrix Rank and Rigidity. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer Counting Classes and the Fine Structure between NC1 and L. Search on Bibsonomy MFCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Andreas Krebs, Nutan Limaye, Meena Mahajan Counting Paths in VPA Is Complete for #NC1. Search on Bibsonomy COCOON The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Kamal Lodaya, Meena Mahajan (eds.) IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  BibTeX  RDF
1Kamal Lodaya, Meena Mahajan Frontmatter, Table of Contents, Preface, Conference Organization, Author Index. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Nutan Limaye, Meena Mahajan, Jayalal M. N. Sarma Upper Bounds for Monotone Planar Circuit Value and Variants. Search on Bibsonomy Computational Complexity The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Meena Mahajan, Venkatesh Raman, Somnath Sikdar Parameterizing above or below guaranteed values. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Nutan Limaye, Meena Mahajan Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata. Search on Bibsonomy LATA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan The Planar k-Means Problem is NP-Hard. Search on Bibsonomy WALCOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Meena Mahajan, B. V. Raghavendra Rao Small-Space Analogues of Valiant's Classes. Search on Bibsonomy FCT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Meena Mahajan, Jayalal M. N. Sarma Rigidity of a simple extended lower triangular matrix. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Meena Mahajan, B. V. Raghavendra Rao Arithmetic circuits, syntactic multilinearity, and the limitations of skew formulae. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2008 DBLP  BibTeX  RDF
1Raghav Kulkarni, Meena Mahajan, Kasturi R. Varadarajan Some perfect matchings and perfect half-integral matchings in NC. Search on Bibsonomy Chicago J. Theor. Comput. Sci. The full citation details ... 2008 DBLP  BibTeX  RDF
1Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar Longest paths in Planar DAGs in Unambiguous Logspace Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Martin Kutz, Khaled M. Elbassioni, Irit Katriel, Meena Mahajan Simultaneous matchings: Hardness and approximation. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Nutan Limaye, Meena Mahajan, Antoine Meyer On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata. Search on Bibsonomy CSR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Meena Mahajan, B. V. Raghavendra Rao Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae. Search on Bibsonomy MFCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Nutan Limaye, Meena Mahajan, B. V. Raghavendra Rao Arithmetizing classes around NC^1 and L. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2007 DBLP  BibTeX  RDF
1Meena Mahajan Polynomial Size Log Depth Circuits: Between NC1 and AC1. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2007 DBLP  BibTeX  RDF
1Meena Mahajan, Raghavan Rama, S. Vijayakumar Block Sorting: A Characterization and some Heuristics. Search on Bibsonomy Nord. J. Comput. The full citation details ... 2007 DBLP  BibTeX  RDF
1Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan Planarity, Determinants, Permanents, and (Unique) Matchings. Search on Bibsonomy CSR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Meena Mahajan, Jayalal M. N. Sarma On the Complexity of Matrix Rank and Rigidity. Search on Bibsonomy CSR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Nutan Limaye, Meena Mahajan, B. V. Raghavendra Rao Arithmetizing Classes Around NC 1 and L. Search on Bibsonomy STACS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Meena Mahajan, Jayalal M. N. Sarma On the Complexity of Rank and Rigidity. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2006 DBLP  BibTeX  RDF
1Nutan Limaye, Meena Mahajan, Jayalal M. N. Sarma Evaluating Monotone Circuits on Cylinders, Planes and Tori Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2006 DBLP  BibTeX  RDF
1Meena Mahajan, Raghavan Rama, Venkatesh Raman, S. Vijaykumar Approximate Block Sorting. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Meena Mahajan, Raghavan Rama, S. Vijayakumar On sorting by 3-bounded transpositions. Search on Bibsonomy Discrete Mathematics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Thanh Minh Hoang, Meena Mahajan, Thomas Thierauf On the Bipartite Unique Perfect Matching Problem. Search on Bibsonomy ICALP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Meena Mahajan, Venkatesh Raman, Somnath Sikdar Parameterizing MAX SNP Problems Above Guaranteed Values. Search on Bibsonomy IWPEC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Nutan Limaye, Meena Mahajan, Jayalal M. N. Sarma Evaluating Monotone Circuits on Cylinders, Planes and Tori. Search on Bibsonomy STACS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Khaled M. Elbassioni, Irit Katriel, Martin Kutz, Meena Mahajan Simultaneous Matchings. Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Eric Allender, Meena Mahajan The complexity of planarity testing. Search on Bibsonomy Inf. Comput. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Meena Mahajan, P. R. Subramanya, V. Vinay The combinatorial approach yields an NC algorithm for computing Pfaffians. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Raghav Kulkarni, Meena Mahajan Seeking a Vertex of the Planar Matching Polytope in NC. Search on Bibsonomy ESA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Meena Mahajan, Raghavan Rama, S. Vijayakumar Towards Constructing Optimal Strip Move Sequences. Search on Bibsonomy COCOON The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Kamal Lodaya, Meena Mahajan (eds.) FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings Search on Bibsonomy FSTTCS The full citation details ... 2004 DBLP  BibTeX  RDF
1Meena Mahajan, Raghavan Rama, Vijayakumar Sundarrajan On Sorting by 3-Bounded Transpositions. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Eric Allender, Vikraman Arvind, Meena Mahajan Arithmetic Complexity, Kleene Closure, and Formal Power Series. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Meena Mahajan, Raghavan Rama, Venkatesh Raman, S. Vijayakumar Merging and Sorting By Strip Moves. Search on Bibsonomy FSTTCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Meena Mahajan, V. Vinay A note on the hardness of the characteristic polynomial Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2000 DBLP  BibTeX  RDF
1Eric Allender, Meena Mahajan The Complexity of Planarity Testing. Search on Bibsonomy STACS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Meena Mahajan, Kasturi R. Varadarajan A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract). Search on Bibsonomy STOC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Eric Allender, Vikraman Arvind, Meena Mahajan Arithmetic Complexity, Kleene Closure, and Formal Power Series Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 1999 DBLP  BibTeX  RDF
1Meena Mahajan, P. R. Subramanya, V. Vinay A Combinatorial Algorithm for Pfaffians Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 1999 DBLP  BibTeX  RDF
1Meena Mahajan, Venkatesh Raman Parameterizing above Guaranteed Values: MaxSat and MaxCut. Search on Bibsonomy J. Algorithms The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Meena Mahajan, V. Vinay Determinant: Old Algorithms, New Insights. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Meena Mahajan, P. R. Subramanya, V. Vinay A Combinatorial Algorithm for Pfaffians. Search on Bibsonomy COCOON The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Meena Mahajan, V. Vinay Determinant: Old Algorithms, New Insights Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 1998 DBLP  BibTeX  RDF
1Eric Allender, Jia Jiao, Meena Mahajan, V. Vinay Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Meena Mahajan, V. Vinay Determinant: Old Algorithms, New Insights (Extended Abstract). Search on Bibsonomy SWAT The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Meena Mahajan, V. Vinay Determinant: Combinatorics, Algorithms, and Complexity Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 1997 DBLP  BibTeX  RDF
1Meena Mahajan, Venkatesh Raman Parametrizing Above Guaranteed Values: MaxSat and MaxCut Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 1997 DBLP  BibTeX  RDF
1Meena Mahajan, V. Vinay Determinant: Combinatorics, Algorithms, and Complexity. Search on Bibsonomy Chicago J. Theor. Comput. Sci. The full citation details ... 1997 DBLP  BibTeX  RDF
1Meena Mahajan, V. Vinay A Combinatorial Algorithm for the Determinant. Search on Bibsonomy SODA The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Meena Mahajan, N. V. Vinodchandran A Note on Mod and Generalised Mod Classes. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Eric Allender, Jia Jiao, Meena Mahajan, V. Vinay Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 1995 DBLP  BibTeX  RDF
1Kamala Krithivasan, Meena Mahajan Nondeterministic, Probabilistic and Alternating Computations on Cellular Array Models. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Satyanarayana V. Lokam, Meena Mahajan, V. Vinay Logspace Verifiers, NC, and NP. Search on Bibsonomy ISAAC The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Meena Mahajan, Thomas Thierauf, N. V. Vinodchandran A Note on SpanP Functions. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Meena Mahajan, V. Vinay Non-commutative Computation, Depth Reduction, and Skew Circuits (Extended Abstract). Search on Bibsonomy FSTTCS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Meena Mahajan, Kamala Krithivasan Language Classes Defined by Time-Bounded Relativised Cellular Automata. Search on Bibsonomy ITA The full citation details ... 1993 DBLP  BibTeX  RDF
1Kamala Krithivasan, Meena Mahajan Nondeterministic, Probabilistic and Alternating Computations on Cellular Array Models. Search on Bibsonomy Developments in Language Theory The full citation details ... 1993 DBLP  BibTeX  RDF
1Meena Mahajan, Kamala Krithivasan Relativised Cellular Automata and Complexity Classes. Search on Bibsonomy FSTTCS The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #70 of 70 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.