STACS 2011: Susanne Albers: Energy-Efficient Algorithms Georg Gottlob: Structural Decomposition Methods, and What They are Good For Veronique Cortier: How to prove security of communication protocols STACS 2010: Rolf Niedermeier: Reflections on Multivariate Algorithmics and Problem Parameterization. Jacques Stern: Mathematics, Cryptology, Security. Mikolaj Bojanczyk: Beyond Omega-Regular Languages. STACS 2009: Jean-Eric Pin: Profinite Methods in Automata Theory. Nicole Schweikardt: Lower Bounds for Multi-Pass Processing of Multiple Data Streams. Monika Henzinger: Algorithms Research on the Web. STACS 2008: Maxime Crochemore: Understanding maximal repetitions in strings. Thomas Schwentick: A little bit infinite? On adding data to finitely labelled structures. Mihalis Yannakakis: Equilibria, Fixed Points and Complexity Classes. STACS 2007: Serge Abiteboul: A Calculus and Algebra for Distributed Data Management. Moshe Y. Vardi: The Büchi Complementation Saga. Dorothea Wagner: Speed-Up Techniques for Shortest-Path Computations. STACS 2006: Philippe Flajolet: The Ubiquitous Digital Tree. Leonid Levin: Symmetry Breaking in Computing Media. Helmut Seidl: Interprocedurally Analyzing Polynomial Identities. STACS 2005: Manindra Agrawal: Automorphisms of Finite Rings and Applications to Complexity of Problems. Mireille Bousquet-Mélou: Algebraic Generating Functions in Enumerative Combinatorics and Context-Free Languages. Uwe Schöning: Algorithmics in Exponential Time. STACS 2004: Claire Kenyon: Approximation Schemes for Metric Clustering Problems. Erich Grädel: Positional Determinacy of Infinite Games. Robin Thomas: ??? STACS 2003: Victor Vianu: Logic as a Query Language: From Frege to XML. Alain Viari: How Does Computer Science Change Molecular Biology? STACS 2002: Michael O. Rabin: Hyper-Encryption and Everlasting Security. Christian Scheideler: Models and Techniques for Communication in Dynamic Networks. Gilles Dowek: What Is a Theory? STACS 2001: Julien Cassaigne: Recurrence in Infinite Words. Martin Grohe: Generalized Model-Checking Problems for First-Order Logic. Dexter Kozen: Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra. STACS 2000: Mohammad Amin Shokrollahi: Codes, Graphs, and Algorithms. Tom Henzinger: A Classification of Symbolic Transition Systems. Pascal Koiran: Circuits versus Trees in Algebraic Complexity.