Systolic Pyramid Automata, Cellular Automata and Array Languages. - Kamala Krithivasan; Meena Mahajan (Int. J. Pattern Recognit. Artif. Intell., 1989)

Systolic Pyramid Automata, Cellular Automata and Array Languages. - Kamala Krithivasan; Meena Mahajan (Array Grammars, Patterns and Recognizers, 1989)

Hexagonal Cellular Automata. - Meena Mahajan; Kamala Krithivasan (A Perspective in Theoretical Computer Science, 1989)

Fuzzy L-systems. - M. V. Nagendra Prasad; Meena Mahajan; Kamala Krithivasan (Int. J. Comput. Math., 1990)

Relativised Cellular Automata and Complexity Classes. - Meena Mahajan; Kamala Krithivasan (FSTTCS, 1991)

Some results on time-varying and relativised cellular automata. - Meena Mahajan; Kamala Krithivasan (Int. J. Comput. Math., 1992)

Language Classes Defined by Time-Bounded Relativised Cellular Automata. - Meena Mahajan; Kamala Krithivasan (RAIRO Theor. Informatics Appl., 1993)

Non-commutative Computation, Depth Reduction, and Skew Circuits (Extended Abstract). - Meena Mahajan; V. Vinay (FSTTCS, 1994)

A Note on SpanP Functions. - Meena Mahajan; Thomas Thierauf; N. V. Vinodchandran (Inf. Process. Lett., 1994)

Logspace Verifiers, NC, and NP. - Satyanarayana V. Lokam; Meena Mahajan; V. Vinay (ISAAC, 1995)

A Note on Mod and Generalised Mod Classes. - Meena Mahajan; N. V. Vinodchandran (Inf. Process. Lett., 1995)

Nondeterministic, Probabilistic and Alternating Computations on Cellular Array Models. - Kamala Krithivasan; Meena Mahajan (Theor. Comput. Sci., 1995)

A Combinatorial Algorithm for the Determinant. - Meena Mahajan; V. Vinay (SODA, 1997)

Determinant: Combinatorics, Algorithms, and Complexity. - Meena Mahajan; V. Vinay (Chic. J. Theor. Comput. Sci., 1997)

Parametrizing Above Guaranteed Values: MaxSat and MaxCut - Meena Mahajan; Venkatesh Raman 001 (Electron. Colloquium Comput. Complex., 1997)

Determinant: Old Algorithms, New Insights (Extended Abstract). - Meena Mahajan; V. Vinay (SWAT, 1998)

Determinant: Old Algorithms, New Insights - Meena Mahajan; V. Vinay (Electron. Colloquium Comput. Complex., 1998)

Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds. - Eric Allender; Jia Jiao; Meena Mahajan; V. Vinay (Theor. Comput. Sci., 1998)

Arithmetic Complexity, Kleene Closure, and Formal Power Series - Eric Allender; Vikraman Arvind; Meena Mahajan (Electron. Colloquium Comput. Complex., 1999)

A Combinatorial Algorithm for Pfaffians - Meena Mahajan; P. R. Subramanya; V. Vinay (Electron. Colloquium Comput. Complex., 1999)

Parameterizing above Guaranteed Values: MaxSat and MaxCut. - Meena Mahajan; Venkatesh Raman 001 (J. Algorithms, 1999)

A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract). - Meena Mahajan; Kasturi R. Varadarajan (STOC, 2000)

A note on the hardness of the characteristic polynomial - Meena Mahajan; V. Vinay (Electron. Colloquium Comput. Complex., 2000)

Merging and Sorting By Strip Moves. - Meena Mahajan; Raghavan Rama 001; Venkatesh Raman 001; Vijayakumar Sundarrajan (FSTTCS, 2003)

On Sorting by 3-Bounded Transpositions. - Meena Mahajan; Raghavan Rama 001; Vijayakumar Sundarrajan (Electron. Notes Discret. Math., 2003)

