Marco Carmosino

According to our database, Marco Carmosino authored at least 19 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Parallel Play Saves Quantifiers.

Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta, R. Ryan Williams

CoRR, 2024

2023

Private Boosted Decision Trees via Smooth Re-Weighting.

MohammadMahdi Jahanara, Vahid R. Asadi, Marco Carmosino, Akbar Rafiey, Bahar Salamatian

J. Priv. Confidentiality, August, 2023

A Finer Analysis of Multi-Structural Games and Beyond.

Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta

CoRR, 2023

2022

Creating quantum-resistant classical-classical OWFs from quantum-classical OWFs.

Wei Zheng Teo, Marco Carmosino, Lior Horesh

CoRR, 2022

Learning with Distributional Inverters.

Eric Binnendyk, Marco Carmosino, Antonina Kolokolova, R. Ramyaa, Manuel Sabin

Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

2021

LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic.

Marco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor C. Oliveira

Electron. Colloquium Comput. Complex., 2021

Learning with distributional inverters.

Eric Binnendyk, Marco Carmosino, Antonina Kolokolova, Ramyaa Ramyaa, Manuel Sabin

CoRR, 2021

Lifting for Constant-Depth Circuits and Applications to MCSP.

Marco Carmosino, Kenneth Hoover, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Adaptive Rubrics.

Marco Carmosino, Mia Minnes

Proceedings of the 51st ACM Technical Symposium on Computer Science Education, 2020

Efficient, Noise-Tolerant, and Private Learning via Boosting.

Mark Bun, Marco Leandro Carmosino, Jessica Sorrell

Proceedings of the Conference on Learning Theory, 2020

2019

Connections Between Complexity Lower Bounds and Meta-Computational Upper Bounds.

Marco Carmosino

PhD thesis, 2019

2018

Fine-Grained Derandomization: From Problem-Centric to Resource-Centric Complexity.

Marco Carmosino, Russell Impagliazzo, Manuel Sabin

Electron. Colloquium Comput. Complex., 2018

Hardness Amplification for Non-Commutative Arithmetic Circuits.

Marco Carmosino, Russell Impagliazzo, Shachar Lovett, Ivan Mihajlin

Electron. Colloquium Comput. Complex., 2018

2017

Agnostic Learning from Tolerant Natural Proofs.

Marco L. Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova

Proceedings of the Approximation, 2017

2016

Algorithms from Natural Lower Bounds.

Marco L. Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova

Electron. Colloquium Comput. Complex., 2016

Learning Algorithms from Natural Proofs.

Marco L. Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova

Proceedings of the 31st Conference on Computational Complexity, 2016

2015

Nondeterministic extensions of the Strong Exponential Time Hypothesis and consequences for non-reducibility.

Marco Carmosino, Jiawei Gao, Russell Impagliazzo, Ivan Mihajlin, Ramamohan Paturi, Stefan Schneider

Electron. Colloquium Comput. Complex., 2015

Tighter Connections between Derandomization and Circuit Lower Bounds.

Marco Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova

Proceedings of the Approximation, 2015

2012

Experimental Descriptive Complexity.

Marco Carmosino, Neil Immerman, Charles Jordan

Proceedings of the Logic and Program Semantics, 2012