External Links

    Journal: Theory Comput. Syst.

    Volume 37, Issue 1

    3 -- 27Achim Blumensath. Axiomatising Tree-Interpretable Structures
    29 -- 47Shin Aida, Marcel Crâsmaru, Kenneth W. Regan, Osamu Watanabe. Games with Uniqueness Properties
    49 -- 75Amos Korman, David Peleg, Yoav Rodeh. Labeling Schemes for Dynamic Tree Networks
    77 -- 94Hans-Ulrich Simon. How Many Missing Answers Can Be Tolerated by Query Learners?
    95 -- 109Till Tantau. Comparing Verboseness for Finite Automata and Turing Machines
    111 -- 131Denis Thérien, Thomas Wilke. Nesting Until and Since in Linear Temporal Logic
    133 -- 156Volker Diekert, Markus Lohrey. Existential and Positive Theories of Equations in Graph Products
    157 -- 191Markus Frick. Generalized Model-Checking over Locally Tree-Decomposable Classes
    193 -- 220Martin Grohe, György Turán. Learnability and Definability in Trees and Similar Structures
    221 -- 246Hartmut Klauck. Quantum and Approximate Privacy
    runs on