VIkraman Arvind

Cited by

	All	Since 2017
Citations	1881	541
h-index	24	12
i10-index	55	16

160

120

199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120226 13 22 20 35 26 19 17 17 33 34 27 28 58 57 46 42 83 95 77 97 75 101 88 84 88 82 76 104 74 141 59

Public access

View all

10 articles

2 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
Pushkar JoglekarAsst. Prof. at Vishwakarma Institute of Technology, PuneVerified email at vit.edu
Bireswar DasAssociate Professor, IIT GandhinagarVerified email at iitgn.ac.in
Manindra AgrawalProfessor of Computer Science, IIT KanpurVerified email at iitk.ac.in
Jacobo ToranProfessor for theoretical computer science, University of UlmVerified email at uni-ulm.de
Srikanth SrinivasanDepartment of Mathematics, Indian Institute of Technology BombayVerified email at math.iitb.ac.in
Sebastian Kuhnertformerly Humboldt-Universität zu BerlinVerified email at sebastian-kuhnert.de
Oleg VerbitskyІнститут прикладних проблем механіки і математики ім.Я.С.Підстригача, Humboldt Universität zu BerlinVerified email at informatik.hu-berlin.de
Yadu VasudevAssistant Professor, IIT MadrasVerified email at cse.iitm.ac.in
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 MahajanProfessor at The Institute of Mathematical Sciences, HBNI, Chennai, IndiaVerified email at imsc.res.in
Uwe SchöningProfessor of Computer Science, Ulm University, retiredVerified email at uni-ulm.de
Frank FuhlbrückHumboldt-Universität zu BerlinVerified email at informatik.hu-berlin.de
Mitsunori OgiharaUniversity of MiamiVerified email at cs.miami.edu
Prajakta NimbhorkarChennai Mathematical InstituteVerified email at cmi.ac.in
Lane A. Hemaspaandra (premarriage...Professor of Computer Science, University of RochesterVerified email at cs.rochester.edu
Richard BeigelTemple UniversityVerified email at temple.edu
Christine ChengUniversity of Wisconsin-MilwaukeeVerified email at uwm.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
Graph isomorphism is in SPP V Arvind, PP Kurur Information and Computation 204 (5), 835-852, 2006	125	2006
Approximation algorithms for some parameterized counting problems V Arvind, V Raman International Symposium on Algorithms and Computation, 453-464, 2002	103	2002
Reductions to sets of low information content V Arvind, Y Han, L Hemachandra, J Köbler, A Lozano, M Mundhenk, ... International Colloquium on Automata, Languages, and Programming, 162-173, 1992	73	1992
Isomorphism testing: Perspective and open problems V Arvind	65	2005
New results on noncommutative and commutative polynomial identity testing V Arvind, P Mukhopadhyay, S Srinivasan Computational Complexity 19 (4), 521-558, 2010	47	2010
Derandomizing the isolation lemma and lower bounds for circuit size V Arvind, P Mukhopadhyay Approximation, Randomization and Combinatorial Optimization. Algorithms and …, 2008	45	2008
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	44	2020
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	44*	2010
On the power of color refinement V Arvind, J Köbler, G Rattan, O Verbitsky International Symposium on Fundamentals of Computation Theory, 339-350, 2015	41	2015
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	40	1994
Approximate graph isomorphism V Arvind, J Köbler, S Kuhnert, Y Vasudev International Symposium on Mathematical Foundations of Computer Science, 100-111, 2012	37	2012
On pseudorandomness and resource-bounded measure V Arvind, J Köbler Theoretical Computer Science 255 (1-2), 205-221, 2001	37	2001
On resource-bounded measure and pseudorandomness V Arvind, J Köbler International Conference on Foundations of Software Technology and …, 1997	37	1997
On bounded truth-table, conjunctive, and randomized reductions to sparse sets V Arvind, J Köbler, M Mundhenk International Conference on Foundations of Software Technology and …, 1992	34	1992
Some sieving algorithms for lattice problems V Arvind, PS Joglekar IARCS Annual Conference on Foundations of Software Technology and …, 2008	32	2008
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	31	1987
The ideal membership problem and polynomial identity testing V Arvind, P Mukhopadhyay Information and Computation 208 (4), 351-363, 2010	30	2010
Arithmetic circuits and the hadamard product of polynomials V Arvind, PS Joglekar, S Srinivasan arXiv preprint arXiv:0907.4006, 2009	29	2009
Nonstabilizer quantum codes from abelian subgroups of the error group V Arvind, PP Kurur, KR Parthasarathy arXiv preprint quant-ph/0210097, 2002	29	2002
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	29	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 this author

Cited by

Co-authors