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 theTheory of Computing Group) and at DIMACS and then an assistant professor at Columbia University.
I am interested in Theoretical Computer Science.
Office hours: Tuesdays 1-2pm and Wednesdays 2-3pm (615 Soda)
Quick links: [PAPERS]
[Lecture Notes] [CS170]
[Theory Lunch] [Theory
Reading
Group]
Research supported by my NSFCareer 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, PCP and Inapproximability ? | Spring 06: 172, Computability and Complexity? |
Real
Battles
and Empty Metaphors (Susan Sontag, NYT,9/10/02) [link]
The
Faith Factor (Barbara Ehrenreich,
TheNation, 11/11/04)
On
'MoralValues' It's Blue in a Landslide (Frank Rich, NYT, 11/14/04)