Ilario Bonacina

Cited by

	All	Since 2019
Citations	403	224
h-index	8	7
i10-index	8	5

20122013201420152016201720182019202020212022202320242 5 8 23 51 44 36 57 40 39 29 31 28

Public access

View all

7 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Nicola GalesiSapienza University RomeVerified email at uniroma1.it
Giuseppe AtenieseGeorge Mason UniversityVerified email at gmu.edu
Antonio FaonioEURECOMVerified email at eurecom.fr
Olaf BeyersdorffProfessor of Theoretical Computer Science, Friedrich Schiller University Jena, GermanyVerified email at uni-jena.de
Paul WollanProfessor of Computer Science, University of Rome La SapienzaVerified email at di.uniroma1.it
Tony HuynhDepartment of Computer Science, Sapienza University of RomeVerified email at di.uniroma1.it
Neil ThapenResearcher, Institute of Mathematics, Czech Academy of SciencesVerified email at math.cas.cz
Susanna F. de RezendeLund UniversityVerified email at cs.lth.se
Massimo LauriaSapienza - Università di RomaVerified email at uniroma1.it
Albert AtseriasUniversitat Politècnica de Catalunya, BarcelonaVerified email at cs.upc.edu
Jakob NordströmUniversity of Copenhagen and Lund UniversityVerified email at di.ku.dk
Navid TalebanfardUniversity of SheffieldVerified email at sheffield.ac.uk
Leroy ChewPost Doc, TU Wien

Ilario Bonacina

Universitat Politècnica de Catalunya

Verified email at cs.upc.edu - Homepage

proof complexity logic complexity theory theoretical computer science


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Proofs of space: When space is of the essence G Ateniese, I Bonacina, A Faonio, N Galesi Security and Cryptography for Networks: 9th International Conference, SCN …, 2014	176	2014
Lower bounds: From circuits to QBF proof systems O Beyersdorff, I Bonacina, C Leroy Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016	50	2016
Total space in resolution. I Bonacina, N Galesi, N Thapen 55th IEEE Symposium on Foundations of Computer Science (FOCS), 641-650, 2014	35	2014
Clique is hard on average for regular resolution A Atserias, I Bonacina, SF De Rezende, M Lauria, J Nordström, ... Journal of the ACM (JACM) 68 (4), 1-26, 2021	32	2021
A framework for space complexity in algebraic proof systems I Bonacina, N Galesi Journal of the ACM (JACM) 62 (3), 1-20, 2015	26	2015
Pseudo-partitions, transversality and locality: A combinatorial characterization for the space measure in algebraic proof systems I Bonacina, N Galesi 4th conference on Innovations in Theoretical Computer Science (ITCS), 455-472, 2013	21	2013
Space proof complexity for random 3-CNFs P Bennett, I Bonacina, N Galesi, T Huynh, M Molloy, P Wollan Information and Computation 255, 165-176, 2017	20	2017
Total space in resolution is at least width squared I Bonacina 43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016	20	2016
Strong ETH and Resolution via Games and the Multiplicity of Strategies I Bonacina, N Talebanfard Algorithmica 79, 29-41, 2017	6	2017
Space in weak propositional proof systems I Bonacina PhD thesis, Department of Computer Science, Sapienza University of Rome, 12 2015, 2015	6	2015
Improving resolution width lower bounds for k-CNFs with applications to the Strong Exponential Time Hypothesis I Bonacina, N Talebanfard Information Processing Letters 116 (2), 120-124, 2016	5	2016
Space proof complexity for random -CNFs via a -Hall's Theorem I Bonacina, N Galesi, T Huynh, P Wollan arXiv preprint arXiv:1411.1619, 2014	5	2014
SAT and Interactions (Dagstuhl Seminar 16381) O Beyersdorff, N Creignou, U Egly, H Vollmer Dagstuhl Reports 6 (9), 2017	1	2017
Improving Strong Exponential Time Hypothesis lower bounds for tree-like resolution I Bonacina, N Talebanfard		2014

The system can't perform the operation now. Try again later.

Articles 1–14

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors