Marco Carmosino

Marco Leandro Carmosino is a Research Scientist at IBM. He is broadly interested in the constructive meta-mathematics of computational complexity, learning theory, and cryptography. Previously, he was supported by an NSF Computing Innovation fellowship with Mark Bun, and a Pacific Institute for the Mathematical Sciences Fellowship with Valentine Kabanets. He got his PhD from UCSD in 2019, advised by Russell Impagliazzo.

Program Visits

Meta-Complexity, Spring 2023, Research Fellow

Lower Bounds in Computational Complexity, Fall 2018, Visiting Graduate Student

Foundations of Machine Learning, Spring 2017, Visiting Graduate Student

Fine-Grained Complexity and Algorithm Design, Fall 2015, Visiting Graduate Student

Cryptography, Summer 2015, Visiting Graduate Student