STACS 2004 21st Symposium on Theoretical Aspects of Computer Science Le Corum, Montpellier, France March 25-27, 2004

Already avalaible : STACS 2005 web site

Invited speakers

• Erich Grädel (Aachen University of Technologie, Germany)
• Claire Kenyon (LIX, Ecole Polytechnique, France)
• Robin Thomas (Georgia Institute of Technology, Atlanta, USA)

Scopes

Papers presented at STACS consist in original and unpublished research on theoretical aspects of computer science. Typical areas include (but are not limited to):

• Algorithms and data structures, including: parallel and distributed algorithms, computational geometry, cryptography, algorithmic learning theory;
• Automata and formal languages;
• Computational and structural complexity;
• Logic in computer science, including: semantics, specification, and verification of programs, rewriting and deduction;
• Current challenges, for example: theory, models, and algorithms for biological computing, quantum computing, mobile and net computing.

Program committee

• Michel Habib (Montpellier), chair
  
• Volker Diekert (Stuttgart), co-chair
• Olivier Carton (Paris)
• Philippe Darondeau (Rennes)
• Manfred Droste (Dresden)
• Cyril Gavoille (Bordeaux)
• Bernd Gärtner (Zurich)
• Klaus Jansen (Kiel, Zurich)
• Pascal Koiran (Lyon)
• Kim G Larsen (BRICS)
• Stefano Leonardi (Roma)
• Andrzej Pelc (Québec)
• Giovanni Pighizzini (Milano)
• Christian Schindelhauer (Paderborn)
• Uwe Schöning (Ulm)

Organizing committee

• Christophe Paul, president
  
• Céline Berger
• Toufik Bennouass
• Mohamed Bouklit
• Christophe Crespelle
• Fabien de Montgolfier
• Fabien Mathieu