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)


STOC 2010:

David S. Johnson:
Approximation Algorithms in Theory and Practice 
(Knuth Prize Lecture)

Tutorials:

Ravindran Kannan:
Spectral Methods for Matrices and Tensors

Michel Talagrand:
Are Many Small Sets Explicitly Small?

Andrea Montanari:
Message Passing Algorithms: a Success Looking for Theoreticians


STOC 2009:

Shafi Goldwasser:
Cryptography without (hardly any) Secrets?
(Athena Lecture Award)

Valiant 60th Birthday Celebration:

Stephen Cook:
Pebbles and Branching Programs.

Paul Valiant:
Leveraging Collusion in Unrestricted Combinatorial Auctions.

Michael Rabin:
Completely Anonymous, Secure, Verifiable, and Secrecy Preserving Auctions.

Vijay Vazirani:
Combinatorial Algorithms for Convex Programs Capturing Market Equilibria and Nash Bargaining Solutions.

Rocco Servedio:
A Quarter-Century of Efficient Learnability.

Michael Kearns:
Computational Learning Theory and Beyond.

Vitaly Feldman:
On the Learning Power of Evolution.

Mike Paterson:
Strassen Symmetries.

Jin-Yi Cai:
Proving Dichotomy Theorems for Counting Problems.

Mark Jerrum:
The Permanent: Algorithms.

Avi Wigderson:
Valiant's Permanent Gift to Complexity Theory.


STOC 2008:

Jennifer Rexford:
Rethinking Internet Routing

David Haussler:
Computing How We Became Human

Ryan O'Donnell:
Some Topics in Analysis of Boolean Functions 
(Tutorial)


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)


STOC 2006:

Prabhakar Raghavan:
The changing face of web search: Algorithms, Auctions and Advertising.

Russell Impagliazzo:
Can Every Randomized Algorithm be Derandomized?


STOC 2005:

Lance Fortnow:
Beyond NP: The Work and Legacy of Larry Stockmeyer.

Larry Stockmeyer Commemoration:

Nicholas Pippenger:
Larry Stockmeyer’s Work in Computational Complexity Theory.

Albert Meyer:
What We Were Thinking: A Supervisor’s Reminiscence. 

Richard Karp:
Congestion-Delay Trade-Offs in Geographically Distributed Networks.

Anne Condon:
What can be Proved to a Finite State Verifier?
Larry Stockmeyer’s Contributions to Interactive Proof Systems.

Miklos Ajtai:
Secure Computing.

Christopher Umans:
Optimization Problems in the Polynomial-Time Hierarchy.

Cynthia Dwork:
Larry Stockmeyer’s Last Work et Sequelae.


STOC 2004:

Andris Ambainis:
Quantum Algorithms a Decade After Shor.

Eva Tardos:
Network Games.

Avi Wigderson:
Depth Through Breadth, or Why Should We Attend Talks In Other Areas?


FCRC 2003:

Michael Rabin:
Provably Unbreakable Encryption: Theory and Implementation.

Michael Flynn:
Computer Architecture and Technology: Some Thoughts on the Road Ahead.

Barbara Liskov:
Issues in Peer-to-Peer Computing.

Hector Garcia-Molina:
WebBase: Building a Web Warehouse.

James Kurose:
Networking... successes, new challenges, and an expanding waist, as the field approaches 40.

Miklos Ajtai:
Random Lattices 
(Knuth Prize lecture)

Leonard M. Adleman, Ronald L. Rivest and Adi Shamir:
- Pre-RSA.
- The Early Days of RSA -- History and Lessons.
- Cryptography: State of the Science.
(Turing Award Lectures)


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)


STOC SPAA ICALP 2001:

Christos H. Papadimitriou: 
Algorithms, games, and the internet. 

Boris A. Trakhtenbrot: 
Automata, circuits and hybrids: facets of continuous time.

Ahmed Bouajjani: 
Languages, Rewriting Systems, and Verification of Infinite-State Systems. 

Martin Große-Rhode: 
Integrating Semantics for Object-Oriented System Models. 

Mogens Nielsen: 
Modelling with Partial Orders - Why and Why Not? 

Ingo Wegener: 
Theoretical Aspects of Evolutionary Algorithms. 

Uriel Feige:
Reflections on the PCP theorem and its consequences.
(Godel Award Lecture)

Andrew C. C. Yao:
Some Perspectives on Computational Complexity.
(Turing Award Lecture)


STOC 2000:

???