V. Arvind Theoretical Computer Science Research Interests My research interests are primarily in computational complexity theory. These include structural aspects of complexity theory, randomized and algebraic computation. Of late, I've also done some work on quantum codes and computation. In general, the interplay between the theory of computing and mathematics fascinates me. publications
  • My co-authors recent teaching activity

    Links

    Personal Information

    Link a Aaronson, Scott Ablayev, Farid Allender, Eric Alon, Noga Ambainis, Andris Amir, Ronen Andrei, Neculai Arora, Sanjeev Arsham, Hossein Arvind, V. Auer, Peter Awasthi, Amit Balcazar, Jose L. Barak, Boaz Beame,Paul Beaver, Donald Beigel,Richard Beimel, Amos Bellare, Mihir Ben-Amram, Amir Ben-Or, Michael. Ben-Sasson, Eli Blaeser, Markus Bollig, Beate Bonet, Maria Luisa Buss, Samuel Cahit, Ibrahim Calude, Cristian Case, John Chaitin, Greg Chakrabarti, Amit Chang, Richard Chazelle, Bernard Chen, Hubie Chen, Jianer Codenotti, Bruno Crescenzi, Pierluigi Czumaj,Artur Dantsin,Evgeny