Experimental Descriptive Complexity. - Marco Carmosino; Neil Immerman; Charles Jordan (Logic and Program Semantics, 2012)

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

Nondeterministic extensions of the Strong Exponential Time Hypothesis and consequences for non-reducibility. - Marco Carmosino; Jiawei Gao 001; Russell Impagliazzo; Ivan Mihajlin; Ramamohan Paturi; Stefan Schneider 003 (Electron. Colloquium Comput. Complex., 2015)

Learning Algorithms from Natural Proofs. - Marco L. Carmosino; Russell Impagliazzo; Valentine Kabanets; Antonina Kolokolova (CCC, 2016)

Algorithms from Natural Lower Bounds. - Marco L. Carmosino; Russell Impagliazzo; Valentine Kabanets; Antonina Kolokolova (Electron. Colloquium Comput. Complex., 2016)

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

Hardness Amplification for Non-Commutative Arithmetic Circuits. - Marco Carmosino; Russell Impagliazzo; Shachar Lovett; Ivan Mihajlin (Electron. Colloquium Comput. Complex., 2018)

Fine-Grained Derandomization: From Problem-Centric to Resource-Centric Complexity. - Marco Carmosino; Russell Impagliazzo; Manuel Sabin (Electron. Colloquium Comput. Complex., 2018)

Connections Between Complexity Lower Bounds and Meta-Computational Upper Bounds. - Marco Carmosino (2019)

Efficient, Noise-Tolerant, and Private Learning via Boosting. - Mark Bun; Marco Leandro Carmosino; Jessica Sorrell (COLT, 2020)

Adaptive Rubrics. - Marco Carmosino; Mia Minnes (SIGCSE, 2020)

Lifting for Constant-Depth Circuits and Applications to MCSP. - Marco Carmosino; Kenneth Hoover; Russell Impagliazzo; Valentine Kabanets; Antonina Kolokolova (ICALP, 2021)

Learning with distributional inverters. - Eric Binnendyk; Marco Carmosino; Antonina Kolokolova; Ramyaa Ramyaa; Manuel Sabin (CoRR, 2021)

LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic. - Marco Carmosino; Valentine Kabanets; Antonina Kolokolova; Igor C. Oliveira 001 (Electron. Colloquium Comput. Complex., 2021)

Learning with Distributional Inverters. - Eric Binnendyk; Marco Carmosino; Antonina Kolokolova; R. Ramyaa; Manuel Sabin (ALT, 2022)

Creating quantum-resistant classical-classical OWFs from quantum-classical OWFs. - Wei Zheng Teo; Marco Carmosino; Lior Horesh (CoRR, 2022)

A Finer Analysis of Multi-Structural Games and Beyond. - Marco Carmosino; Ronald Fagin; Neil Immerman; Phokion G. Kolaitis; Jonathan Lenchner; Rik Sengupta (CoRR, 2023)

Private Boosted Decision Trees via Smooth Re-Weighting. - MohammadMahdi Jahanara; Vahid R. Asadi; Marco Carmosino; Akbar Rafiey; Bahar Salamatian (J. Priv. Confidentiality, 2023)

On the Number of Quantifiers Needed to Define Boolean Functions. - Marco Carmosino; Ronald Fagin; Neil Immerman; Phokion G. Kolaitis; Jonathan Lenchner; Rik Sengupta (MFCS, 2024)

Parallel Play Saves Quantifiers. - Marco Carmosino; Ronald Fagin; Neil Immerman; Phokion G. Kolaitis; Jonathan Lenchner; Rik Sengupta; R. Ryan Williams (CoRR, 2024)

Provability of the Circuit Size Hierarchy and Its Consequences. - Marco Carmosino; Valentine Kabanets; Antonina Kolokolova; Igor Carboni Oliveira; Dimitrios Tsintsilidas (Electron. Colloquium Comput. Complex., 2024)

Multi-Structural Games and Beyond. - Marco Carmosino; Ronald Fagin; Neil Immerman; Phokion G. Kolaitis; Jonathan Lenchner; Rik Sengupta (Log. Methods Comput. Sci., 2024)

Student-Teacher Constructive Separations and (Un)Provability in Bounded Arithmetic: Witnessing the Gap. - Marco Carmosino; Stefan Grosser (Electron. Colloquium Comput. Complex., 2025)

Enforcing Demographic Coherence: A Harms Aware Framework for Reasoning about Private Data Release. - Mark Bun; Marco Carmosino; Palak Jain 004; Gabriel Kaptchuk; Satchit Sivakumar (CoRR, 2025)