VIkraman Arvind

Cited by

	All	Since 2019
Citations	2204	692
h-index	26	14
i10-index	62	17

160

120

19911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320246 15 22 23 32 30 20 17 18 32 26 29 31 59 55 50 51 86 90 77 93 72 101 92 82 88 77 78 107 79 127 143 125 111

Public access

View all

12 articles

3 articles

available

not available

Based on funding mandates

Co-authors

Johannes KoeblerProfessor of Theoretical Computer Science, Humboldt-University BerlinVerified email at informatik.hu-berlin.de
Oleg VerbitskyІнститут прикладних проблем механіки і математики ім.Я.С.Підстригача, Humboldt Universität zu BerlinVerified email at informatik.hu-berlin.de
Pushkar JoglekarAsst. Prof. at Vishwakarma Institute of Technology, PuneVerified email at vit.edu
Jacobo ToranProfessor for theoretical computer science, University of UlmVerified email at uni-ulm.de
Bireswar DasAssociate Professor, IIT GandhinagarVerified email at iitgn.ac.in
Manindra AgrawalProfessor of Computer Science, IIT KanpurVerified email at iitk.ac.in
Srikanth SrinivasanDepartment of Computer Science, University of CopenhagenVerified email at di.ku.dk
Sebastian Kuhnertformerly Humboldt-Universität zu BerlinVerified email at sebastian-kuhnert.de
Yadu VasudevAssistant Professor, IIT MadrasVerified email at cse.iitm.ac.in
Frank FuhlbrückHumboldt-Universität zu Berlin (until Dec. 2023)Verified email at alumni.hu-berlin.de
Eric AllenderRutgers UniversityVerified email at cs.rutgers.edu
Antoni LozanoProfessor of Computer Science, Universitat Politècnica de CatalunyaVerified email at cs.upc.edu
Rainer SchulerVerified email at uni-ulm.de
Meena MahajanThe Institute of Mathematical Sciences, (a CI of Homi Bhabha National Institute), Chennai, IndiaVerified email at imsc.res.in
Uwe SchöningProfessor of Computer Science, Ulm University, retiredVerified email at uni-ulm.de
Mitsunori OgiharaUniversity of MiamiVerified email at cs.miami.edu
Prajakta NimbhorkarChennai Mathematical InstituteVerified email at cmi.ac.in
nikhil r. devanurAmazonVerified email at nikhildevanur.com
Lane A. Hemaspaandra (premarriage...Professor of Computer Science, University of RochesterVerified email at cs.rochester.edu
Richard BeigelTemple UniversityVerified email at temple.edu

VIkraman Arvind

Professor, Computer Science, Institute of Mathematical Sciences, Chennai, India

Verified email at imsc.res.in - Homepage

Computational Complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Approximation algorithms for some parameterized counting problems V Arvind, V Raman Algorithms and Computation: 13th International Symposium, ISAAC 2002 …, 2002	116	2002
On weisfeiler-leman invariance: Subgraph counts and related graph properties V Arvind, F Fuhlbrück, J Köbler, O Verbitsky Journal of Computer and System Sciences 113, 42-59, 2020	94	2020
Graph isomorphism is in SPP V Arvind, PP Kurur The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002 …, 2002	77	2002
Reductions to sets of low information content V Arvind, Y Han, L Hemachandra, J Köbler, A Lozano, M Mundhenk, ... Automata, Languages and Programming: 19th International Colloquium Wien …, 1992	77	1992
On the power of color refinement V Arvind, J Köbler, G Rattan, O Verbitsky Fundamentals of Computation Theory: 20th International Symposium, FCT 2015 …, 2015	69	2015
Isomorphism Testing: Perspective and Open Problems. V Arvind, J Torán Bull. EATCS 86, 66-84, 2005	68	2005
Graph isomorphism is in SPP V Arvind, PP Kurur Information and Computation 204 (5), 835-852, 2006	65	2006
On pseudorandomness and resource-bounded measure V Arvind, J Köbler Theoretical Computer Science 255 (1-2), 205-221, 2001	65	2001
New results on noncommutative and commutative polynomial identity testing V Arvind, P Mukhopadhyay, S Srinivasan Computational Complexity 19 (4), 521-558, 2010	56	2010
On the hardness of the noncommutative determinant V Arvind, S Srinivasan Proceedings of the forty-second ACM symposium on Theory of computing, 677-686, 2010	49*	2010
Approximate graph isomorphism V Arvind, J Köbler, S Kuhnert, Y Vasudev Mathematical Foundations of Computer Science 2012: 37th International …, 2012	44	2012
Derandomizing the isolation lemma and lower bounds for circuit size V Arvind, P Mukhopadhyay Approximation, Randomization and Combinatorial Optimization. Algorithms and …, 2008	43	2008
Polynomial time truth-table reductions to P-selective sets M Agrawal, V Arvind Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory …, 1994	41	1994
On resource-bounded measure and pseudorandomness V Arvind, J Köbler Foundations of Software Technology and Theoretical Computer Science: 17th …, 1997	39	1997
Some sieving algorithms for lattice problems V Arvind, PS Joglekar IARCS Annual Conference on Foundations of Software Technology and …, 2008	37	2008
Graph isomorphism, color refinement, and compactness V Arvind, J Köbler, G Rattan, O Verbitsky computational complexity 26, 627-685, 2017	35	2017
On bounded truth-table, conjunctive, and randomized reductions to sparse sets V Arvind, J Köbler, M Mundhenk Foundations of Software Technology and Theoretical Computer Science: 12th …, 1992	35	1992
An O (n2) algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all Horn sentences V Arvind, S Biswas Information Processing Letters 24 (1), 67-69, 1987	33	1987
Arithmetic circuits and the hadamard product of polynomials V Arvind, PS Joglekar, S Srinivasan arXiv preprint arXiv:0907.4006, 2009	32	2009
If NP has polynomial-size circuits, then MA= AM V Arvind, J Köbler, U Schöning, R Schuler Theoretical Computer Science 137 (2), 279-282, 1995	32	1995

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors