ICALP 2011:

Eva Tardos:
Welfare and Revenue in Ad Auctions

Rajeev Alur:
Streaming String Transducers

Ronen Shaltiel:
An Introduction to Randomness Extractors

Thore Husfeldt:
Invitation to Algorithmic Uses of Inclusion-Exclusion

Catuscia Palamidessi:
On the relation between Differential Privacy and Quantitative Information Flow


ICALP 2010:

Pierre Fraigniaud:
Informative Labeling Schemes

Jean Goubault-Larrecq:
Noetherian Spaces in Verification

Burkhard Monien:
Local Search: Simple, Successful, but Sometimes Sluggish

Joel Ouaknine:
Towards a Theory of Time-Bounded Verification

Roger Wattenhofer:
Physical Algorithms

Emo Welzl:
When Conflicting Constraints Can be Resolved -- the Lovasz Local Lemma and Satisfiability


ICALP 2009:

Kurt Mehlhorn:
Assigning Papers to Referees

Thomas Henzinger:
A Survey of Stochastic Games with Limsup and Liminf Objectives

Georg Gottlob:
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions

Noam Nisan:
Google's Auction for TV Ads

Christos Papadimitriou:
Algorithmic Game Theory: A Snapshot

Special Event for Christos Papadimitriou:

Richard Karp:
Some Algorithmic Problems Arising in Systems Biology and Statistical Genetics

Laszlo Lovasz:
???

Noam Nisan:
???

Tim Roughgarden:
???

Mihalis Yannakakis:
???


ICALP 2008:

Ran Canetti:
Composable Formal Security Analysis: Juggling Soundness, Simplicity and Efficiency

Bruno Courcelle:
Graph Structure and Monadic Second-order Logic: Language Theoretical Aspects 

Javier Esparza:
Newtonian Program Analysis 

Muthu Muthukrishnan:
Internet Ad Auctions: Insights and Directions

Peter Winkler:
Otimality and Greed in Dynamic Allocation 

Daniel A. Spielman and Shang-Hua Teng:
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
(Gödel Award Lecture)

Leslie G. Valiant:
???


ICALP 2007:

Bernard Chazelle:
Ushering in a New Era of Algorithm Design.

Ivan Damgĺrd:
A "Proof-Reading" of some Issues in Cryptography.

Fred B. Schneider:
Credentials-Based Authorization: Evaluation and Implementation.

Fedor V. Fomin:
Subexponential Parameterized Algorithms.

Gordon Plotkin: 
The Algebraic Theory of Effects.

Michael O. Rabin:
Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations, and Applications.


ICALP 2006:

Alon Noga: 
Additive Approximation for Edge-Deletion Problems.

Cynthia Dwork: 
Differential Privacy.

Simon Peyton Jones: 
Composable memory transactions.

Prakash Panangaden: 
The One Way to Quantum Computation.


ICALP 2005:

Leslie G. Valiant: 
Holographic Circuits. 

John C. Mitchell: 
Security Analysis of Network Protocols: Logical and Computational Methods

Giuseppe Castagna: 
A Gentle Introduction to Semantic Subtyping. 

Leonid Libkin: 
Logics for Unranked Trees: An Overview. 

Burkhard Monien: 
Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture. 

Adi Shamir:
Cryptography - State of the Science


ICALP 2004:

Philippe Flajolet:
Theory and Practice of Probabilistic Counting.

Wojciech Rytter:
Grammar Compression, LZ-encodings and String Algorithms with Implicit Input.

Monika Henzinger:
The Past, Present, and Future of Web Search Engines.

Mihalis Yannakakis:
Testing, Optimization, and Games.

Alexander Razborov:
Feasible Proofs and Computations: Partnership and Fusion.

Martin Hofmann:
What do program logics and type systems have in common?

Robert Harper:
Self-Adjusting Computation.


ICALP 2003:

Jan Bergstra: 
Polarized process algebra and program equivalence.

Anne Condon: 
Problems in RNA secondary structure prediction and design.

Amos Fiat: 
Some issues regarding search, censorship, and anonymity in peer to peer networks.

Petra Mutzel: 
The SPQR-tree data structure in graph drawing.

Doron Peled: 
Model checking and testing combined.

Moshe Vardi: 
Logic and automata, a match made in heaven.


ICALP 2002:

John H. Reif: 
Molecular Assembly and Computation: From Theory to Experimental Demonstrations. 

Madhav V. Marathe: 
Towards a Predictive Computational Complexity Theory. 

Andrew M. Pitts: 
Equivariant Syntax and Semantics. 

Géraud Sénizergues: 
L(A) = L(B)? Decidability Results from Complete Formal Systems. 

Alberto Del Lungo, Andrea Frosini, Maurice Nivat, Laurent Vuillon: 
Discrete Tomography: Reconstruction under Periodicity Constraints. 

Heikki Mannila: 
Local and Global Methods in Data Mining: Basic Techniques and Open Problems. 

Manuel V. Hermenegildo, Germán Puebla, Francisco Bueno, Pedro López-García: 
Program Debugging and Validation Using Semantic Approximations and Partial Specifications.


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)


ICALP RANDOM 2000:

Samson Abramsky:
Game Semantics: Achievements and Prospects.  

Gregor Engels:
Graph Transformation as Unifying Formal Framework for System Modeling and Model Evolution. 

Johan Hastad:
Which NP-hard optimization problems admit non-trivial efficient approximation algorithms? 

Roberto Gorrieri:
Non Interference for Analysis of Cryptographic Protocols. 

Zohar Manna:
Alterating Verification Diagrams.  

Kurt Mehlhorn:
Graph Algorithms and Constraint Programming. 

Oded Goldreich:
Pseudorandomness.

Andrei Broder:
Min-wise Independent Permutations: Theory and Practice.