default search action
Leonardo Nagami Coregliano
Person information
- affiliation: University of Chicago, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Leonardo Nagami Coregliano
:
Left-Cut-Percolation and Induced-Sidorenko Bigraphs. SIAM J. Discret. Math. 38(2): 1586-1629 (2024) - [i6]Leonardo Nagami Coregliano, Maryanthe Malliaris:
High-arity PAC learning via exchangeability. CoRR abs/2402.14294 (2024) - 2023
- [j7]Leonardo Nagami Coregliano
Natural quasirandomness properties. Random Struct. Algorithms 63(3): 624-688 (2023) - [c2]Leonardo Nagami Coregliano
Exact Completeness of LP Hierarchies for Linear Codes. ITCS 2023: 40:1-40:18 - 2022
- [j6]Leonardo Nagami Coregliano
Tighter bounds on the independence number of the Birkhoff graph. Eur. J. Comb. 105: 103564 (2022) - [j5]Leonardo Nagami Coregliano
On the abstract chromatic number and its computability for finitely axiomatizable theories. J. Comb. Theory B 154: 175-210 (2022) - [c1]Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones:
A Complete Linear Programming Hierarchy for Linear Codes. ITCS 2022: 51:1-51:22 - [i5]Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones:
Exact Completeness of LP Hierarchies for Linear Codes. CoRR abs/2211.01248 (2022) - 2021
- [i4]Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones:
A Complete Linear Programming Hierarchy for Linear Codes. CoRR abs/2112.09221 (2021) - 2020
- [i3]Leonardo Nagami Coregliano, Fernando Granha Jeronimo:
Tighter Bounds on the Independence Number of the Birkhoff Graph. CoRR abs/2007.05841 (2020)
2010 – 2019
- 2019
- [j4]Leonardo Nagami Coregliano, Roberto F. Parente, Cristiane M. Sato:
On the Maximum Density of Fixed Strongly Connected Subtournaments. Electron. J. Comb. 26(1): 1 (2019) - [i2]Leonardo Nagami Coregliano, Alexander A. Razborov:
Semantic Limits of Dense Combinatorial Objects. CoRR abs/1910.08797 (2019) - 2018
- [j3]Leonardo Nagami Coregliano
Quasi-carousel tournaments. J. Graph Theory 88(1): 192-210 (2018) - 2017
- [j2]Leonardo Nagami Coregliano, Alexander A. Razborov:
On the Density of Transitive Tournaments. J. Graph Theory 85(1): 12-21 (2017) - 2016
- [j1]Josefran de Oliveira Bastos, Leonardo Nagami Coregliano:
Packing densities of layered permutations and the minimum number of monotone sequences in layered permutations. Discret. Math. Theor. Comput. Sci. 18(2) (2016) - 2015
- [i1]Josefran de Oliveira Bastos, Leonardo Nagami Coregliano:
Packing densities of layered permutations and the minimum number of monotone sequences in layered permutations. CoRR abs/1510.07312 (2015)
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-12-02 22:28 CET 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: