VIkraman Arvind - Google Scholar Citations

Cited by

	All	Since 2015
Citations	1705	488
h-index	23	11
i10-index	48	13

120

1991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920206 17 26 20 34 22 24 23 19 34 38 29 32 59 59 48 48 91 97 84 90 82 104 92 86 91 84 84 117 22

Co-authors

Johannes KoeblerProfessor of Theoretical Computer Science, Humboldt-University BerlinVerified email at informatik.hu-berlin.de
Bireswar DasAssistant Professor, IIT GandhinagarVerified email at iitgn.ac.in
Manindra AgrawalProfessor of Computer Science, IIT KanpurVerified email at iitk.ac.in
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
Srikanth SrinivasanDepartment of Mathematics, Indian Institute of Technology BombayVerified email at math.iitb.ac.in
Sebastian KuhnertHumboldt-Universität zu BerlinVerified email at informatik.hu-berlin.de
Uwe SchöningProfessor of Computer Science, Ulm UniversityVerified email at uni-ulm.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
Mitsunori OgiharaUniversity of MiamiVerified email at cs.miami.edu
Lane A. Hemaspaandra (premarriage...Professor of Computer Science, University of RochesterVerified email at cs.rochester.edu
Prajakta NimbhorkarChennai Mathematical InstituteVerified email at cmi.ac.in
nikhil r. devanurMicrosoft ResearchVerified email at microsoft.com
Frank FuhlbrückHumboldt-Universität zu BerlinVerified email at informatik.hu-berlin.de
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 International Symposium on Algorithms and Computation, 453-464, 2002	84	2002
Graph isomorphism is in SPP V Arvind, PP Kurur The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002 …, 2002	73	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	72	1992
Gems of theoretical computer science U Schöning, RJ Pruim Springer Science & Business Media, 2012	62*	2012
Isomorphism testing: Perspective and open problems V Arvind	59	2005
Graph isomorphism is in SPP V Arvind, PP Kurur Information and Computation 204 (5), 835-852, 2006	43	2006
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	43	1994
On resource-bounded measure and pseudorandomness V Arvind, J Köbler International Conference on Foundations of Software Technology and …, 1997	42	1997
New results on noncommutative and commutative polynomial identity testing V Arvind, P Mukhopadhyay, S Srinivasan Computational Complexity 19 (4), 521-558, 2010	40	2010
Derandomizing the isolation lemma and lower bounds for circuit size V Arvind, P Mukhopadhyay Approximation, Randomization and Combinatorial Optimization. Algorithms and …, 2008	39	2008
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	35	1992
On pseudorandomness and resource-bounded measure V Arvind, J Köbler Theoretical Computer Science 255 (1-2), 205-221, 2001	34	2001
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	31	2010
Approximate graph isomorphism V Arvind, J Köbler, S Kuhnert, Y Vasudev International Symposium on Mathematical Foundations of Computer Science, 100-111, 2012	30	2012
Some sieving algorithms for lattice problems V Arvind, PS Joglekar IARCS Annual Conference on Foundations of Software Technology and …, 2008	29	2008
Quasi-linear truth-table reductions to p-selective sets M Agrawal, V Arvind Theoretical Computer Science 158 (1-2), 361-370, 1996	29	1996
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	29	1987
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	27	2015
On Pseudorandomness and Resource Bounded Measure V Arvind, J Köbler Universität Ulm. Fakultät für Informatik, 1997	27	1997
Arithmetic circuits and the hadamard product of polynomials V Arvind, PS Joglekar, S Srinivasan arXiv preprint arXiv:0907.4006, 2009	24	2009

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

Upload PDF

Follow this author

Cited by

Co-authors