Nicola Galesi

Home Publications Pubs Teaching Teach Talks News

Teaching

Master and Bachelor

Importante !: Iscriversi (con account Sapienza) sulle pagine Moodle dei corsi per poter importanti notizie sui corsi (link sul nome de corso).  Solo studenit con accoutn Sapienza saranno ammessi ai meeting online

Important news !: please register (with Sapienza Account) on the Moodle page of the course (link on the name of the course). Only studetns with Sapienza accounts will be admitted to online meeting

2020-2021
1. Modelli e Ottimizzazione (I sem)

    Link Corso

   - Martedi: 15:00--18:00
      Zoom ID: 853 6052 3865
    - Venerdi 14:00--16:00
       Zoom ID: 836 8649 9878

 

2. Computational Complexity (Fall)

  Link Corso

    Mer: 9:00-11:00.  ZOOM meeting  ID: 880 4380 3248
    Fri:  11:00--14:00   ZOOM meeting ID: 886 9890 3896
3. Automi Calcolabilitą e Complessitą (I sem)

    Link Corso

   - Mercoledi 11:00-1400:
      Zoom ID: 895 7670 3816:
   - Giovedi  12:00--14:00
      Zoom ID: 825 1876 0967



2019-2020
Modelli e Ottimizzazione (I sem)

    Lun: Aula I Castro Laurenziano
           10:00--13:00
   Gio: Aula I Castro Laurenziano
            14:00--1600

Computational Complexity (I sem)

    Mon: Room α
              17:00--19:00
    Thu:  Room α
              16:00--19:00



PhD Teaching


2014
Great Ideas in CS - Razborov-Smolensky lower bound (Sapienza)
2014
Lectio Magistralis - Logic Summer School (Lago di Garda)
2013
Great Ideas in CS - Razborov-Smolensky lower bound (Sapienza)
2009
NoNa Summer School in Complexity Theory. St Petersburg
2009
Introduction to Proof Complexity (Universitą di Salerno)
2003
Complexity Theory (Universitat Politecnica de Catalunya)
2002
Introduction to Proof Complexity (Universitat Politecnica de Catalunya)

Previous Teaching

2014
Great Ideas in CS - Razborov-Smolensky lower bound (Sapienza)
2014
Lectio Magistralis - Logic Summer School (Lago di Garda)
2013
Great Ideas in CS - Razborov-Smolensky lower bound (Sapienza)
2009
NoNa Summer School in Complexity Theory. St Petersburg
2009
Introduction to Proof Complexity (Universitą di Salerno)
2003
Complexity Theory (Universitat Politecnica de Catalunya)
2002
Introduction to Proof Complexity (Universitat Politecnica de Catalunya)
Info and Material about recent courses can be found at the  G+ page
2017-2018
Modeling and Optimization (I sem)
Computational Complexity (I sem)
Automata, Computability and Complexity (Sapienza online)
Introduction to CS (Pharmacy)
2016-2017
Modeling and Optimization (I sem)
Computational Complexity (I sem)
Automata, Computability and Complexity (Sapienza online)
2015-2016
Modeling and Optimization (II sem)
Computational Intractability (II sem)
2014-2015
Modeling and Optimization (I sem )
Computational Intractability (I sem)
School Teacher Training (TFA) - Algorithms
2013-2014
Modeling and Optimization (I sem )
Theory of Computing (I sem)
2012-2013
Modeling and Optimization (I sem )
Theory of Computing (I sem)
2006-2011 (Sapienza)
Theory of Computing, Introduction to Programming, Advanced Programming, Algorithms and Data Structures, Algorithmic Programming Contest,  Programming Lab.
2001-2005 (Universitat Politecnica Catalunya)
Introduction to Programming, Introduction to Logic, Data Bases, Algorithmic and Data Structures