ContactsNicola Galesi Dipartimento di Ingegneria Informatica, Automatica e Gestionale "Antonio Ruberti"Via Ariosto 25, 00185 Roma, Italy
room: A202tel:email: lastname[AT]diag.uniroma1.itoffice hours: app by email/thu 11-13.
Nicola is an associate professor since 2001. He holds a PhD (00) from Universitat Politecnica de Catalunya, advised by Maria Luisa Bonet and holds an Italian habilitation as full professor in Mathematical Logic since 2012.
Since 22 he is with DIAG (Dept. of Computer, Control and Management Engineering "A. Ruberti" ) in Sapienza, in Rome.
From 05 to 21 he was with the Department of Computer Science, always in Sapienza.
Interests: Computational Complexity and Logic in Computer Science. Proof Complexity, SAT-Solving, Optimization. Group testing and network tomography.
Postdocs: Alan Skelley, Olaf Beyersdorff, Massimo Lauria.
Sep 22. Paper accepted to Mathematical Foundations of Computer Science (MFCS 22). On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares. With I. Bonacina and M.Lauria
Jul 22. Paper accepted to Annals of Pure and Applied Logic. Bounded-depth Frege complexity of Tseitin formulas for all graphs. With D. Itsykson, A.Riazanov, A Sofronova.
Jul 22: Workshop Mathematical Approaches to Lower Bounds: Complexity of Proofs and Computation. (International Centre for Mathematical Sciences, Edinburgh)
Jun-Jul 22: Workshop Complexity Theory with a human face (Czech Academy of Sciences, Prague)
Mar22. Paper published on Theoretical Computer Science: Tight bounds to localize failure nodes on trees, grids and through embeddings under boolean network tomography. With Fariba Ranjbar
Jan22. Paper accepted to STACS 22. Depth lower bounds in Stabbing Planes for combinatorial principles. With S. Dantchev, A. Ghani, B. Martin.