no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
Axiomatising Tree-Interpretable Structures
|
Blumensath, Achim |
|
2003 |
37 |
1 |
p. 3-27 |
article |
2 |
Comparing Verboseness for Finite Automata and Turing Machines
|
Tantau, Till |
|
2003 |
37 |
1 |
p. 95-109 |
article |
3 |
Existential and Positive Theories of Equations in Graph Products
|
Diekert, Volker |
|
2003 |
37 |
1 |
p. 133-156 |
article |
4 |
Games with Uniqueness Properties
|
Aida, Shin |
|
2003 |
37 |
1 |
p. 29-47 |
article |
5 |
Generalized Model-Checking over Locally Tree-Decomposable Classes
|
Frick, Markus |
|
2003 |
37 |
1 |
p. 157-191 |
article |
6 |
How Many Missing Answers Can Be Tolerated by Query Learners?
|
Simon, Hans Ulrich |
|
2003 |
37 |
1 |
p. 77-94 |
article |
7 |
Labeling Schemes for Dynamic Tree Networks
|
Korman, Amos |
|
2003 |
37 |
1 |
p. 49-75 |
article |
8 |
Learnability and Definability in Trees and Similar Structures
|
Grohe, Martin |
|
2003 |
37 |
1 |
p. 193-220 |
article |
9 |
Nesting Until and Since in Linear Temporal Logic
|
Thérien, Denis |
|
2003 |
37 |
1 |
p. 111-131 |
article |
10 |
Quantum and Approximate Privacy
|
Klauck, Hartmut |
|
2003 |
37 |
1 |
p. 221-246 |
article |