Srikanth Srinivasan
Postdoctoral Researcher
DIMACS, Rutgers
I did my Ph.D. at The Institute of Mathematical
Sciences. My advisor was V. Arvind. I spent the
2010-2011 academic year at the Institute for Advanced
Study; I was hosted by Avi
Wigderson.
My research interests lie mainly in Complexity theory. I am especially
interested in Circuit complexity (boolean and arithmetic),
Pseudorandom objects, and related areas of mathematics.
Publications
- Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan: New Results
on Noncommutative and Commutative Polynomial Identity Testing. CCC 2008: 268-279. Tech report on arxiv.
- Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan: On Lower
Bounds for Constant Width Arithmetic Circuits. ISAAC 2009. Tech report on
arxiv.
- Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan: Arithmetic
Circuits and the Hadamard Product of Polynomials. FSTTCS
2009. Tech report on
arxiv.
- Vikraman Arvind, Srikanth Srinivasan: Circuit Lower Bounds, Help Functions,
and the Remote Point Problem. Proceedings of ICS 2010. Tech report on
arxiv.
- Vikraman Arvind, Srikanth Srinivasan: The Remote Point Problem, Small
Bias Spaces, and Expanding Generator Sets. Proceedings of STACS 2010. Tech report on arxiv.
- Vikraman Arvind, Srikanth Srinivasan: On the Hardness of the
Noncommutative determinant. STOC 2010. Tech report on arxiv.
- Steve Chien, Prahladh Harsha, Alistair Sinclair, Srikanth Srinivasan: Almost Settling the Hardness of the Noncommutative Determinant. STOC 2011. Tech report on arxiv.
- Shachar Lovett, Srikanth Srinivasan: Correlation bounds on Poly-sized AC^0
circuits with n^{1-o(1)} Symmetric gates. RANDOM 2011. Paper
-
Andreas Krebs, Nutan Limaye, Srikanth Srinivasan: Streaming Algorithms for
Recognizing Nearly Well-Parenthesized Expressions. MFCS 2011.
-
Dmitry Gavinsky, Shachar Lovett, Srikanth Srinivasan: Pseudorandom Generators for read-once ACC^0. CCC 2012.
-
Paul Beame, Russell Impagliazzo, Srikanth Srinivasan: Approximating AC^0 by Small Height Decision Trees and a Deterministic Algorithm for #AC^0-SAT. CCC 2012. Paper.
-
Rahul Santhanam, Srikanth Srinivasan: On the Limits of Sparsification.
Submitted. Tech report on
ECCC. ICALP 2012.
Teaching
198:509 Foundations of Computer Science
Contact Details;
417, CoRE Building
DIMACS, Rutgers University
New Brunswick, NJ, USA.
Phone: (732) 445-5930
Fax: (732) 445-5932
Email: srikanth [at] dimacs [dot] rutgers [dot] edu OR srikanth [at] math [dot] ias [dot] edu