Towards Constructing Optimal Strip Move Sequences. - Meena Mahajan; Raghavan Rama 001; Vijayakumar Sundarrajan (COCOON, 2004)

Seeking a Vertex of the Planar Matching Polytope in NC. - Raghav Kulkarni; Meena Mahajan (ESA, 2004)

The combinatorial approach yields an NC algorithm for computing Pfaffians. - Meena Mahajan; P. R. Subramanya; V. Vinay (Discret. Appl. Math., 2004)

The complexity of planarity testing. - Eric Allender; Meena Mahajan (Inf. Comput., 2004)

Simultaneous Matchings. - Khaled M. Elbassioni; Irit Katriel; Martin Kutz; Meena Mahajan (ISAAC, 2005)

On the Bipartite Unique Perfect Matching Problem. - Thanh Minh Hoang; Meena Mahajan; Thomas Thierauf (ICALP (1), 2006)

Parameterizing MAX SNP Problems Above Guaranteed Values. - Meena Mahajan; Venkatesh Raman 001; Somnath Sikdar (IWPEC, 2006)

Evaluating Monotone Circuits on Cylinders, Planes and Tori - Nutan Limaye; Meena Mahajan; Jayalal Sarma (Electron. Colloquium Comput. Complex., 2006)

On the Complexity of Rank and Rigidity. - Meena Mahajan; Jayalal Sarma (Electron. Colloquium Comput. Complex., 2006)

Approximate Block Sorting. - Meena Mahajan; Raghavan Rama 001; Venkatesh Raman 001; S. Vijaykumar (Int. J. Found. Comput. Sci., 2006)

Arithmetizing Classes Around NC 1 and L. - Nutan Limaye; Meena Mahajan; B. V. Raghavendra Rao (STACS, 2007)

Polynomial Size Log Depth Circuits: Between NC1 and AC1. - Meena Mahajan (Bull. EATCS, 2007)

Arithmetizing classes around NC^1 and L. - Nutan Limaye; Meena Mahajan; B. V. Raghavendra Rao (Electron. Colloquium Comput. Complex., 2007)

Block Sorting: A Characterization and some Heuristics. - Meena Mahajan; Raghavan Rama 001; Vijayakumar Sundarrajan (Nord. J. Comput., 2007)

Some perfect matchings and perfect half-integral matchings in NC. - Raghav Kulkarni; Meena Mahajan; Kasturi R. Varadarajan (Chic. J. Theor. Comput. Sci., 2008)

Arithmetic circuits, syntactic multilinearity, and the limitations of skew formulae. - Meena Mahajan; B. V. Raghavendra Rao (Electron. Colloquium Comput. Complex., 2008)

Rigidity of a simple extended lower triangular matrix. - Meena Mahajan; Jayalal Sarma (Inf. Process. Lett., 2008)

Simultaneous matchings: Hardness and approximation. - Martin Kutz; Khaled M. Elbassioni; Irit Katriel; Meena Mahajan (J. Comput. Syst. Sci., 2008)

Longest Paths in Planar DAGs in Unambiguous Logspace. - Nutan Limaye; Meena Mahajan; Prajakta Nimbhorkar (CATS, 2009)

Small space analogues of Valiant's classes and the limitations of skew formula. - Meena Mahajan; B. V. Raghavendra Rao (Algebraic Methods in Computational Complexity, 2009)

Small-Space Analogues of Valiant's Classes. - Meena Mahajan; B. V. Raghavendra Rao (FCT, 2009)

Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata. - Nutan Limaye; Meena Mahajan (LATA, 2009)

Upper Bounds for Monotone Planar Circuit Value and Variants. - Nutan Limaye; Meena Mahajan; Jayalal Sarma (Comput. Complex., 2009)

On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata. - Nutan Limaye; Meena Mahajan; Antoine Meyer (J. Autom. Lang. Comb., 2009)

Parameterizing above or below guaranteed values. - Meena Mahajan; Venkatesh Raman 001; Somnath Sikdar (J. Comput. Syst. Sci., 2009)

