Luca Trevisan

I am from Rome, where I studied at the University "La Sapienza", advised by Pierluigi Crescenzi. Before coming to Stanford, I was a post-doc at MIT (with theTheory of Computing Group) and at DIMACS and then an assistant professor at Columbia University and then at Berkeley.

I am interested in Theoretical Computer Science.

Office hours:

• Mondays 2-4pm in Gates 474

research

teaching

[Lecture notes]

• at Columbia

  Fall 98: W4231 ,Analysis of Algorithms I	Spring 99: E6291,Topics in Cryptography
  Fall 99: W4231, Analysis of Algorithms I

• at Berkeley

  	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

• at Stanford

  		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

Short Courses

• A course on Graph Partitioning and Expanders in Salerno, July 2010.
• A very short course on Indistinguishability and Regularity Lemmas in Princeton, June 2010. (Course page will be up soon.)
• A short course on Additive combinatorics for computer scientists in Princeton, August 2007.
• A short course on Pseudorandomness and combinatorial constructions  in Cortona, Italy, July 2005.
• A short course on Error-Correcting Codes in Rome, Italy. May 2003.
• IAS Summer School on Computational Complexity, Summer 2000. [notes]
• A short course on Cryptography in Siena, Italy. January 2000.

other stuff

[Where to eat and drink in Berkeley]

[Quotes] on theory of computing and other [random quotes]

How to contact me

Snail mail

Luca Trevisan
Stanford University
Computer Science Department, 474 Gates Building
353 Serra Mall
Stanford CA 94305-9025 USA