Marco Carmosino

27 papers A* 3A 3B 2Journal 16Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Convergent Gate Elimination and Constructive Circuit Lower Bounds.
CoRR
Marco Carmosino, Ngu Dang, Tim Jackman
2026 A conf
Simple Circuit Extensions for XOR in PTIME.
STACS
Marco Carmosino, Ngu Dang, Tim Jackman
2025 J jnl
Enforcing Demographic Coherence: A Harms Aware Framework for Reasoning about Private Data Release.
CoRR
Mark Bun, Marco Carmosino, Palak Jain, Gabriel Kaptchuk, Satchit Sivakumar
2025 A conf
Provability of the Circuit Size Hierarchy and Its Consequences.
ITCS
Marco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor C. Oliveira, Dimitrios Tsintsilidas
2025 J jnl
Simple Circuit Extensions for XOR in PTIME.
CoRR
Marco Carmosino, Ngu Dang, Tim Jackman
2025 A* conf
Student-Teacher Constructive Separations and (Un)Provability in Bounded Arithmetic: Witnessing the Gap.
STOC
Stefan Grosser, Marco Carmosino
2025 J jnl
Student-Teacher Constructive Separations and (Un)Provability in Bounded Arithmetic: Witnessing the Gap.
Electron. Colloquium Comput. Complex.
Marco Carmosino, Stefan Grosser
2024 J jnl
Multi-Structural Games and Beyond.
Log. Methods Comput. Sci.
Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta
2024 B conf
On the Number of Quantifiers Needed to Define Boolean Functions.
MFCS
Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta
2024 J jnl
On the Number of Quantifiers Needed to Define Boolean Functions.
CoRR
Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta
2024 J jnl
Parallel Play Saves Quantifiers.
CoRR
Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta, R. Ryan Williams
2024 J jnl
Provability of the Circuit Size Hierarchy and Its Consequences.
Electron. Colloquium Comput. Complex.
Marco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor Carboni Oliveira, Dimitrios Tsintsilidas
2023 J jnl
A Finer Analysis of Multi-Structural Games and Beyond.
CoRR
Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta
2023 J jnl
Private Boosted Decision Trees via Smooth Re-Weighting.
J. Priv. Confidentiality
MohammadMahdi Jahanara, Vahid R. Asadi, Marco Carmosino, Akbar Rafiey, Bahar Salamatian
2022 J jnl
Creating quantum-resistant classical-classical OWFs from quantum-classical OWFs.
CoRR
Wei Zheng Teo, Marco Carmosino, Lior Horesh
2022 B conf
Learning with Distributional Inverters.
ALT
Eric Binnendyk, Marco Carmosino, Antonina Kolokolova, R. Ramyaa, Manuel Sabin
2021 A* conf
LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic.
FOCS
Marco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor C. Oliveira
2021 J jnl
LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic.
Electron. Colloquium Comput. Complex.
Marco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor C. Oliveira
2021 J jnl
Learning with distributional inverters.
CoRR
Eric Binnendyk, Marco Carmosino, Antonina Kolokolova, Ramyaa Ramyaa, Manuel Sabin
2021 A* conf
Lifting for Constant-Depth Circuits and Applications to MCSP.
ICALP
Marco Carmosino, Kenneth Hoover, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova
2020 A conf
Adaptive Rubrics.
SIGCSE
Marco Carmosino, Mia Minnes
2019 — —
Connections Between Complexity Lower Bounds and Meta-Computational Upper Bounds.
Marco Carmosino
2018 J jnl
Fine-Grained Derandomization: From Problem-Centric to Resource-Centric Complexity.
Electron. Colloquium Comput. Complex.
Marco Carmosino, Russell Impagliazzo, Manuel Sabin
2018 J jnl
Hardness Amplification for Non-Commutative Arithmetic Circuits.
Electron. Colloquium Comput. Complex.
Marco Carmosino, Russell Impagliazzo, Shachar Lovett, Ivan Mihajlin
2015 J jnl
Nondeterministic extensions of the Strong Exponential Time Hypothesis and consequences for non-reducibility.
Electron. Colloquium Comput. Complex.
Marco Carmosino, Jiawei Gao, Russell Impagliazzo, Ivan Mihajlin, Ramamohan Paturi, Stefan Schneider
2015 — conf
Tighter Connections between Derandomization and Circuit Lower Bounds.
APPROX-RANDOM
Marco Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova
2012 — conf
Experimental Descriptive Complexity.
Logic and Program Semantics
Marco Carmosino, Neil Immerman, Charles Jordan