Pseudo-partitions, Transversality and Locality: A Combinatorial Characterization for the Space Measure in Algebraic Proof Systems. - Ilario Bonacina; Nicola Galesi (Electron. Colloquium Comput. Complex., 2012)

Proofs of Space: When Space is of the Essence. - Giuseppe Ateniese; Ilario Bonacina; Antonio Faonio; Nicola Galesi (IACR Cryptol. ePrint Arch., 2013)

Space proof complexity for random 3-CNFs via a (2-ε)-Hall's Theorem. - Ilario Bonacina; Nicola Galesi; Tony Huynh; Paul Wollan (Electron. Colloquium Comput. Complex., 2014)

Lower bounds: from circuits to QBF proof systems. - Olaf Beyersdorff; Ilario Bonacina; Leroy Chew (Electron. Colloquium Comput. Complex., 2015)

A Framework for Space Complexity in Algebraic Proof Systems. - Ilario Bonacina; Nicola Galesi (J. ACM, 2015)

Space in weak propositional proof systems. - Ilario Bonacina (Bull. EATCS, 2016)

Total space in Resolution is at least width squared. - Ilario Bonacina (Electron. Colloquium Comput. Complex., 2016)

Improving resolution width lower bounds for k-CNFs with applications to the Strong Exponential Time Hypothesis. - Ilario Bonacina; Navid Talebanfard (Inf. Process. Lett., 2016)

Total Space in Resolution. - Ilario Bonacina; Nicola Galesi; Neil Thapen (SIAM J. Comput., 2016)

Space in Weak Propositional Proof Systems - Ilario Bonacina (Springer, 2017)

Strong ETH and Resolution via Games and the Multiplicity of Strategies. - Ilario Bonacina; Navid Talebanfard (Algorithmica, 2017)

Space proof complexity for random 3-CNFs. - Patrick Bennett; Ilario Bonacina; Nicola Galesi; Tony Huynh; Mike Molloy 001; Paul Wollan (Inf. Comput., 2017)

Frege Systems for Quantified Boolean Logic. - Olaf Beyersdorff; Ilario Bonacina; Leroy Chew; Ján Pich (J. ACM, 2020)

On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems. - Ilario Bonacina; Maria Luisa Bonet (Electron. Colloquium Comput. Complex., 2021)

Clique Is Hard on Average for Regular Resolution. - Albert Atserias; Ilario Bonacina; Susanna F. de Rezende; Massimo Lauria; Jakob Nordström; Alexander A. Razborov (J. ACM, 2021)

A separation of PLS from PPP. - Ilario Bonacina; Neil Thapen (Electron. Colloquium Comput. Complex., 2022)

Polynomial Calculus for MaxSAT. - Ilario Bonacina; Maria Luisa Bonet; Jordi Levy (SAT, 2023)

On vanishing sums of roots of unity in polynomial calculus and sum-of-squares. - Ilario Bonacina; Nicola Galesi; Massimo Lauria (Comput. Complex., 2023)

Weighted, Circular and Semi-Algebraic Proofs (Abstract Reprint). - Ilario Bonacina; Maria Luisa Bonet; Jordi Levy (IJCAI, 2024)

MaxSAT Resolution with Inclusion Redundancy. - Ilario Bonacina; Maria Luisa Bonet; Massimo Lauria (SAT, 2024)

Polynomial calculus for optimization. - Ilario Bonacina; Maria Luisa Bonet; Jordi Levy (Artif. Intell., 2024)

Redundancy for MaxSAT. - Ilario Bonacina; Maria Luisa Bonet; Sam Buss; Massimo Lauria (Electron. Colloquium Comput. Complex., 2024)

Weighted, Circular and Semi-Algebraic Proofs. - Ilario Bonacina; Maria Luisa Bonet; Jordi Levy (J. Artif. Intell. Res., 2024)

Semi-Algebraic Proof Systems for QBF. - Olaf Beyersdorff; Ilario Bonacina; Kaspar Kasche; Meena Mahajan; Luc Nicolas Spachmann (SAT, 2025)

Redundancy Rules for MaxSAT. - Ilario Bonacina; Maria Luisa Bonet; Sam Buss; Massimo Lauria (SAT, 2025)

An Algebraic Approach to MaxCSP. - Ilario Bonacina; Jordi Levy (SAT, 2025)

Strength and limitations of Sherali-Adams and Nullstellensatz proof systems. - Ilario Bonacina; Maria Luisa Bonet (Ann. Pure Appl. Log., 2025)