1. Foreword

   • Volker Diekert and Bruno Durand, Guest Editors

   OriginalPaper Pages: 301 - 301

2. Characterizing TC⁰ in Terms of Infinite Groups

   • Andreas Krebs
   • Klaus-Jorn Lange
   • Stephanie Reifferscheid

   OriginalPaper Pages: 303 - 325

3. Sorting Stably, in Place, with O(n log n) Comparisons and O(n) Moves

   • Gianni Franceschini

   OriginalPaper Pages: 327 - 353

4. Dynamic Complexity Theory Revisited

   • Volker Weber
   • Thomas Schwentick

   OriginalPaper Pages: 355 - 377

5. Robust Polynomials and Quantum Algorithms

   • Harry Buhrman
   • Ilan Newman
   • Ronald de Wolf

   OriginalPaper Pages: 379 - 395

6. Topological Automata

   • Emmanuel Jeandel

   OriginalPaper Pages: 397 - 407

7. Cellular Automata: Real-Time Equivalence between One-Dimensional Neighborhoods

   • Victor Poupet

   OriginalPaper Pages: 409 - 421

8. Truthful Approximation Mechanisms for Scheduling Selfish Related Machines

   • Nir Andelman
   • Yossi Azar
   • Motti Sorani

   OriginalPaper Pages: 423 - 436

9. The Variable Hierarchy of the μ-Calculus Is Strict

   • Dietmar Berwanger
   • Erich Gradel
   • Giacomo Lenzi

   OriginalPaper Pages: 437 - 466

10. Roundings Respecting Hard Constraints

    • Benjamin Doerr

    OriginalPaper Pages: 467 - 483

11. Algorithms to Compute Minimum Cycle Basis in Directed Graphs

    • Telikepalli Kavitha
    • Kurt Mehlhorn

    OriginalPaper Pages: 485 - 505

12. Varieties of Codes and Kraft Inequality

    • F. Burderi
    • A. Restivo

    OriginalPaper Pages: 507 - 520

13. The Power of Commuting with Finite Sets of Words

    • Michal Kunc

    OriginalPaper Pages: 521 - 551

14. Computing Minimal Multi-Homogeneous Bezout Numbers Is Hard

    • Gregorio Malajovich
    • Klaus Meer

    OriginalPaper Pages: 553 - 570