FCRC 2011:

David A. Ferrucci:
IBM's Watson/DeepQA 

Ravi Kannan:
Algorithms: Recent Highlights and Challenges 

Luiz Andre Barroso:
Warehouse-Scale Computing: Entering the Teenage Decade 

Luis von Ahn: 
Solving Problems with Millions of Humans and Computers

Maja Mataric:
Robots Among Us? Human-Robot Interaction Methods for Socially Assistive Robotics 

Leslie G. Valiant:
(Turing Award Lecture)


CCC 2010:

Ran Raz:
Parallel repetition of two-prover games

Subhash Khot:
On the unique games conjecture

Oded Regev:
The learning with errors problem

Juris Hartmanis:
(25th anniversary talk)


CCC 2009:

None


CCC 2008:

None


FCRC 2007:

Chuck Moore:
A Framework for Innovation.

David Culler and Deborah Estrin:
Wireless Sensing - The Internet's Front-Tier.

Avi Wigderson:
The Art of Reduction.

Guy Steele: 
Designing by Accident.

Edward Lazowska:
Computer Science: Past, Present, and Future.

Christos Papadimitriou:
The Algorithmic Lens: How the Sciences are Being Transformed by the Computational Perspective.

Bob Colwell:
Future of Computer Architecture '07.

Randall Bryant:
Data-Intensive Super Computing: Taking Google-Style Computing Beyond Web Search.

Scott Shenker:
We Dream of GENI: Exploring Radical Network Designs.

Fran Allen:
(Turing Award Lecture)


CCC 2006:

Pavel Pudlák: 
Godel and Computations.

Avi Wigderson: 
Applications of the Sum-Product Theorem in Finite Fields. 


CCC 2005:

Manuel Blum: 
Understanding "Understanding:" Steps toward a Mathematical Scientific Theory of Consciousness.


CCC 2004:

None


CCC 2003:

Manindra Agrawal:
On Derandomizing Tests for Certain Polynomial Identities.

Rod Downey:
Parameterized Complexity for the Skeptic.

Johan Hastad:
Inapproximability Some history and some open problems.

Special session given in honor of the 100th anniversary of the birth of Andrei N. Kolmogorov:

Harry Buhrman:
Kolmogorov Complexity and Computational Complexity Theory.

Alexander Shen:
Three Approaches to the Quantitative Definition of Information” After (Almost) Forty Years. 

Nikolai Vereshchagin:
Kolmogorov’s Structure Functions with an Application to the Foundations of Model Selection. 

Volodya Vovk:
Predictive Complexity, Information, and Randomness.


CCC STOC 2002:

Lance Fortnow:
The History of Complexity.

Peter Winkler:
Mixing.

John Watrous:
Arthur and Merlin in a Quantum World.

Christos Papadimitriou:
The Joy of Theory.
(Knuth Prize Plenary Talk)


CCC 2001:

Special session in honor of Alan Selman's 60th birthday:

Juris Hartmanis:
???

Lane Hemaspaandra:
???

Steve Homer:
???

Stephen Mahaney:
???


CCC 2000:

Paul Beame:
Time-Space Tradeoff Lower Bounds for Non-uniform Computation.


Russell Impagliazzo:
What complexity and cryptography can teach each other.


Luca Trevisan:
A Survey of Optimal PCP Characterizations of NP.