• Fine-Grained Derandomization: From Problem-Centric Complexity to Resource-Centric Complexity: Marco L. Carmosino, Russel Impagliazzo and Manuel Sabin. ICALP 2018, ECCC TR18-092.

  • Hardness Amplification for Non-Commutative Arithmetic Circuits: Marco L. Carmosino, Russel Impagliazzo, Shachar Lovett and Ivan Mihajlin. CCC 2018, ECCC TR18-095.

  • Agnostic Learning from Tolerant Natural Proofs: Marco L. Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova. APPROX-RANDOM 2017.

  • Learning Algorithms from Natural Proofs: Marco L. Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova. ECCC 2016, CCC 2016 Best Paper Award.

  • Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility: Marco L. Carmosino, Jiawei Gao, Russell Impagliazzo, Ivan Mihajlin, Ramamohan Paturi, Stefan Schneider. ECCC 2015, ITCS 2016.

  • Tighter Connections between Derandomization and Circuit Lower Bounds: Marco Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova. APPROX-RANDOM 2015.

  • Experimental Descriptive Complexity: Marco Carmosino, Neil Immerman, Charles Jordan. Logic and Program Semantics 2012.