VIkraman Arvind
VIkraman Arvind
Professor, Computer Science, Institute of Mathematical Sciences, Chennai, India
Verified email at imsc.res.in - Homepage
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
842002
Graph isomorphism is in SPP
V Arvind, PP Kurur
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002 …, 2002
732002
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
721992
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
592005
Graph isomorphism is in SPP
V Arvind, PP Kurur
Information and Computation 204 (5), 835-852, 2006
432006
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
431994
On resource-bounded measure and pseudorandomness
V Arvind, J Köbler
International Conference on Foundations of Software Technology and …, 1997
421997
New results on noncommutative and commutative polynomial identity testing
V Arvind, P Mukhopadhyay, S Srinivasan
Computational Complexity 19 (4), 521-558, 2010
402010
Derandomizing the isolation lemma and lower bounds for circuit size
V Arvind, P Mukhopadhyay
Approximation, Randomization and Combinatorial Optimization. Algorithms and …, 2008
392008
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
351992
On pseudorandomness and resource-bounded measure
V Arvind, J Köbler
Theoretical Computer Science 255 (1-2), 205-221, 2001
342001
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
312010
Approximate graph isomorphism
V Arvind, J Köbler, S Kuhnert, Y Vasudev
International Symposium on Mathematical Foundations of Computer Science, 100-111, 2012
302012
Some sieving algorithms for lattice problems
V Arvind, PS Joglekar
IARCS Annual Conference on Foundations of Software Technology and …, 2008
292008
Quasi-linear truth-table reductions to p-selective sets
M Agrawal, V Arvind
Theoretical Computer Science 158 (1-2), 361-370, 1996
291996
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
291987
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
272015
On Pseudorandomness and Resource Bounded Measure
V Arvind, J Köbler
Universität Ulm. Fakultät für Informatik, 1997
271997
Arithmetic circuits and the hadamard product of polynomials
V Arvind, PS Joglekar, S Srinivasan
arXiv preprint arXiv:0907.4006, 2009
242009
The system can't perform the operation now. Try again later.
Articles 1–20