default search action
Marco Carmosino
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c13]Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta:
On the Number of Quantifiers Needed to Define Boolean Functions. MFCS 2024: 34:1-34:16 - [i13]Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta, R. Ryan Williams:
Parallel Play Saves Quantifiers. CoRR abs/2402.10293 (2024) - [i12]Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta:
On the Number of Quantifiers Needed to Define Boolean Functions. CoRR abs/2407.00688 (2024) - [i11]Marco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor Carboni Oliveira, Dimitrios Tsintsilidas:
Provability of the Circuit Size Hierarchy and Its Consequences. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [j1]MohammadMahdi Jahanara, Vahid R. Asadi
, Marco Carmosino, Akbar Rafiey, Bahar Salamatian:
Private Boosted Decision Trees via Smooth Re-Weighting. J. Priv. Confidentiality 13(1) (2023) - [i10]Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta:
A Finer Analysis of Multi-Structural Games and Beyond. CoRR abs/2301.13329 (2023) - 2022
- [c12]Eric Binnendyk, Marco Carmosino, Antonina Kolokolova, R. Ramyaa, Manuel Sabin:
Learning with Distributional Inverters. ALT 2022: 90-106 - [i9]Vahid R. Asadi, Marco L. Carmosino, MohammadMahdi Jahanara, Akbar Rafiey, Bahar Salamatian:
Private Boosted Decision Trees via Smooth Re-Weighting. CoRR abs/2201.12648 (2022) - [i8]Wei Zheng Teo, Marco Carmosino, Lior Horesh:
Creating quantum-resistant classical-classical OWFs from quantum-classical OWFs. CoRR abs/2209.10146 (2022) - 2021
- [c11]Marco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor C. Oliveira:
LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic. FOCS 2021: 770-780 - [c10]Marco Carmosino, Kenneth Hoover, Russell Impagliazzo
Lifting for Constant-Depth Circuits and Applications to MCSP. ICALP 2021: 44:1-44:20 - [i7]Eric Binnendyk, Marco Carmosino, Antonina Kolokolova, Ramyaa Ramyaa, Manuel Sabin:
Learning with distributional inverters. CoRR abs/2112.12340 (2021) - [i6]Marco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor C. Oliveira:
LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c9]Mark Bun, Marco Leandro Carmosino, Jessica Sorrell:
Efficient, Noise-Tolerant, and Private Learning via Boosting. COLT 2020: 1031-1077 - [c8]Marco Carmosino, Mia Minnes
Adaptive Rubrics. SIGCSE 2020: 549-555 - [i5]Mark Bun, Marco Leandro Carmosino, Jessica Sorrell:
Efficient, Noise-Tolerant, and Private Learning via Boosting. CoRR abs/2002.01100 (2020)
2010 – 2019
- 2019
- [b1]Marco Carmosino:
Connections Between Complexity Lower Bounds and Meta-Computational Upper Bounds. University of California, San Diego, USA, 2019 - 2018
- [c7]Marco L. Carmosino, Russell Impagliazzo
Hardness Amplification for Non-Commutative Arithmetic Circuits. CCC 2018: 12:1-12:16 - [c6]Marco L. Carmosino, Russell Impagliazzo
Fine-Grained Derandomization: From Problem-Centric to Resource-Centric Complexity. ICALP 2018: 27:1-27:16 - [i4]Marco Carmosino, Russell Impagliazzo, Shachar Lovett, Ivan Mihajlin:
Hardness Amplification for Non-Commutative Arithmetic Circuits. Electron. Colloquium Comput. Complex. TR18 (2018) - [i3]Marco Carmosino, Russell Impagliazzo, Manuel Sabin:
Fine-Grained Derandomization: From Problem-Centric to Resource-Centric Complexity. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c5]Marco L. Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova:
Agnostic Learning from Tolerant Natural Proofs. APPROX-RANDOM 2017: 35:1-35:19 - 2016
- [c4]Marco L. Carmosino, Russell Impagliazzo
Learning Algorithms from Natural Proofs. CCC 2016: 10:1-10:24 - [c3]Marco L. Carmosino, Jiawei Gao, Russell Impagliazzo
Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility. ITCS 2016: 261-270 - [i2]Marco L. Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova:
Algorithms from Natural Lower Bounds. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c2]Marco Carmosino, Russell Impagliazzo
Tighter Connections between Derandomization and Circuit Lower Bounds. APPROX-RANDOM 2015: 645-658 - [i1]Marco Carmosino, Jiawei Gao, Russell Impagliazzo, Ivan Mihajlin, Ramamohan Paturi, Stefan Schneider:
Nondeterministic extensions of the Strong Exponential Time Hypothesis and consequences for non-reducibility. Electron. Colloquium Comput. Complex. TR15 (2015) - 2012
- [c1]Marco Carmosino, Neil Immerman, Charles Jordan:
Experimental Descriptive Complexity. Logic and Program Semantics 2012: 24-34
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 21:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: