Meena Mahajan

Citado por

	Todos	Desde 2020
Citações	2914	942
Índice h	24	14
Índice i10	48	19

220

110

165

199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202510 21 30 23 23 39 32 27 48 64 51 90 116 118 152 142 135 140 134 160 179 163 175 201 182 189 170 14

Acesso público

Ver todos

16 artigos

0 artigo

disponível

não disponível

Com base nas autorizações de financiamento

Coautores

Nutan LimayeAssociate Professor, Computer Science, IT University of Copenhagen, DenmarkE-mail confirmado em itu.dk
Vinay VJed-i Technologies Pvt LtdE-mail confirmado em jed-i.in
Venkatesh RamanProfessor, IMSc ChennaiE-mail confirmado em imsc.res.in
Olaf BeyersdorffProfessor of Theoretical Computer Science, Friedrich Schiller University Jena, GermanyE-mail confirmado em uni-jena.de
Prajakta NimbhorkarChennai Mathematical InstituteE-mail confirmado em cmi.ac.in
Raghavendra Rao B VIIT MadrasE-mail confirmado em cse.iitm.ac.in
Kasturi VaradarajanProfessor of Computer Science, University of IowaE-mail confirmado em uiowa.edu
Eric AllenderRutgers UniversityE-mail confirmado em cs.rutgers.edu
VIkraman ArvindProfessor, Computer Science, Institute of Mathematical Sciences, Chennai, IndiaE-mail confirmado em imsc.res.in
Anil ShuklaDepartment of CSE, IIT RoparE-mail confirmado em iitrpr.ac.in
Jayalal SarmaIndian Institute of Technology Madras, Chennai, IndiaE-mail confirmado em cse.iitm.ac.in
Nitin SaurabhIIT HyderabadE-mail confirmado em cse.iith.ac.in
Samir DattaProfessor of Computer Science, Chennai Mathematical InstituteE-mail confirmado em cmi.ac.in
Raghav KulkarniCentre for Quantum Technologies, SingaporeE-mail confirmado em cs.uchicago.edu
Heribert VollmerProfessor für Theoretische Informatik, Leibniz Universität HannoverE-mail confirmado em thi.uni-hannover.de
Gaurav SoodAssistant Professor, Indian Institute of Technology, MandiE-mail confirmado em iitmandi.ac.in
Tomáš PeitlTU WienE-mail confirmado em ac.tuwien.ac.at
Yogesh DahiyaTata Institute of Fundamental Research, Mumbai, IndiaE-mail confirmado em imsc.res.in
Arkadev ChattopadhyayProfessor at Tata Institute of Fundamental ResearchE-mail confirmado em tifr.res.in
Antoine MeyerUniversité Gustave EiffelE-mail confirmado em univ-eiffel.fr

Seguir

Meena Mahajan

The Institute of Mathematical Sciences, (a CI of Homi Bhabha National Institute), Chennai, India

E-mail confirmado em imsc.res.in - Página inicial

computational complexity discrete algorithms automata theory


Título Ordenar por citações Ordenar por ano Ordenar por título	Citado por Citado por	Ano
The planar k-means problem is NP-hard M Mahajan, P Nimbhorkar, K Varadarajan Theoretical Computer Science 442, 13-21, 2012	926	2012
Parameterizing above guaranteed values: MaxSat and MaxCut M Mahajan, V Raman Journal of Algorithms 31 (2), 335-354, 1999	313	1999
Determinant: Combinatorics, Algorithms, and Complexity M Mahajan, V Vinay Chicago Journal of Theoretical Computer Science 1997 (5), 1997	161	1997
Parameterizing above or below guaranteed values M Mahajan, V Raman, S Sikdar Journal of Computer and System Sciences 75 (2), 137-153, 2009	125	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	118	1998
The complexity of planarity testing E Allender, M Mahajan Information and Computation 189 (1), 117-134, 2004	68	2004
A combinatorial algorithm for the determinant M Mahajan, V Vinay SODA, 730-738, 1997	58	1997
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	55	2000
Determinant: Old algorithms, new insights M Mahajan, V Vinay SIAM journal on Discrete Mathematics 12 (4), 474-490, 1999	48	1999
Feasible interpolation for QBF resolution calculi O Beyersdorff, L Chew, M Mahajan, A Shukla International Colloquium on Automata, Languages, and Programming, 180-192, 2015	44	2015
Algebraic complexity classes M Mahajan Perspectives in Computational Complexity: The Somenath Biswas Anniversary …, 2014	42	2014
Arithmetic complexity, Kleene closure, and formal power series E Allender, V Arvind, M Mahajan Theory of Computing Systems 36, 303-328, 2003	37*	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	36	2010
Colored hypergraph isomorphism is fixed parameter tractable V Arvind, B Das, J Köbler, S Toda IARCS Annual Conference on Foundations of Software Technology and …, 2010	36*	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	35	2017
Approximate block sorting M Mahajan, R Rama, V Raman, S Vijaykumar International Journal of Foundations of Computer Science 17 (02), 337-355, 2006	29	2006
On the complexity of matrix rank and rigidity M Mahajan, J Sarma MN International Computer Science Symposium in Russia, 269-280, 2007	27	2007
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	27	2004
Upper bounds for monotone planar circuit value and variants N Limaye, M Mahajan, JMN Sarma Computational Complexity 18 (3), 377-412, 2009	26	2009
A combinatorial algorithm for Pfaffians M Mahajan, PR Subramanya, V Vinay International Computing and Combinatorics Conference, 134-143, 1999	26	1999

O sistema não pode executar a operação agora. Tente novamente mais tarde.

Artigos 1–20

Citações por ano

Citações duplicadas

Citações mescladas

Adicionar coautoresCoautores

Seguir

Citado por

Coautores