All Stories

  1. Hard QBFs for Merge Resolution

    Article • ACM Transactions on Computation Theory, March 2024, ACM (Association for Computing Machinery)

    Meena Mahajan

  2. MaxSAT Resolution and Subcube Sums

    Article • ACM Transactions on Computational Logic, January 2023, ACM (Association for Computing Machinery)

    Meena Mahajan

  3. Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution

    Article • ACM Transactions on Computational Logic, September 2022, ACM (Association for Computing Machinery)

    Meena Mahajan

  4. Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution

    Article • May 2020, ACM (Association for Computing Machinery)

    Meena Mahajan

  5. Building Strategies into QBF Proofs

    Article • Journal of Automated Reasoning, May 2020, Springer Science + Business Media

    Meena Mahajan

  6. Depth-2 Threshold Circuits

    Article • Resonance, March 2019, Springer Science + Business Media

    Meena Mahajan

  7. Short Proofs in QBF Expansion

    Article • January 2019, Springer Science + Business Media

    Meena Mahajan

  8. Understanding cutting planes for QBFs

    Article • Information and Computation, October 2018, Elsevier

    Meena Mahajan

  9. Shortest path length with bounded-alternation $$(\min ,+)$$ ( min ...

    Article • International Journal of Advances in Engineering Sciences and Applied Mathematics, September 2018, Springer Science + Business Media

    Meena Mahajan

  10. Are Short Proofs Narrow? QBF Resolution Is Not So Simple

    Article • ACM Transactions on Computational Logic, February 2018, ACM (Association for Computing Machinery)

    Meena Mahajan

  11. Sums of read-once formulas: How many summands are necessary?

    Article • Theoretical Computer Science, January 2018, Elsevier

    Meena Mahajan

  12. Some Complete and Intermediate Polynomials in Algebraic Complexity Theory

    Article • Theory of Computing Systems, March 2017, Springer Science + Business Media

    Meena Mahajan

  13. Small Depth Proof Systems

    Article • ACM Transactions on Computation Theory, December 2016, ACM (Association for Computing Machinery)

    Meena Mahajan

  14. Space-Efficient Approximations for Subset Sum

    Article • ACM Transactions on Computation Theory, July 2016, ACM (Association for Computing Machinery)

    Meena Mahajan

  15. VNP=VPin the multilinear world

    Article • Information Processing Letters, February 2016, Elsevier

    Meena Mahajan

  16. Some Complete and Intermediate Polynomials in Algebraic Complexity Theory

    Article • January 2016, Springer Science + Business Media

    Meena Mahajan

  17. Algebraic Complexity Classes

    Article • January 2014, Springer Science + Business Media

    Meena Mahajan

  18. Counting Paths in VPA Is Complete for #NC 1

    Article • Algorithmica, March 2011, Springer Science + Business Media

    Meena Mahajan

  19. Rigidity of a simple extended lower triangular matrix

    Article • Information Processing Letters, August 2008, Elsevier

    Meena Mahajan

  20. Article • Chicago Journal of Theoretical Computer Science, January 2008, Theory of Computing Exchange

    Meena Mahajan

  21. On sorting by 3-bounded transpositions

    Article • Discrete Mathematics, July 2006, Elsevier

    Meena Mahajan

  22. Simultaneous Matchings

    Article • January 2005, Springer Science + Business Media

    Meena Mahajan

  23. The complexity of planarity testing

    Article • Information and Computation, February 2004, Elsevier

    Meena Mahajan

  24. Madhu Sudan receives Nevanlinna Prize

    Article • Resonance, December 2002, Springer Science + Business Media

    Meena Mahajan

  25. Parameterizing above Guaranteed Values: MaxSat and MaxCut

    Article • Journal of Algorithms, May 1999, Elsevier

    Meena Mahajan

  26. Article • Chicago Journal of Theoretical Computer Science, January 1997, Theory of Computing Exchange

    Meena Mahajan

  27. A note on Mod and generalised Mod classes

    Article • Information Processing Letters, July 1995, Elsevier

    Meena Mahajan

  28. A note on SpanP functions

    Article • Information Processing Letters, July 1994, Elsevier

    Meena Mahajan

  29. “Forgetful” L Systems

    Article • January 1992, Springer Science + Business Media

    Meena Mahajan

  30. SYSTOLIC PYRAMID AUTOMATA, CELLULAR AUTOMATA AND ARRAY LANGUAGES

    Article • December 1989, World Scientific Pub Co Pte Lt

    Meena Mahajan

  31. HEXAGONAL CELLULAR AUTOMATA

    Article • June 1989, World Scientific Pub Co Pte Lt

    Meena Mahajan

  32. Arithmetizing Classes Around NC 1 and L

    Article • Springer Science + Business Media

    Meena Mahajan