2009 / Rhodes

• Track A - Amin Coja-Oghlan : "A Better algorithm for random k-SAT"

• Track B - Lars Kuhtz, Bernd Finkbeiner : "LTL Path Checking is Efficiently Parallelizable"

• Track C - Alexander Fanghaenel, Thomas Kesselheim, Berthold Voecking : "Improved Algorithms for Latency Minimization in Wireless Network"

2008 / Reykjavik

• Track A - David Buchfuhrer, Christopher Umans : "The complexity of Boolean formula minimization"

• Track B - Mai Gehrke, Serge Grigorieff, Jean-Eric Pin : "Duality and equational theory of regular languages"

• Track C - Sean Hallgren, Alexandra Kolla, Pranab Sen, Shengyu Zhang: "Making Classical honest verifier zero-knowledge protocols secure against quantum attacks"

2007 / Wroclaw

• Track A - Jin-Yi Cai, Pinyan Lu : "Holographic algorithms. The Power of Dimensionality Resolved"

• Track B - Bernard Boigelot, Julien Brusten : "A Generalization of Cobham's Theorem to Automata over Real Numbers"

• Track C - Tal Moran, Moni Naor, Gil Segev : "Deterministic History Independent Strategies for Storing Information on Write Once Memories"

2006 / Venice

• Track A - Leslie Ann Goldberg, Mike Paterson : "On counting homomorphisms to directed acyclic graphs"

• Track B - Filip Murlak : "The Wadge Hierarchy of Deterministic Tree Languages"

• Track C - Iftach Haitner, Danny Harnik, Omer Reingold: "Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions"

2005 / Lisboa

• Track B - Martin Grohe, Christoph Koch, Nicole Schweikardt : "Tight Lower Bounds for Query Processing on Streaming and External Memory Data"

• Track C - Marius Zimand : "Simple Extractors Via Constructions of Cryptographic Pseudo-random Generators"

2004 / Turku

• Track A - Christoph Dürr, Mark Heiligman, Peter Hoyer, Mehdi Mhalla : "Quantum query complexity of some graph problems"

• Track B - Mikolaj Bojanczyk, Thomas Colcombet : "Tree-Walking Automata Cannot Be Determinized"

2003 / Eindhoven

• Track A - Anna Gal, Peter Bro Miltersen : "The cell probe complexity of succint data structures"

• Track B - Marielle Stoelinga, Frits Vaandrager : "A testing scenario for probabilistic automata"

2002 / Málaga

• Lars Engebretsen, Jonas Holmerin, Alexander Russell: "Inapproximability Results for Equations over Finite Groups"

2001 /  Creta

• Track A - William Hesse : "Division is in Uniform TC0"

• Track B - Parosh Aziz Abdulla, Luc Boasson, Ahmed Bouajjani : "Effective Lossy Queue Languages"

2000 /  Geneva

• Track A - Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schöning : "Deterministic algorithms for k-SAT based on covering codes and local search"

• Track B - Dan R. Ghica, Guy McCusker : "Reasoning about idealized Algol using regular languages"

• Track C - Seth Pettie, Vijaya Ramachandran : "An optimal minimum spanning tree algorithm"