1. Axiomatising Tree-Interpretable Structures

   • Achim Blumensath

   OriginalPaper 12 November 2003 Pages: 3 - 27

2. Games with Uniqueness Properties

   • Shin Aida
   • Marcel Crasmaru
   • Osamu Watanabe

   OriginalPaper 19 November 2003 Pages: 29 - 47

3. Labeling Schemes for Dynamic Tree Networks

   • Amos Korman
   • David Peleg
   • Yoav Rodeh

   OriginalPaper 12 November 2003 Pages: 49 - 75

4. How Many Missing Answers Can Be Tolerated by Query Learners?

   • Hans Ulrich Simon

   OriginalPaper 12 November 2003 Pages: 77 - 94

5. Comparing Verboseness for Finite Automata and Turing Machines

   • Till Tantau

   OriginalPaper 14 November 2003 Pages: 95 - 109

6. Nesting Until and Since in Linear Temporal Logic

   • Denis Thérien
   • Thomas Wilke

   OriginalPaper 12 November 2003 Pages: 111 - 131

7. Existential and Positive Theories of Equations in Graph Products

   • Volker Diekert
   • Markus Lohrey

   OriginalPaper 12 November 2003 Pages: 133 - 156

8. Generalized Model-Checking over Locally Tree-Decomposable Classes

   • Markus Frick

   OriginalPaper 14 November 2003 Pages: 157 - 191

9. Learnability and Definability in Trees and Similar Structures

   • Martin Grohe
   • Gy. Turán

   OriginalPaper 14 November 2003 Pages: 193 - 220

10. Quantum and Approximate Privacy

    • Hartmut Klauck

    OriginalPaper 20 November 2003 Pages: 221 - 246