I am from Rome, where I studied at the Sapienza University of Rome, advised by Pierluigi Crescenzi. I have also been a postdoc at MIT (with theTheory of Computing Group) and at DIMACS, an assistant professor at Columbia University and a professor at Stanford.
I am interested in Theoretical Computer Science.
Office hours:

current students
current postdocs
past PhD students
postdocs 
Fall 98: W4231 ,Analysis of Algorithms I  Spring 99: E6291,Topics in Cryptography 
Fall 99: W4231, Analysis of Algorithms I 
Spring 01: 278,Complexity Theory  
Fall 01: 170, Algorithms  Spring 02: 276,Cryptography 
Fall 02: 278, Complexity Theory  Spring 03: 174,Randomized Algorithms 
Fall 03: 294, Coding Theory and Complexity  Spring 04: 172, Computability and Complexity 
Fall 04: 278, Complexity Theory  Spring 05: 170, Algorithms 
Fall 05:172, Computability and Complexity 294, Pseudorandomness 
Spring 06: 294, PCP and Hardness of Approximation 
Spring 07: 172, Computability and Complexity 70, Discrete Mathematics 

Spring 08: 278, Complexity Theory  
Spring 09: 276, Cryptography  
Fall 09: 172, Computability and Complexity 
Spring 10: CS254, Computational Complexity  
Winter 11: CS359G: Graph Partitioning and Expanders CS261: Optimization and Algorithmic Paradigms 
Spring 11: CS154 Automata, Computability and Complexity  
Winter 12: CS 154: Automata, Computability and Complexity CS254: Computational Complexity 

Fall 12: CS 259Q: Quantum Computing  Winter 13: CS366: Graph Partitioning and Expanders  Spring 13: CS161: Algorithms 
Winter 14: CS54: Computational Complexity  Spring 14: CS103: Mathematics for Computer Science 
Short Courses