Frontmatter, Table of Contents, Preface, Conference Organization, Author Index. - Kamal Lodaya; Meena Mahajan (FSTTCS, 2010)

Longest Paths in Planar DAGs in Unambiguous Log-Space. - Nutan Limaye; Meena Mahajan; Prajakta Nimbhorkar (Chic. J. Theor. Comput. Sci., 2010)

Counting paths in VPA is complete for #NC1. - Andreas Krebs; Nutan Limaye; Meena Mahajan (Electron. Colloquium Comput. Complex., 2010)

Arithmetizing Classes Around NC textsf{NC}1 and L textsf{L}. - Nutan Limaye; Meena Mahajan; B. V. Raghavendra Rao (Theory Comput. Syst., 2010)

On the Complexity of Matrix Rank and Rigidity. - Meena Mahajan; Jayalal Sarma (Theory Comput. Syst., 2010)

Planarity, Determinants, Permanents, and (Unique) Matchings. - Samir Datta; Raghav Kulkarni; Nutan Limaye; Meena Mahajan (ACM Trans. Comput. Theory, 2010)

Verifying Proofs in Constant Depth. - Olaf Beyersdorff; Samir Datta; Meena Mahajan; Gido Scharfenberger-Fabian; Karteek Sreenivasaiah; Michael Thomas 001; Heribert Vollmer (MFCS, 2011)

Counting paths in planar width 2 branching programs. - Meena Mahajan; Nitin Saurabh; Karteek Sreenivasaiah (CATS, 2012)

The Complexity of Unary Subset Sum. - Nutan Limaye; Meena Mahajan; Karteek Sreenivasaiah (COCOON, 2012)

Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs. - Meena Mahajan; B. V. Raghavendra Rao; Karteek Sreenivasaiah (MFCS, 2012)

Counting Paths in VPA Is Complete for #NC 1. - Andreas Krebs; Nutan Limaye; Meena Mahajan (Algorithmica, 2012)

Verifying Proofs in Constant Depth. - Olaf Beyersdorff; Samir Datta; Andreas Krebs; Meena Mahajan; Gido Scharfenberger-Fabian; Karteek Sreenivasaiah; Michael Thomas 001; Heribert Vollmer (Electron. Colloquium Comput. Complex., 2012)

Counting classes and the fine structure between NC1 and L. - Samir Datta; Meena Mahajan; B. V. Raghavendra Rao; Michael Thomas 001; Heribert Vollmer (Theor. Comput. Sci., 2012)

The planar k-means problem is NP-hard. - Meena Mahajan; Prajakta Nimbhorkar; Kasturi R. Varadarajan (Theor. Comput. Sci., 2012)

Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits. - Maurice J. Jansen; Meena Mahajan; B. V. Raghavendra Rao (Comput. Complex., 2013)

Small Space Analogues of Valiant's Classes and the Limitations of Skew Formulas. - Meena Mahajan; B. V. Raghavendra Rao (Comput. Complex., 2013)

Algebraic Complexity Classes. - Meena Mahajan (CoRR, 2013)

Small Depth Proof Systems. - Andreas Krebs; Nutan Limaye; Meena Mahajan; Karteek Sreenivasaiah (Electron. Colloquium Comput. Complex., 2013)

Comments on Arithmetic Complexity, Kleene Closure, and Formal Power Series. - Eric Allender; Vikraman Arvind; Meena Mahajan (Theory Comput. Syst., 2013)

Space-Efficient Approximations for Subset Sum. - Anna Gál; Jing-Tang Jang; Nutan Limaye; Meena Mahajan; Karteek Sreenivasaiah (Electron. Colloquium Comput. Complex., 2014)

Monomials, multilinearity and identity testing in simple read-restricted circuits. - Meena Mahajan; B. V. Raghavendra Rao; Karteek Sreenivasaiah (Theor. Comput. Sci., 2014)

Read-once polynomials: How many summands suffice? - Meena Mahajan; Anuj Tawari (CoRR, 2015)

