V. Arvind

V. Arvind is a Professor in the Theoretical Computer Science faculty at the Institute of Mathematical Sciences (IMSc), Chennai. His research is centered on computational complexity theory, with a focus on structural complexity, randomized and algebraic computation, and quantum information and computation. He explores the deep connections between theoretical computer science and mathematics.

• Institution: Institute of Mathematical Sciences (IMSc), Chennai
• School: Theoretical Computer Science
• Academic Rank: Professor

Arvind's research interests include computational complexity, structural complexity theory, algebraic computation, derandomization, and quantum computing. He is particularly interested in the interplay between mathematical structures and computation. His work often bridges theoretical computer science with algebra, combinatorics, and logic.

His recent publications, primarily expository articles in the EATCS Bulletin’s Computational Complexity Column, cover a wide range of topics such as robust oracle machines, the Alon-Roichman theorem, noncommutative arithmetic circuits, graph isomorphism, and quantum computation. These works reflect trends in foundational complexity theory, algebraic methods in computation, and the exploration of quantum models. The articles emphasize structural insights, lower bounds, and connections to mathematical disciplines.

Professional Service and Editorial Roles:

• Associate Editor, ACM Transactions on Computation Theory
• Editor, EATCS Computational Complexity Column (since June 2011)
• Editorial Board Member, International Journal of Computer Mathematics (2009–2013)
• Co-organizer, ICM Satellite Conference on Algebraic and Probabilistic Aspects of Combinatorics and Computing
• Program Committee Member for WALCOM 2014, STACS 2012, COCOON 2009, FSTTCS (multiple years, including chair roles), CCC 2006, INDOCRYPT (2002, 2005), and others

Teaching: Arvind has taught advanced courses including Computational Complexity, Algorithms, Algebra and Computation, and Discrete Mathematics, often based on foundational texts and notes from leading experts. Lecture notes from his courses have been compiled by students and collaborators.

Collaborations: He has an extensive list of co-authors, including prominent researchers such as Manindra Agrawal, Eric Allender, Johannes Köbler, Meena Mahajan, Jacobo Torán, and Ramprasad Saptharishi, indicating strong collaborative research networks in complexity theory and algorithms.