I am from Rome, where I studied at the University "La Sapienza", advised by Pierluigi Crescenzi. Before coming to Berkeley, I was a post-doc at MIT (with the Theory of Computing Group) and at DIMACS and then an assistant professor at Columbia University.
I am interested in Theoretical Computer Science.
Office hours: Mondays, 2-3pm
Quick links: [PAPERS]
[Lecture Notes] [CS278]
[Theory
Lunch] [Complexity
Reading Group]
Research supported by my NSF Career award
| 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: 294, Pseudorandomness ? |
Real
Battles and Empty Metaphors (Susan Sontag, NYT,
9/10/02) [link]
U.S
To Fight Terror With Terror (The
Onion, 5/19/04)
Gay
Couple Feels Pressured to Marry (The
Onion, 6/2/04)
Mr. Bush Won't Be
at the Tonys (Frank Rich, NYT,
6/6/04)