Tulasimohan Molli (Low Bandwidth Version)

About Me

I am an Assistant Professor in the Department of Computer Science and Information Systems at BITS Pilani Hyderabad Campus. I specialize in Theoretical Computer Science, including Algorithms, Complexity Theory, and Data Structures.

Contact Information

  • Email: tulasimohan.m@hyderabad.bits-pilani.ac.in
  • Office: H 134, BITS Pilani Hyderabad
  • Phone: +91-8451954446

Teaching

Current and past academic instruction history:

Course Year Term
CS F211: Data Structures and Algorithms (DSA) 2026 Jan - May
CS304: Discrete Structures and Computation 2022 Jan - May
Theory of Computation 2012 Aug - Dec
Discrete Mathematics 2012 Jan - May
No matching items

Research & Publications

My research explores the fundamental limits of computational models using algebraic, analytical, and combinatorial approaches.

Publication Title Authors Venue
The natural proofs barrier against data-structure lower-bounds Bruno Loff, Michal Koucký, Tulasimohan Molli, Michael Saks STOC’26
Criticality of AC0 formulae Prahladh Harsha, Tulasimohan Molli, Ashutosh Shankar CCC’23
Tight Chang’s lemma type bounds for Boolean functions Sourav Chakraborty, Nikhil S. Mande, Rajat Mittal, Tulasimohan Molli, Manaswi Paraashar, Swagato Sanyal FSTTCS’21
Probabilistic degree of OR over the Reals Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan FSTTCS’18, RSA’21
No matching items

Back to main site