Papers
Tight Chang’s lemma type bounds for Boolean functions.
Sourav Chakraborty, Nikhil S. Mande, Rajat Mittal, Tulasimohan Molli, Manaswi Paraashar, Swagato Sanyal.
FSTTCS 2021 | arXiv
Probabilistic degree of OR over the Reals.
Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan.
FSTTCS 2019 | RSA Journal | arXiv | eccc
Theses and Reports
PhD Thesis: On Complexity Measures of Boolean Functions
under the guidance of Prof. Prahladh Harsha
at Tata Institute of Fundamental Research, Mumbai.
Master Project: Structural results and applications to Arithmetic Circuit Complexity
under the guidance of Prof. Srikanth Srinivasan,
as a part of my Master’s Thesis at Chennai Mathematical Institute.
Qualifier project: Lowerbonds for Depth-2 circuits with Threshold and Mod-gates
under the guidance of Prof. Arkadev Chattopadhyay,
at Tata Institute of Fundamental Research.