Leonardo Nagami Coregliano

22 papers A 3Journal 19
YearRankTypeTitle / Venue / Authors
2026 A conf
Higher-Order Delsarte Dual LPs: Lifting, Constructions and Completeness.
ITCS
Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones, Nati Linial, Elyassaf Loyfer
2025 J jnl
A packing lemma for VCN
CoRR
Leonardo Nagami Coregliano, Maryanthe Malliaris
2025 J jnl
Higher-order Delsarte Dual LPs: Lifting, Constructions and Completeness.
CoRR
Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones, Nati Linial, Elyassaf Loyfer
2025 J jnl
How to Get the Random Graph with Non-Uniform Probabilities?
Electron. J. Comb.
Leonardo Nagami Coregliano, Jaroslaw Swaczyna, Agnieszka Widz
2025 J jnl
Sample completion, structured correlation, and Netflix problems.
CoRR
Leonardo Nagami Coregliano, Maryanthe Malliaris
2025 J jnl
Weak Randomness in Graphons and Theons.
Random Struct. Algorithms
Leonardo Nagami Coregliano, Maryanthe Malliaris
2024 J jnl
High-arity PAC learning via exchangeability.
CoRR
Leonardo Nagami Coregliano, Maryanthe Malliaris
2024 J jnl
Left-Cut-Percolation and Induced-Sidorenko Bigraphs.
SIAM J. Discret. Math.
Leonardo Nagami Coregliano
2023 A conf
Exact Completeness of LP Hierarchies for Linear Codes.
ITCS
Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones
2023 J jnl
Natural quasirandomness properties.
Random Struct. Algorithms
Leonardo Nagami Coregliano, Alexander A. Razborov
2022 A conf
A Complete Linear Programming Hierarchy for Linear Codes.
ITCS
Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones
2022 J jnl
Exact Completeness of LP Hierarchies for Linear Codes.
CoRR
Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones
2022 J jnl
On the abstract chromatic number and its computability for finitely axiomatizable theories.
J. Comb. Theory B
Leonardo Nagami Coregliano
2022 J jnl
Tighter bounds on the independence number of the Birkhoff graph.
Eur. J. Comb.
Leonardo Nagami Coregliano, Fernando Granha Jeronimo
2021 J jnl
A Complete Linear Programming Hierarchy for Linear Codes.
CoRR
Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones
2020 J jnl
Tighter Bounds on the Independence Number of the Birkhoff Graph.
CoRR
Leonardo Nagami Coregliano, Fernando Granha Jeronimo
2019 J jnl
On the Maximum Density of Fixed Strongly Connected Subtournaments.
Electron. J. Comb.
Leonardo Nagami Coregliano, Roberto F. Parente, Cristiane M. Sato
2019 J jnl
Semantic Limits of Dense Combinatorial Objects.
CoRR
Leonardo Nagami Coregliano, Alexander A. Razborov
2018 J jnl
Quasi-carousel tournaments.
J. Graph Theory
Leonardo Nagami Coregliano
2017 J jnl
On the Density of Transitive Tournaments.
J. Graph Theory
Leonardo Nagami Coregliano, Alexander A. Razborov
2016 J jnl
Packing densities of layered permutations and the minimum number of monotone sequences in layered permutations.
Discret. Math. Theor. Comput. Sci.
Josefran de Oliveira Bastos, Leonardo Nagami Coregliano
2015 J jnl
Packing densities of layered permutations and the minimum number of monotone sequences in layered permutations.
CoRR
Josefran de Oliveira Bastos, Leonardo Nagami Coregliano