Uniform Derandomization from Pathetic Lower Bounds.
Eric Allender, V. Arvind, Fengming Wang. APPROX-RANDOM 2010: 380-393.

On the hardness of the noncommutative determinant.
V. Arvind, Srikanth Srinivasan. In Proc. ACM Symposium on Theory of Computing, pages 677--686, June 2010.

Circuit lower bounds, help functions, and the remote point problem.
V. Arvind, Srikanth Srinivasan. In Proc. Innovations in Computer Science, Tsinghua, 383--397, January 2010.

The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets.
V. Arvind, Srikanth Srinivasan. 27th STACS 2010: pp. 59-70, LIPIcs 5 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2010.

Arithmetic Circuits and the Hadamard Product of Polynomials.
V. Arvind, Pushkar S. Joglekar, Srikanth Srinivasan. FSTTCS 2009: 25-36.

On lower bounds for constant width arithmetic circuits.
Vikraman Arvind, Pushkar~S. Joglekar, and Srikanth Srinivasan. In Proc. ISAAC conference, volume LNCS 5878, pages 637--646, Springer 2009.

Arithmetic Circuits, Monomial Algebras and Finite Automata.
Vikraman Arvind, Pushkar S. Joglekar. In Proceedings of the 34th MFCS conference, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009.

Quantum Query Complexity of Multilinear Identity Testing.
Vikraman Arvind, Partha Mukhopadhyay. In Proceedings of the 26th STACS conference, February 26-28, 2009, Freiburg, Germany.

Some Sieving Algorithms for Lattice Problems.
V. Arvind, Pushkar S. Joglekar. In Proceedings of the 28th FSTTCS conference 2008, December 9-11, 2008, Bangalore, India.

Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size.
V. Arvind, Partha Mukhopadhyay. Proceedings of the 12th International Workshop, RANDOM 2008, pp.276-289, Boston, MA, USA, August 25-27, 2008, Springer

The Orbit problem is in the GapL hierarchy.
V. Arvind, T.C. Vijayaraghavan. Proceedings of the 14th Annual International Conference, COCOON 2008, pp.160-169, Dalian, China, June 27-29 2008, Springer.

New results on Noncommutative and Commutative Polynomial Identity Testing.
V. Arvind, Partha Mukhopadhyay, Srikanth Srinivasan. Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, pp.268-279, 23-26 June 2008, College Park, Maryland, USA.

A Logspace Algorithm for Partial 2-Tree Canonization.
V. Arvind, Bireswar Das, Johannes Köbler. Third International Computer Science Symposium in Russia (CSR 2008), Moscow, Russia, June 7-12, 2008. Lecture Notes in Computer Science 5010 Springer 2008, 40-51.

Algorithmic Problems for Metrics on Permutation Groups.
V. Arvind, Pushkar S. Joglekar. 34th Conference on Current Trends in Theory and Practice of Computer Science, NovĂ˝ Smokovec, Slovakia, January 19-25, 2008, Proceedings. Lecture Notes in Computer Science 4910 Springer 2008, 136-147 (SOFSEM 2008).

The Monomial Ideal Membership Problem and Polynomial Identity Testing.
V. Arvind, Partha Mukhopadhyay. Information and Computation, to appear.
Conference version: Proc. 18th International Symposium on Algorithms and Computation (ISAAC 2007), Sendai, Japan, December 17-19, 2007, Proceedings. Lecture Notes in Computer Science 4835 Springer 2007, 800-811.

The Space Complexity of k -Tree Isomorphism.
V. Arvind, Bireswar Das, Johannes Köbler. 18th International Symposium on Algorithms and Computation (ISAAC 2007), Sendai, Japan, December 17-19, 2007, Proceedings. Lecture Notes in Computer Science 4835 Springer 2007, 822-833.

Parameterized Learnability of k-Juntas and related Problems.
V. Arvind, Johannes Köbler and Wolfgang Lindner. The 18th International Conference on Algorithmic Learning Theory. LNAI, Springer, Oct 1-4, 2007. (ALT 2007). Journal version: Theor. Comput. Sci. 410(47-49): 4928-4936 (2009).

On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach.
V. Arvind, Christine Cheng, and N. Devanur. SIAM Journal of Discrete Mathematics 22:4(2008) pp.1297-1324.

The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem.
V. Arvind and Jacobo Tor\'an. Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC 2006). LNCS, Springer, to appear, Kolkata, Dec 18-20, 2006.

