Martedì dalle ore 14:30 alle ore 16:30, presso il Dipartimento di Matematica e Informatica, Viale Morgagni 65, I piano.
AVVISO. Il ricevimento studenti dei giorni 11, 18 e 25 Settembre 2018 è annullato.
Pierluigi Crescenzi (Roma, 1961) è professore ordinario presso l'Università di Firenze. Laureato in Matematica presso l'Università di Roma La Sapienza, ha conseguito il titolo di Dottore di Ricerca in Informatica presso la stessa università. Dal 1990 al 1992 è stato ricercatore presso l'Università di L'Aquila. Chiamato nel 1992 come professore associato dall'Università di Roma La Sapienza, ha tenuto corsi di introduzione alla programmazione, di compilatori, di informatica teorica e di intelligenza artificiale. Dal 1997 ha fatto parte del Dipartimento di Sistemi e Informatica e fa attualmente parte del Dipartimento di Ingegneria dell'Informazione dell'Università di Firenze, dove ha insegnato corsi di algoritmi e strutture dati, di architettura degli elaboratori, di informatica teorica, di reti di calcolatori e di sistemi operativi ed attualmente insegna corsi di programmazione e di algoritmi per sistemi distribuiti. Autore di numerose pubblicazioni scientifiche nel campo della teoria degli algoritmi e delle sue applicazioni e nel campo dell'insegnamenti dell'informatica, è co-autore di Teoria della complessità computazionale (Franco Angeli), Introduction to the theory of complexity (Prentice-Hall), Complexity and Approximation (Springer Verlag), Gocce di Java (Franco Angeli) e Strutture di dati e algoritmi (Pearson Education).
STUDENTI DI DOTTORATO E LAUREATI
Pierluigi Crescenzi (Rome, 1961) is full professor at the University of Firenze. He got his master degree in Mathematics at the University of Roma La Sapienza, and his Ph.D. degree in Computer Science at the same university. From 1990 to 1992 he has been assistant professor at the University of L'Aquila. In 1992 he became associate professor at the University of Roma La Sapienza, where he taught courses on programming, compilers, theoretical computer science, and artificial intelligence. Since 1997 he has been at the Dipartimento di Sistemi e Informatica and he is currently at the Dipartimento di Ingegneria dell'Informazione of the University of Firenze, where he taught course on algorithms and data structures, computer architecture, computer networks, operating systems, and theoretical computer science, and he currently teaches courses on programming and on algorithms for distributed systems. He is author of many publications in the field of the theory of algorithms and their applications and of computer science education, and he is co-author of Teoria della complessità computazionale (Franco Angeli), Introduction to the theory of complexity (Prentice-Hall), Complexity and Approximation (Springer Verlag), Gocce di Java (Franco Angeli) and Strutture di dati e algoritmi (Pearson Education).
I was born in Rome on June 21, 1961. I am a full professor of computer science at the University of Florence. I am from Rome, where I studied at the University of Rome La Sapienza, advised by Daniel Bovet. Before coming to Florence, I was an assistant professor at the University of L’Aquila and then an associate professor at the University of Rome La Sapienza. I am interested in theoretical computer science, in complex network analysis, and in computer science education.My address is: Department of Information Engineering, University of Florence, Viale Morgagni, 65 – 1st floor – room 1/3, 50134 Florence, Italy (phone: +39-055-2751-497).
- Ph.D. in Computer Science, Università degli Studi di Roma “La Sapienza”. Graduation date: September 1991.- Laurea summa cum laude in Mathematics, Università degli Studi di Roma “La Sapienza”. Graduation date: July 1984.
Since November 2004, confirmed Full Professor, Università degli Studi di Firenze.From November 2001 to October 2004, Full Professor, Università degli Studi di Firenze.From November 1997 to October 2001, confirmed Associate Professor, Università degli Studi di Firenze.From November 1992 to October 1997, Associate Professor (confirmed since November 1995), Università degli Studi di Roma “La Sapienza”.From January 1992 to March 1992, Visiting Lecturer, University of California at San Diego, CA.From March 1990 to October 1992, Assistant Professor, Università degli Studi di L’Aquila.
From December 2001 to May 2004, Computer Science Undergraduate Program Chair.Professor of the following undergraduate courses: Algorithm and Computability Theory, Computer Architecture II, Computer Networks, Computer Networks Algorithms, Computer Science Laboratory: Algorithms and Data Structures, Computer Science Laboratory: Architecture, Computer Science Laboratory: Programming, Computer Science Laboratory II: Compilers, Computer Systems: Network Programming, Computing Machine Theory and Application, Distributed Systems and Computer Networks, Elements of Computer Science, Knowledge Representation, Operating Systems, Programming, Programming Languages I: Compilers, Theoretical Computer Science: Languages, Computability, Complexity.Professor of the following graduate courses: Analysis of Complex Networks, Approximate solution of NP-hard Problems, Introduction to the Theory of Computational Complexity, Non-approximability of NP-hard Problems, On-line Algorithms, Probabilistically Checkable Proofs.Lecturer on Approximation Preserving Reducibilities (within the international school on Approximate Solution of Hard Combinatorial Problems, Centro Internazionale di Scienze Meccaniche, Udine).Lecturer of CSE 265B Computability and Complexity (Graduate Program in Computer Science, University of California at San Diego).
PH.D. AND UNDERGRADUATE STUDENTS
Ph.D. supervisor of Luca Trevisan (graduated on 1997), Gianluca Rossi (graduated on 2002), Federico Greco (graduated on 2004), Gaia Innocenti (graduated on 2005), Carlo Nocentini (graduated on 2009), Leonardo Lanzi (graduated on 2012), Andrea Marino (graduated on 2013), Gustavo Sacomoto (co-supervised with Marie-France Sagot, graduated on 2013), Beatrice Donati (co-supervised with Marie-France Sagot, graduated on 2014), Michele Borassi, Lorenzo Severini (co-supervised with Gianlorenzo D'Angelo), and Yllka Velaj (co-supervised with Gianlorenzo D'Angelo). Undergraduate laurea supervisor of dozens of students in the the fields of algorithms and data structures, computational complexity, artificial intelligence, algorithm visualization, and computer science education (the following students have successively continued their studies within a Ph.D. program: Michele Borassi, Camil Demetrescu, Beatrice Donati, Irene Finocchi, Gaia Innocenti, Andrea Marino, Carlo Nocentini, Paolo Penna, Gianluca Rossi, Nicoletta Saccone, Laura Spinsanti, Luca Trevisan).
Co-author of more than 100 publications on international conferences and journals (in the fields of algorithms and data structures, approximation algorithms, computational complexity, graph drawing, computer science education, computer networks, software visualization), of two books in English (edited by Prentice-Hall and Springer), and of three books in Italian (edited by Franco Angeli and Pearson Education Italia).Co-chair of the Program Committee of the Fifth International ACM Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, of the Fourth International Conference on Fun with Algorithms, and of the Sixteenth Italian Conference on Theoretical Computer Science. Member of several program committees of international and national conferences. Member of the editorial board of the Journal of Computer and Systems Science and of the Electronic Notes on Theoretical Computer Science.