Nicola Galesi

bcn

Bio

Since 05 I am associate professor at Sapienza in Rome in the Department of Computer Science.  Before Rome I was  associate professor at Universitat Politecnica de Catalunya (01-05) in Barcelona and Postdoc at IAS (00) in Princeton and at University of Toronto(03).

In fall 15  I was visiting scientist at Simons Institute for Theory of Computing. UC-Berkeley.

I received a  PhD  from Universitat Politecnica de Catalunya (00).

lavagna

Research

My research fields are Complexity Theory and Logic in Computer Science. I like  especially Proof Complexity. Recent interests include optimization and SAT solving.

teaching

Teaching

Optimizazion (III year), Computational Complexity (Master), Automata, Computability and Complexity (III year, online). G+ Teaching Page (Italian)

Norway

Contacts

Dipartimento Informatica. Via Salaria 113 00198 Rome (Italy). Tel +39.064991.8540

nicola.galesi@uniroma1.it. 

Norway

Advising

Phd. Ilario Bonacina (15), Massimo Lauria (09).

Master. Vincenzo Botta (16 CS), Ilario Bonacina (Math, Pisa,12), Antonio Faonio (CS 11), Silvia Pragliola (Math 09).

Postdoc. Olaf Beyersdorff (Berlin), Alan Skelley (Toronto),

Norway

Science

Workshops Organized: SAT Interactions (Dagsthul 12), Limits of Theorem Proving (CNR, Rome 12), Ramsey Theory in Logic, Combinatorics, Complexity (Bertinoro 09,11)

PC. TAMC13, CSL 12, CCC12, CiE10, SAT09

Conference Organization. ICALP16 (Publicity Chair)

Journals EBJSAT

Grants as PI:
(09-11) Sapienza Research Grant;
(11-13) The Limits of Theorem Proving (John Templeton Foundation);
 (12-14) CRUI-DAAD Italy-Germany Integrated Research.