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.
Nicola is an associate professor since 2001. He holds a PhD (00) from Universitat Politecnica de Catalunya, advised by Maria Luisa Bonet and holds Italian habilitations as full professor in Mathematical Logic and Computer Science.
From 2005 Nicola is in Sapienza, now at DIAG (Dept. of Computer, Control and Management Engineering "A. Ruberti" ) in Rome. He teaches: Calculus, Mathematical Logic and Computational Complexity.
From 2001 to 2005 Nicola was associate professor at Universitat Politecnica de Catalunya, in Barcelona. Before 2001 he was a researcher at School of Mathematics of the Institute for Advanced Studies in Princeton and Postdoc at University of Toronto (2002-2003).
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 23. PRIN project: Logical Methods in combinatorics. With Milano-Statale, Pisa, Torino.
Jul 23. Paper "The algebraic proof complexity of Tensor Isomorphism " accepted to Conference on Computational Complexity 23. Written with. Joshua Grochow, Toni Pitassi, Adrian She.
Jul 23. Workshop: Logical methods in Ramsey Theory and relted topics. Pisa July 8-11 2023
May 23. Graduate course on Foundations of SAT-solving in Sapienza.
Organizer of the Seminar series in Sapienza. Sapienza LOC3 (Logic, Complexity, Combinatorics, Computability)
Editor for Logical Methods in Computer Science (LMCS)
Founder/Organizer of RaTLoCC workshops "Ramsey Theory in Logic, Combinatorics and Complexity" (11,12,18).
Recent Program Committee: CIAC23, IJCAI22, IJCAI21, FSTTCS17.