Nicola Galesi




Associate Professor    
Ph.D. Universitat Politècnica de Catalunya (2000)http://www.lsi.upc.edushapeimage_2_link_0

galesi at di dot uniroma1 dot it

T. +39.06.4991.8412

F. +39.06.854.1842

Dipartimento di Informatica
Via Salaria 113 
00198 Rome Italyhttp://www.di.uniroma1.itshapeimage_3_link_0

Home   Research   Teaching    Pubblications    Activities     Students          

Research interests Computational Complexity Theory, Logic in Computer Science.

Profile Since 2005 at La Sapienza in Rome. Before:
                     associate professor at UPC in Barcelona (01-05)
                     postdoc at University of Toronto (02-03) 
                     member at the Institute for Advanced Studies in Princeton (00-01)

Studies in Barcelona with Maria Luisa Bonet (95-00)http://www.uniroma1.ithttp://www.upc.eduhttp://www.lsi.upc.eduhttp://cs.toronto.eduhttp://www.math.ias.eduhttp://www.lsi.upc.es/~bonet/http://www.templeton.org/shapeimage_5_link_0shapeimage_5_link_1shapeimage_5_link_2shapeimage_5_link_3shapeimage_5_link_4shapeimage_5_link_5
 

Teaching

Seminari di Informatica per il Tirocinio
Modelli e Ottimizzazione (I sem)
Computational Intractability/Teoria della Computazione (I sem)
Tesi di Laurea (Magistrale e Triennale)
Introduzione al linguaggio Python 3 (Olimpiadi)SIpT.htmlhttp://www.dsi.uniroma1.it/%7Egalesi/modelli.htmltoc.htmltoc.htmlhttp://www.dsi.uniroma1.it/%7Egalesi/TesiLaurea.htmlpython.htmlshapeimage_7_link_0shapeimage_7_link_1shapeimage_7_link_2shapeimage_7_link_3shapeimage_7_link_4shapeimage_7_link_5

Research

Science

I Bonacina, N. Galesi. Psuedo-Partition, Transversality and Locality: A Combinatorial characterization of space in  
                                    algebraic Proof Systems.  ITCS 2013
O. Beyersdorff, N. Galesi, M. Lauria, A Razborov. Parameterized Bounded Depth Frege is Not Optimal ICALP 2011
L. Carlucci, N.Galesi, M. Lauria Paris-Harrington Tautologies  CCC 2011http://www.dsi.uniroma1.it/~galesi/parres.pdfhttp://www.dsi.uniroma1.it/~galesi/PH.pdfshapeimage_8_link_0shapeimage_8_link_1
 2013 Theory and Applications of Models of  
          Computations TAMC 2013
2012 Workshop Limits on Theorem Proving
SAT Interactions - Dagstuhl 2012
2012 Computer Science Logic
2012 IEEE Conference on Computational Complexity
SeT - Theory Seminars
JSAT- Journal of Satisfiability
IOI - International Olympiad Informaticshttp://www.cs.hku.hk/tamc2013/http://www.cs.hku.hk/tamc2013/LiThPr.htmlhttp://www.dagstuhl.de/en/program/calendar/semhp/?semnr=12471http://csl2012.lacl.fr/http://computationalcomplexity.org/cfp.htmlhttp://set.di.uniroma1.it/http://jsat.ewi.tudelft.nl/http://www.olimpiadi-informatica.it/shapeimage_9_link_0shapeimage_9_link_1shapeimage_9_link_2shapeimage_9_link_3shapeimage_9_link_4shapeimage_9_link_5shapeimage_9_link_6shapeimage_9_link_7shapeimage_9_link_8

Grants

The Limits of  Theorem Proving. Granted by John Templeton Foundation (2011-2013, Project Leader )  
Complessità e Rappresentabilità Compatta di Strutture Discrete. Granted by Sapienza (2009-2011, Project Leader )http://www.thi.uni-hannover.de/en/research/limits-of-theorem-proving/http://www.templeton.org/shapeimage_10_link_0shapeimage_10_link_1