Depth-4 lower bounds, determinantal complexity: A unified approach S Chillara, P Mukhopadhyay Computational Complexity, 2019 | 27* | 2019 |

Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications S Chillara, N Limaye, S Srinivasan 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018 2018 …, 2017 | 22 | 2017 |

A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits S Chillara, C Engels, N Limaye, S Srinivasan 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018 | 19 | 2018 |

The Chasm at Depth Four, and Tensor Rank: Old results, new insights S Chillara, M Kumar, R Saptharishi, V Vinay | 15 | 2017 |

A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas S Chillara, N Limaye, S Srinivasan 45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018 | 6 | 2018 |

On the limits of depth reduction at depth 3 over small finite fields S Chillara, P Mukhopadhyay Information and Computation 256 (2017), 35-44, 2017 | 4 | 2017 |

On Computing Multilinear Polynomials Using Multi-*r*-ic Depth Four CircuitsS Chillara ACM Transactions on Computation Theory (TOCT) 13 (3), 1-21, 2021 | 2 | 2021 |

New Exponential Size Lower Bounds against Depth Four Circuits of Bounded Individual Degree S Chillara arXiv preprint arXiv:2003.05874, 2020 | 1 | 2020 |

Functional lower bounds for restricted arithmetic circuits of depth four S Chillara arXiv preprint arXiv:2107.09703, 2021 | | 2021 |

Slightly improved lower bounds for homogeneous formulas of bounded depth and bounded individual degree S Chillara Information Processing Letters 156, 105900, 2020 | | 2020 |

Exponential lower bounds for some depth five powering circuits S Chillara, C Engels, BVR Rao, R Saptharishi, K Sreenivasaiah | | 2018 |

An exposition of the complexity of partial derivatives for constant depth arithmetic circuits and its relation to Raz’s lower bound. S Chillara | | 2018 |