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

Complexity Theory and Logic in Computer Science. I like Proof Complexity, SAT solving and Optimization.   I recently get interested in Boolean Network Tomography
  • Jan 18 - WS on Proof Complexity (Dagsthul)
  • Jun 18 - FLOC WS on Proof Complexity (Oxford)
  • Jun 18 - Visiting Liverpool Univ.
  • Jul 18 - Notre Dame Workshop on Ramsey Theory and Computability
  • Jul 18 RaTLoCC 2018 - Bertinoro
  • Sep 18 GRASTA - Berlin
news

News

Norway

Teaching

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

Norway

Advising

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

Master. Giacomo Petroselli (Current, Physics), Marco Sterpa (Current, CS) 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

Older stuff

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, FSTTCS17

Conference Organization. ICALP16 (Publicity Chair)

Journals EBJSAT, LMCS

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