Circuits, Logic and Games (Dagstuhl Seminar 15401). - Mikolaj Bojanczyk; Meena Mahajan; Thomas Schwentick; Heribert Vollmer (Dagstuhl Reports, 2015)

Feasible Interpolation for QBF Resolution Calculi. - Olaf Beyersdorff; Leroy Chew; Meena Mahajan; Anil Shukla (Electron. Colloquium Comput. Complex., 2015)

Are Short Proofs Narrow? QBF Resolution is not Simple. - Olaf Beyersdorff; Leroy Chew; Meena Mahajan; Anil Shukla (Electron. Colloquium Comput. Complex., 2015)

The shifted partial derivative complexity of Elementary Symmetric Polynomials. - Hervé Fournier; Nutan Limaye; Meena Mahajan; Srikanth Srinivasan 001 (Electron. Colloquium Comput. Complex., 2015)

Building above read-once polynomials: identity testing and hardness of representation. - Meena Mahajan; B. V. Raghavendra Rao; Karteek Sreenivasaiah (Electron. Colloquium Comput. Complex., 2015)

Sums of read-once formulas: How many summands suffice? - Meena Mahajan; Anuj Tawari (Electron. Colloquium Comput. Complex., 2015)

Homomorphism Polynomials Complete for VP. - Arnaud Durand 001; Meena Mahajan; Guillaume Malod; Nicolas de Rugy-Altherre; Nitin Saurabh (Chic. J. Theor. Comput. Sci., 2016)

Relating two width measures for resolution proofs. - Andreas Krebs; Meena Mahajan; Anil Shukla (Electron. Colloquium Comput. Complex., 2016)

Some Complete and Intermediate Polynomials in Algebraic Complexity Theory. - Meena Mahajan; Nitin Saurabh (Electron. Colloquium Comput. Complex., 2016)

Level-ordered Q-resolution and tree-like Q-resolution are incomparable. - Meena Mahajan; Anil Shukla (Inf. Process. Lett., 2016)

VNP=VP in the multilinear world. - Meena Mahajan; Nitin Saurabh; Sébastien Tavenas (Inf. Process. Lett., 2016)

Arithmetic Circuits: An Overview (Invited Talk). - Meena Mahajan (CSL, 2017)

A Quest for Structure in Complexity. - Vikraman Arvind; Meena Mahajan (Bull. EATCS, 2017)

Understanding Cutting Planes for QBFs. - Olaf Beyersdorff; Leroy Chew; Meena Mahajan; Anil Shukla (Electron. Colloquium Comput. Complex., 2017)

Lower Bound Techniques for QBF Proof Systems. - Meena Mahajan (STACS, 2018)

Building Strategies into QBF Proofs. - Olaf Beyersdorff; Joshua Blinkhorn; Meena Mahajan (Electron. Colloquium Comput. Complex., 2018)

Short Proofs in QBF Expansion. - Olaf Beyersdorff; Leroy Chew; Judith Clymo; Meena Mahajan (Electron. Colloquium Comput. Complex., 2018)

Computing the maximum using (min, +) formulas. - Meena Mahajan; Prajakta Nimbhorkar; Anuj Tawari (Electron. Colloquium Comput. Complex., 2018)

Shortest path length with bounded-alternation (min, +) formulas. - Meena Mahajan; Prajakta Nimbhorkar; Anuj Tawari (Electron. Colloquium Comput. Complex., 2018)

Sums of read-once formulas: How many summands are necessary? - Meena Mahajan; Anuj Tawari (Theor. Comput. Sci., 2018)

Are Short Proofs Narrow? QBF Resolution Is Not So Simple. - Olaf Beyersdorff; Leroy Chew; Meena Mahajan; Anil Shukla (ACM Trans. Comput. Log., 2018)

Research in theoretical computer science. - Meena Mahajan; Madhavan Mukund; Nitin Saxena 001 (Commun. ACM, 2019)

