Pierluigi Crescenzi

Professeur, Université de Paris

Pierluigi Crescenzi got his Master degree in Mathematics from University of Rome "La Sapienza" in 1984, and his Ph.D. degree in Computer Science from the same university in 1991.

Before joining Université de Paris, he has been assistant professor at the University of L’Aquila, associate professor at the University of Rome "La Sapienza", and full professor at the University of Florence.

He taught undergraduate courses on Algorithms and Data Structures, Compilers, Computer Architecture, Computer Networks, Computer Network Algorithms, Distributed Systems, Knowledge Representation, Network Programming, Operating Systems, Programming, and Theoretical Computer Science. He taught graduate courses on 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. He has been lecturer on Approximation Preserving Reducibilities (within the international school on Approximate Solution of Hard Combinatorial Problems, Centro Internazionale di Scienze Meccaniche, Udine), and lecturer of CSE 265B Computability and Complexity (Graduate Program in Computer Science, University of California at San Diego).

He has been 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 (graduated in 2017), Lorenzo Severini (co-supervised with Gianlorenzo D'Angelo, graduated in 2017), and Yllka Velaj (co-supervised with Gianlorenzo D'Angelo, graduated in 2017). He has been 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.

He is author of almost 200 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).

He has been 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.

Nom Crescenzi
Prénom Pierluigi
Téléphone 01 57 27 92 16
Bureau 4008
Mail Pierluigi.Crescenzi@irif.fr
Page web https://www.irif.fr/~piluc/

Adress and Location

Postal address
Université Paris-Diderot
Case 7014
75205 Paris CEDEX 13

Bâtiment Sophie Germain
8 place Aurélie Nemours
75013 Paris