1. Great Moments of Theory at UC Berkeley (visit day edition)
Christos H. Papadimitriou

2. Complexity Before NP-completeness:
Switching and Automata Theory (Harrison)
Space Complexity (Savitch-Cook)
Blum Complexity
P/NP-oriented automata theory (Cook)
visit day

3. NP-completeness Cook, Levin, Karp [1971-2] Impact
Basis for comprehensive methodology for attacking computational problems
Open-ended paradigm in Complexity
Ultimate variant: PCP (later…)
visit day

4. Algorithms Strassen’s matrix multiplication (1969)
Randomized algorithms (1970s)
Karmarkar’s linear programming (1985)
Parallel algorithms (1980s)
Monte-Carlo algorithms (1990s – present)
On-line algorithms (1990s)
Combinatorial optimization (1970s – present)
String matching algorithms and Bioinformatics (1980s –present)
visit day

5. Cryptography
Number theoretic complexity (Blum, Miller, Adleman, early 1970s)
Public-Key Cryptography (1976)
RSA (1978)
Protocols (Blum 1980)
Rigorous Cryptography (Blum, Goldwasser, Micali, Yao, 1982)
visit day

6. Cryptography (cont.)
Crypto/Complexity/Randomness (Blum - Micali, Yao 1982)
Randomized encryption (Goldwasser-Micali 1982)
Randomized algorithms (Karp-Luby 1983)
Boosting randomness (Vazirani 1985, Zuckerman, 1989)
visit day

7. …and finally: PCP Interactive protocols and proofs (1980s)
Program testing (Blum 1989)
Error-correcting codes (Berlekamp)
Inapproximability
Probabilistically checkable proofs (Arora, Feige, Goldwasser, Lund, Lovász, Motwani, Safra, Sudan, Szegedy 1990)
visit day

8. CS and the Sciences Mathematics: P vs NP
Physics: Quantum Computing (Vazirani)
Physics: Phase Transitions (Sinclair)
Biology: Computing the cell (Karp, Myers)
Economics: The Internet as equilibrium (Papadimitriou)
visit day

9. Why Berkeley? Record of past graduates Look around you
Teaching at top schools
Industry
ACM dissertation awards
Look around you
Environment
Atmosphere
Colleagues
visit day