Paper Accepted at STOC 2026
The natural proofs barrier against data-structure lower-bounds accepted at STOC 2026.
Jun 1, 2026
Tulasimohan Molli
Assistant Professor
Department of Computer Science and Information Systems
BITS Pilani Hyderabad Campus
Research Interests
I specialize in Theoretical Computer Science, with research interests spanning Algorithms, Complexity Theory, and Data Structures. My work explores the fundamental limits of computational models using algebraic, analytical, and combinatorial approaches.
Circuit Complexity Communication & Query Complexity Analysis of Boolean Functions Data Structures