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).  Since 2012  I have  an Italian habilitation as full professor in Mathematical Logic.

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

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

lavagna

Research

Complexity Theory and Logic in Computer Science: Proof Complexity, SAT solving and Optimization.   I recently get interested in Boolean Network Tomography
  • Feb 2020  Workshop SAT Interactions - Dagstuhl
  • Jan 2020  Workshop Proof Complexity - Banff
  • Nov 2019 FOCS 2019
  • Sep 19  Visiting CAS - Prague
  • Sep 19  XXI - Congresso Unione Matematica Italiana
  • Jul 19 -  Visiting DIMACS
  • Jul  19  Conference on  Computational Complexity
news

Events

Norway

Teaching 20-21 (updated to 1 Ott 2020)

Importante !: Iscriversi (con account Sapienza) sulle pagine Moodle dei corsi per importanti notizie sui corsi (link sul nome de corso) e leggere gli annunci.

Important news !: please register (with Sapienza Account) on the Moodle page of the course (link on the name of the course) and receive announcements.

Courses: 
1. Automi CalcolabilitÓ e ComplessitÓ
   - Mercoledi 11:00-1400:
      Zoom ID
: 895 7670 3816:
  -   Giovedi 12:00--14:00       
      Zoom ID:
825 1876 0967

2. Modelli e Ottimizzazione
   - Martedi: 15:00--18:00
      Zoom ID: 853 6052 3865
    - Venerdi 14:00--16:00

       Zoom ID:
836 8649 9878
 
3. Computational Complexity
:
    Mer: 9:00-11:00.  ZOOM meeting
    ID: 880 4380 3248

     Fri:  11:00--14:00 
ZOOM meeting
    ID:
886 9890 3896
   
   
Norway

Advising

Phd. Fariba Ranjbar (Current), Ilario Bonacina (15), Massimo Lauria (09).

Master. Giacomo Petroselli (Current, Physics), Abdul Miajith (18), Vincenzo Botta (CS 16), Ilario Bonacina (Math, Pisa, 12), Antonio Faonio (CS 11), Silvia Pragliola (Math 09).

Postdoc. Olaf Beyersdorff (Berlin), Massimo Lauria (Sapienza), Alan Skelley (Toronto).

Norway

Grants, Workshop, PC, EB.

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

Program Committee. FSTTCS17, TAMC13, CSL 12, CCC12, CiE10, SAT09, FSTTCS17

Conference Organization. ICALP16 (Publicity Chair)

Editorial Board.  JSAT,  LMCS

Grants as PI:

(12-14) CRUI-DAAD Italy-Germany Integrated Research.
(11-13) The Limits of Theorem Proving (John Templeton Foundation);
(96-99) Marie Curie Fellowship

(09-11) Sapienza Research Grant