Journals in DBLP

Theory Comput. Syst.
2004, volume: 37, number: 1

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