Marco Carmosino is an Adjunct Assistant Professor at Boston University and an NSF Computing Innovation Fellow. He obtained his PhD from the University of California, San Diego in August 2019, where he was advised by Russell Impagliazzo. His research focuses on computational complexity theory, aiming to understand and exploit the inherent structure of efficient algorithms in devices. He is particularly interested in the computational limitations that pose challenges to learning and secure cryptography. Through his work, he addresses the difficult problems that arise within these areas, contributing to a nuanced understanding of algorithmic efficiency and its applications.