I got my PhD in Computer Science in 2015 under the supervision of Prof. Nicola Galesi. After that (till Aug 2017) I was a postdoc at KTH in stockholm hoested by Prof. Jakob Nordstrom. Currently I'm a postdoc at UPC hosted my Prof. Albert Atserias.
I'm interested in computational complexity and I'm actively working in proof complexity. I'm also interested in areas of mathematics that have (or might have) applications to that: this includes some parts of logic, combinatorics and probability.
Bonacina, I., & Galesi, N. (2015). A Framework for Space Complexity in Algebraic Proof Systems. J. ACM, 62(3), 1–20.
Beyersdorff, O., Bonacina, I., & Leroy, C. (2016). Lower Bounds: From Circuits to QBF Proof Systems. In 7th Conf. Innov. Theor. Comput. Sci. – ITCS (pp. 249–260).
Bonacina, I., Galesi, N., & Thapen, N. (2016). Total Space in Resolution. SIAM J. Comput., 45(5), 1894–1909.