Leonardo Nagami Coregliano

According to our database, Leonardo Nagami Coregliano authored at least 11 papers between 2016 and 2024.

Collaborative distances:

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

2024

High-arity PAC learning via exchangeability.

Leonardo Nagami Coregliano, Maryanthe Malliaris

CoRR, 2024

2023

Natural quasirandomness properties.

Leonardo Nagami Coregliano, Alexander A. Razborov

Random Struct. Algorithms, October, 2023

Exact Completeness of LP Hierarchies for Linear Codes.

Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022

On the abstract chromatic number and its computability for finitely axiomatizable theories.

Leonardo Nagami Coregliano

J. Comb. Theory, Ser. B, 2022

Tighter bounds on the independence number of the Birkhoff graph.

Leonardo Nagami Coregliano, Fernando Granha Jeronimo

Eur. J. Comb., 2022

A Complete Linear Programming Hierarchy for Linear Codes.

Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2019

Semantic Limits of Dense Combinatorial Objects.

Leonardo Nagami Coregliano, Alexander A. Razborov

CoRR, 2019

On the Maximum Density of Fixed Strongly Connected Subtournaments.

Leonardo Nagami Coregliano, Roberto F. Parente, Cristiane M. Sato

Electron. J. Comb., 2019

2018

Quasi-carousel tournaments.

Leonardo Nagami Coregliano

J. Graph Theory, 2018

2017

On the Density of Transitive Tournaments.

Leonardo Nagami Coregliano, Alexander A. Razborov

J. Graph Theory, 2017

2016

Packing densities of layered permutations and the minimum number of monotone sequences in layered permutations.

Josefran de Oliveira Bastos, Leonardo Nagami Coregliano

Discret. Math. Theor. Comput. Sci., 2016