Meena Mahajan
Meena Mahajan
Professor at The Institute of Mathematical Sciences, HBNI, Chennai, India
Verified email at - Homepage
Cited by
Cited by
The planar k-means problem is NP-hard
M Mahajan, P Nimbhorkar, K Varadarajan
International Workshop on Algorithms and Computation, 274-285, 2009
Parameterizing above guaranteed values: MaxSat and MaxCut
M Mahajan, V Raman
J. Algorithms 31 (2), 335-354, 1999
A combinatorial algorithm for the determinant
M Mahajan, V Vinay
SODA, 730-738, 1997
Parameterizing above or below guaranteed values
M Mahajan, V Raman, S Sikdar
Journal of Computer and System Sciences 75 (2), 137-153, 2009
Non-commutative arithmetic circuits: depth reduction and size lower bounds
E Allender, J Jiao, M Mahajan, V Vinay
Theoretical Computer Science 209 (1-2), 47-86, 1998
The complexity of planarity testing
E Allender, M Mahajan
Information and Computation 189 (1), 117-134, 2004
Determinant: Old algorithms, new insights
M Mahajan, V Vinay
SIAM journal on Discrete Mathematics 12 (4), 474-490, 1999
The combinatorial approach yields an NC algorithm for computing Pfaffians
M Mahajan, PR Subramanya, V Vinay
Discrete Applied Mathematics 143 (1-3), 1-16, 2004
A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs
M Mahajan, KR Varadarajan
Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000
Simultaneous matchings: Hardness and approximation
M Kutz, K Elbassioni, I Katriel, M Mahajan
Journal of Computer and System Sciences 74 (5), 884-897, 2008
Upper bounds for monotone planar circuit value and variants
N Limaye, M Mahajan, JMN Sarma
Computational Complexity 18 (3), 377, 2009
Feasible interpolation for QBF resolution calculi
O Beyersdorff, L Chew, M Mahajan, A Shukla
International Colloquium on Automata, Languages, and Programming, 180-192, 2015
Arithmetic complexity, Kleene closure, and formal power series
E Allender, V Arvind, M Mahajan
Theory of Computing Systems 36 (4), 303-328, 2003
Planarity, determinants, permanents, and (unique) matchings
S Datta, R Kulkarni, N Limaye, M Mahajan
ACM Transactions on Computation Theory (TOCT) 1 (3), 1-20, 2010
Are Short Proofs Narrow? QBF Resolution Is Not So Simple
O Beyersdorff, L Chew, M Mahajan, A Shukla
ACM Transactions on Computational Logic (TOCL) 19 (1), 1-26, 2017
Approximate block sorting
M Mahajan, R Rama, V Raman, S Vijaykumar
International Journal of Foundations of Computer Science 17 (02), 337-355, 2006
On the complexity of matrix rank and rigidity
M Mahajan, J Sarma
International Computer Science Symposium in Russia, 269-280, 2007
Arithmetizing Classes Around NC^1 and L
N Limaye, M Mahajan, BVR Rao
Theory of Computing Systems 46 (3), 499-522, 2010
Algebraic complexity classes
M Mahajan
Perspectives in Computational Complexity, 51-75, 2014
Small-space analogues of Valiant’s classes
M Mahajan, BVR Rao
International Symposium on Fundamentals of Computation Theory, 250-261, 2009
The system can't perform the operation now. Try again later.
Articles 1–20