The Presburger Award for Young Scientists 2020 - Call for Nominations. - Thore Husfeldt; Meena Mahajan; Anca Muscholl (Bull. EATCS, 2019)

Lower bounds for linear decision lists. - Arkadev Chattopadhyay; Meena Mahajan; Nikhil S. Mande; Nitin Saurabh (Chic. J. Theor. Comput. Sci., 2020)

SAT and Interactions (Dagstuhl Seminar 20061). - Olaf Beyersdorff; Uwe Egly; Meena Mahajan; Cláudia Nalon (Dagstuhl Reports, 2020)

The Presburger Award for Young Scientists 2021 - Call for Nominations. - Thore Husfeldt; Meena Mahajan; Mikolaj Bojanczyk (Bull. EATCS, 2020)

Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution. - Olaf Beyersdorff; Joshua Blinkhorn; Meena Mahajan (Electron. Colloquium Comput. Complex., 2020)

Hard QBFs for Merge Resolution. - Olaf Beyersdorff; Joshua Blinkhorn; Meena Mahajan; Tomás Peitl; Gaurav Sood 001 (Electron. Colloquium Comput. Complex., 2020)

Algebraic Branching Programs, Border Complexity, and Tangent Spaces. - Markus Bläser; Christian Ikenmeyer; Meena Mahajan; Anurag Pandey 001; Nitin Saurabh (Electron. Colloquium Comput. Complex., 2020)

MaxSAT Resolution and Subcube Sums. - Yuval Filmus; Meena Mahajan; Gaurav Sood 001; Marc Vinyals (Electron. Colloquium Comput. Complex., 2020)

Computational Complexity of Discrete Problems (Dagstuhl Seminar 21121). - Anna Gál; Meena Mahajan; Rahul Santhanam; Till Tantau (Dagstuhl Reports, 2021)

The Presburger Award for Young Scientists 2022 - Call for Nominations. - Meena Mahajan (Bull. EATCS, 2021)

QBF Merge Resolution is powerful but unnatural. - Meena Mahajan; Gaurav Sood 001 (Electron. Colloquium Comput. Complex., 2022)

Query Complexity of Search Problems. - Arkadev Chattopadhyay; Yogesh Dahiya; Meena Mahajan (Electron. Colloquium Comput. Complex., 2023)

Dependency schemes in CDCL-based QBF solving: a proof-theoretic study. - Abhimanyu Choudhury; Meena Mahajan (Electron. Colloquium Comput. Complex., 2023)

New lower bounds for Polynomial Calculus over non-Boolean bases. - Yogesh Dahiya; Meena Mahajan; Sasank Mouli (Electron. Colloquium Comput. Complex., 2023)

Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111). - Anna Gál; Meena Mahajan; Rahul Santhanam; Till Tantau; Manaswi Paraashar (Dagstuhl Reports, 2023)

Hardness Characterisations and Size-width Lower Bounds for QBF Resolution. - Olaf Beyersdorff; Joshua Blinkhorn; Meena Mahajan; Tomás Peitl (ACM Trans. Comput. Log., 2023)

On (simple) decision tree rank. - Yogesh Dahiya; Meena Mahajan (Theor. Comput. Sci., 2023)

Runtime vs. Extracted Proof Size: An Exponential Gap for CDCL on QBFs. - Olaf Beyersdorff; Benjamin Böhm 001; Meena Mahajan (AAAI, 2024)

SAT and Interactions (Dagstuhl Seminar 24421). - Olaf Beyersdorff; Laura Kovács; Meena Mahajan; Martina Seidl; Kaspar Kasche (Dagstuhl Reports, 2024)

Linear threshold functions in decision lists, decision trees, and depth-2 circuits. - Yogesh Dahiya; K. Vignesh; Meena Mahajan; Karteek Sreenivasaiah (Inf. Process. Lett., 2024)

Semi-Algebraic Proof Systems for QBF. - Olaf Beyersdorff; Ilario Bonacina; Kaspar Kasche; Meena Mahajan; Luc Nicolas Spachmann (SAT, 2025)