On Isomorphism and Canonization of Tournaments and Hypertournaments.
V. Arvind, Bireswar Das and Partha Mukhopadhyay. Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC 2006). LNCS, Springer, to appear, Kolkata, Dec 18-20, 2006. Journal Version: Journal of Computer and System Sciences, to appear.

A Polynomial Time Nilpotence Test for Galois Groups and Related Results
V. Arvind and Piyush P Kurur. Proceedings of the 31st Mathematical Foundations of Computer Science, MFCS 2006, LNCS, Springer, to appear, Stará Lesná, Slovakia, August 28 - September 1, 2006.

The Complexity of Black-Box Ring Problems
V. Arvind, Bireswar Das, and Partha Mukhopadhyay. Proceedings of the The Twelfth Annual International Computing and Combinatorics Conference (COCOON'06), LNCS, Springer, to appear, Taipei, Taiwan, August 15-18, 2006.

SZK Proofs for Black-Box Group Problems
V. Arvind and Bireswar Das. Proceedings of the first International Computer Science Symposium in Russia, CSR 2006, LNCS Volume 3967, Springer Verlag, St. Petersburg, Russia, June 2006,pp. 6--17. In a special issue of TOCS journal.

On Hypergraph and Graph Isomorphism for Bounded Color Classes
V. Arvind and Johannes Köbler. Proceedings of the 23rd Symposium on Theoretical Aspects of Computer Science, LNCS Volume 3884, Springer Verlag, Feb 2006, pp. 384--395.

Isomorphism Testing: Perspective and Open Problems
V. Arvind and Jacobo Torán. The Computational Complexity Column, Bulletin European Association of Theoretical Computer Science, Number 86, June, 2005.

Bounded Color Multiplicity Graph Isomorphism in in the #L Hierarchy
V. Arvind, Piyush P Kurur, and T.C. Vijayaraghavan. 20th IEEE Conference on Computational Complexity, 2005.

The Complexity of solving Linear Equations over a Finite Ring
V. Arvind and T.C. Vijayaraghavan. In Proceedings of the 22nd Symposium on Theoretical Aspects of Computer Science, LNCS, Springer. Feb 2005.

Symmetric Breaking in Trees and Planar Graphs by vertex coloring.
V. Arvind and N. Devanur. In Proceedings of the 8th Nordic Combinatorial Conference, October 2004.

Solvable Group Isomorphism is (almost) in NP\cap coNP
V. Arvind and Jacobo Toran. Proceedings of the 19th IEEE Conference on Computational Complexity, pp. 91--103, June 2004.

Abelian Permutation Group Problems and Logspace Counting Classes
V. Arvind and T.C. Vijayaraghavan. Proceedings of the 19th IEEE Conference on Computational Complexity, pp. 204--214, June 2004.

On the Complexity of Computing Units in a Number Field
V. Arvind, and Piyush P Kurur. Proceedings of the sixth Algorithmic Number Theory Symposium, pp. 72-86, June 2004.

The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems.
V. Arvind and R. Schuler, quant-ph/0212048. In proceedings of the 14th Intl. Symposium on Algorithms, Automata and Computation, Dec 2003.

Non-Stabilizer Quantum Codes from Abelian Subgroups of the Error Group.
V. Arvind, and Piyush P Kurur, and K.R Parthasarathy, Volume in honour of Prof. A. V. Holevo's 60th birthday, Editor O. Hirota, pp. 1--30, 2004, Rinton Press, New Jersey. Preliminary version in quant-ph/0210097.

A Family of Quantum Stabilizer Codes Based on the Weyl Commutation Relations over a Finite Field.
V. Arvind and K.R Parthasarathy, Volume in honour of Prof. C.S. Seshadri's 70th birthday, Hindustan book agency, June 2003.

Upper Bounds for the Complexity of some Galois Theory Problems
V. Arvind, and Piyush P Kurur. In proceedings of the 14th Intl. Symposium on Algorithms, Automata and Computation, Dec 2003.

Arithmetic Complexity, Kleene Closure, and Formal Power Series.
E.W. Allender, V. Arvind, and M. Mahajan, Theory of Computing Systems, vol. 36, pp. 303--328, 2003.

Graph Isomorphism is in SPP
V. Arvind, and Piyush P Kurur, IEEE Foundations of Computer Science, pp. 743-750, 2002. The downloadable version is the older technical report.

Approximation Algorithms for Some Parameterized Counting Problems
V. Arvind and V. Raman, 13th Intl. Symposium on Algorithms, Automata, and Computation, Lecture Notes in Computer Science 2518, pp. 453-464, Springer 2002. The downloadable version is the older technical report.

New Lowness Results for ZPP(NP) and other Complexity Classes.
V. Arvind and J. Köbler, Journal of Computer and System Sciences, 65(2): 257-277, 2002. Preliminary version in Proceedings of the 17th Annual Symp. on Theoretical Aspects of Computer Science, Springer-Verlag, LNCS 1770, 431--442, 2000.

Symmetric Breaking in Trees and Planar Graphs by vertex coloring.
V. Arvind and N. Devanur, Journal of Algorithms, under revision.

Nondeterministic Instance Complexity and Hard-To-Prove Tautologies.
V. Arvind, J. Köebler, M. Mundhenk, and J. Toran, 17th Annual Symp. on Theoretical Aspects of Computer Science, February 2000.

Sparse sets, approximable sets, and parallel queries to NP
V. Arvind and J. Toran, Information Processing Letters Volume 69, Issue 4 , 26 February 1999, Pages 181-188. Preliminary version in Proc. 16th Annual Symp. on Theoretical Aspects of Computer Science, February 1999.

The Query Complexity of Program Checking by Constant-Depth Circuits.
V. Arvind, K.V. Subrahmanyam, N.V. Vinodchandran, Chicago Journal of Theoretical Computer Science, 2, 2002. Preliminary version in the Proceedings of the 10th Inl. Symposium on Algorithms Automata and Computation, LNCS, Springer, 1999.

The complexity of modular graph automorphism
V. Arvind, R. Beigel, and A. Lozano, SIAM Journal on Computing, vol 30, no. 4, pp. 1299--1320, 2000. Preliminary version in Proc. 15th Annual Symp. on Theoretical Aspects of Computer Science, LNCS 1373, Springer-Verlag, February 1998.

On resource-bounded measure and pseudorandomness
V. Arvind and J. Köbler, Theoretical Computer Science Volume 255, Issues 1-2 , 28 March 2001, Pages 205-221. Preliminary version in Proc. 17th Conference on Foundations of Software Technology and Theoretical Computer Science, LNCS Vol. 1346, 235-249, 1997.

A nonadaptive NC checker for permutation group intersection
V. Arvind and J. Toran, Theoretical Computer Science, Volume 259, Issues 1-2 , 28 May 2001, Pages 597-611. Preliminary version in the Proceedings of the 12th Conference on Computational Complexity, IEEE Computer Society, June 1997.

The counting complexity of group-definable languages
V. Arvind and N.V. Vinodchandran, Theoretical Computer Science Volume 242, Issues 1-2 , 6 July 2000, Pages 199-218.

Constructivizing membership proofs in complexity classes.
V. Arvind, In International Journal of Foundations of Computer Science, 8(4) 433--442, 1997, World Scientific.

Solvable black-box group problems are low for PP.
V. Arvind and N.V. Vinodchandran, Theoretical Computer Science, 180 (1997), 17-47.

Exact learning via teaching assistants.
V. Arvind and N.V. Vinodchandran, Theoretical Computer Science Volume 241, Issues 1-2 , 28 June 2000, Pages 51-81. Special issue of the Proc. 8th Intl. Workshop on Algorithmic Learning Theory, LNAI Vol. 1316 291-306, October 1997.

The complexity of exactly learning algebraic concepts
V. Arvind and N. V. Vinodchandran, In Proc. 7th Intl. Workshop on Algorithmic Learning Theory, LNAI Vol. 1160, 100-112, Oct. 1996.

A note on decision versus search for graph automorphism.
M. Agrawal and V. Arvind, In Information and Computation, Vol. 131:2 (1996), 179-189.

Quasi-linear truth-table reductions to p-selective sets.
M. Agrawal and V. Arvind, Theoretical Computer Science, 158, 361-370, May 1996.

Geometric sets of low information content.
M. Agrawal and V. Arvind, Theoretical Computer Science, 158, 193-219, May 1996.

On reductions to sets that avoid EXPSPACE.
V. Arvind, J. Köbler, and M. Mundhenk, Information Processing Letters Volume 56, Issue 2 , 27 October 1995, Pages 109-114. Preliminary version was presented at MFCS 1992.

On helping and interactive proof systems.
V. Arvind, J. Köbler, and R. Schuler, International Journal of Foundations of Computer Science, 6(2), 137-153, 1995. Preliminary version was presented at the ISAAC conference, 1994.

Monotonous and randomized reductions to sparse sets.
V. Arvind, J. Köbler, and M. Mundhenk, In Informatique Theorique et Applications 30(2), 1996, 155-179. Preliminary version was presented at the FSTTCS conference, 1992.