Nicola Galesi is an associate professor in the Department of Computer Science of Sapienza University of Rome. Formerly he held a similar position at Universitat Politecnica de Catalunya in Barcelona, where he obtained his PhD in Computer Science in 2000. In 2000-2001 he was a member of the School of Mathematics of the Institute for Advanced Studies in Princeton, and in 2003 he was a postdoc at the University of Toronto in the Department of Computer Science. His main research area within computer science is complexity theory, and in particular, propositional proof complexity and satisfiability algorithms.
- Fine-Grained Complexity and Algorithm Design, Fall 2015. Visiting Scientist.