Suryajith Chillara

Affiliation:

Assistant Professor,
Center for Security, Theory and Algorithmic Research (CSTAR),
International Institute of Information Technology, Hyderabad (IIIT-H).

Contact:

111, CSTAR, Vindhya A3,
International Institute of Information Technology,
Gachibowli, Hyderabad, India.

{firstname}.{lastname}@iiit.ac.in

Teaching

Research

S. Chillara, C. Grichener, and A. Shpilka, On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts, STACS 2023, Pages 22:1-22:20 (LIPIcs, Vol 254).
S. Chillara, Functional Lower Bounds for Restricted Arithmetic Circuits of Depth Four, FSTTCS 2021, Pages 14:1-14:15 (LIPIcs, Vol 213).
S. Chillara, New Exponential Size Lower Bounds against Depth Four Circuits of Bounded Individual Degree, Electron. Colloquium Comput. Complex. 27: 33 (2020).
S. Chillara, On Computing Multilinear Polynomials using Multi-$r$-ic Depth Four Circuits, ACM Transactions on Computation Theory, Vol. 13, Issue 3, Article 16, Pages 1-21; Preliminary version: STACS 2020, Pages 47:1-47-16 (LIPIcs, Vol. 154).
S. Chillara, Slightly Improved Lower Bounds for Homogeneous Multi-r-ic Formulas of Small-Depth, Information Processing Letters, vol 156.
S. Chillara, C. Engels, N. Limaye and S. Srinivasan, A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits, FOCS 2018, Pages 934-945.
S. Chillara, N. Limaye and S. Srinivasan, A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas, ICALP 2018, Pages 36:1-36:13 (LIPIcs, Vol. 107).
S. Chillara, N. Limaye and S. Srinivasan, Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications, SIAM Journal of Computing. 48(1): 70-92, 2019; Prelim version: STACS 2018, Pages 21:1-21:15.
S. Chillara, C. Engels, B. V. R. Rao, R. Saptharishi and K. Sreenivasiah, Exponential Lower Bounds for Some Restricted Depth Five Powering Circuits, Chicago Journal of Theoretical Computer Science (accepted).
S. Chillara, M. Kumar, R. Saptharishi and V. Vinay, The Chasm at Depth Four, and Tensor Rank: Old results, new insights, Electron. Colloquium Comput. Complex. 23: 96 (2016).
S. Chillara, and P. Mukhopadhyay, On the Limits of Depth Reduction at Depth-3 Over Small Finite Fields, Information and Computation, Vol 256, Pages 35-44; Prelim version: MFCS 2014, Vol 2, Pages 177-188.
S. Chillara, and P. Mukhopadhyay, Depth 4 Lower Bounds, Determinantal Complexity : A Unified Approach, Computational Complexity 28, pages 545–572 (2019); Prelim version: STACS 2014, Pages 239-250 (LIPIcs, Vol. 25).