Luca Trevisan

I am now at Stanford.

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

Office hours: by appointment only in the Summer

Quick links: [Stanford Home Page] [PAPERS] [Lecture Notes] [in theory]

research

writing

[PAPERS by topic]

grant reports
Research supported by NSF Career award
Additive Combinatorics and Computational Complexity

advising

current students
Omid Etesami
Grant Schoenebeck
James Cook
Siu Man Chan
Siu On Chan
Anindya De
Thomas Watson

past students
Madhur Tulsiani (PhD. 2009), now at IAS
Hoeteck Wee (PhD. 2007), now at CUNY
Kenji Obata (PhD. 2006), now CEO of Code Systems
Andrej Bogdanov (Ph.D. 2005), now at CUHK
Beini Zhou (M.S.2002)
Kumar Saurabh (M.S. 2001)

post-docs
Irit Dinur (2003-04)

organizing / editing

[Theory Lunch]

[ECCC] [ACM ToCT] [JACM]

current program committees
FOCS 2010
CIAC 2010

past program committees
ICALP'08
TAMC'08
STOC'08
FOCS'07
TAMC'07
LATIN'06
TCC'06
RANDOM'05
CCC'05
APPROX'04
STOC'03
TCS'02
RANDOM'01
ICALP'00
CCC'00
FOCS'99

Past, present and planned courses

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
Fall 10: CS154 Automata, Computability and Complexity	Spring 11: Graph Partitioning and Expanders

Short Courses

A short course on Graph Partitioning and Expanders in Salerno, July 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.

[In theory]

[Where to eat and drink in Berkeley]

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

Phone: +1 650 723-8879 (Note: I don't check voice mail and I rarely pick up)
Email: trevisan AT stanford dot edu

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