Aarhus University Seal

Meet Srikanth Srinivasan, new Associate Professor

In 2020, Srikanth Srinivasan started as Associate Professor at the Department of Computer Science.

Srikanth's research interests lie primarily in the field of computational complexity, which seeks to understand the computational resources in order to perform natural computational tasks. He is also greatly interested in understanding other fields of scientific endeavour through the lens of complexity theory, especially the use of complexity-theoretic hypotheses as a way to explain the intractability of naturally occurring questions in other areas.

Srikanth's research has focused on the use of algebraic and probabilistic techniques in circuit complexity and pseudorandomness. In particular, he has worked on problems in circuit complexity that aim to strengthen our understanding of different families of Boolean circuits; in the use of depth-reduction techniques to solve algebraic variants of the P vs. NP question; and on meta-algorithmic questions regarding satisfiability and learning algorithms for classes of Boolean circuits.

Academic background

Srikanth got his PhD degree from the Institute of Mathematical Sciences, Chennai, Tamil Nadu, India under the guidance of V Arvind in 2011. He then spent 2 years at the Institute of Advanced Study (Princeton, USA) and Rutgers University (New Jersey, USA) as a postdoc and 8 years at the Indian Institute of Technology, Bombay as a member of the faculty in the mathematics department.  

Selected publications

Some of his publications from these areas are:

  • Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan:
    An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas. FOCS 2014: 61-70.
  • Ruiwen Chen, Rahul Santhanam, Srikanth Srinivasan: Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits. Computational Complexity Conference 2016: 1:1-1:35.
  • Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
    A fixed-depth size-hierarchy theorem for AC0[2] via the coin problem. STOC 2019: 442-453.

Extra info