Tulasimohan Molli

Orcid: 0000-0001-6683-9050

According to our database¹, Tulasimohan Molli authored at least 6 papers between 2018 and 2026.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of two.

Timeline

Legend:

Book In proceedings Article PhD thesis Dataset Other

Links

On csauthors.net:

Bibliography

2026

The Natural Proofs Barrier against Data-Structure Lower-Bounds.

[BibT_eX]

[DOI]

Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

2023

Criticality of AC⁰-Formulae.

[BibT_eX]

[DOI]

Prahladh Harsha

Tulasimohan Molli

Ashutosh Shankar

Proceedings of the 38th Computational Complexity Conference, 2023

2022

Criticality of AC0-Formulae.

[BibT_eX]

[DOI]

Prahladh Harsha

Tulasimohan Molli

Ashutosh Shankar

Electron. Colloquium Comput. Complex., 2022

Criticality of AC<sup>0</sup> formulae.

[BibT_eX]

[DOI]

Prahladh Harsha

Tulasimohan Molli

Ashutosh Shankar

CoRR, 2022

2021

Tight Chang's-Lemma-Type Bounds for Boolean Functions.

[BibT_eX]

[DOI]

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2018

On the Probabilistic Degree of OR over the Reals.

[BibT_eX]

[DOI]

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

Tulasimohan Molli

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...