nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Analysing the implicit complexity of programs
|
Marion, J.Y. |
|
2003 |
183 |
1 |
p. 2-18 17 p. |
artikel |
2 |
An upper bound on the derivational complexity of Knuth–Bendix orderings
|
Hofbauer, Dieter |
|
2003 |
183 |
1 |
p. 43-56 14 p. |
artikel |
3 |
Editorial Board
|
|
|
2003 |
183 |
1 |
p. i- 1 p. |
artikel |
4 |
Editorial Board
|
|
|
2003 |
183 |
1 |
p. IFC- 1 p. |
artikel |
5 |
Guest editorial
|
Dawar, Anuj |
|
2003 |
183 |
1 |
p. 1- 1 p. |
artikel |
6 |
Linear logic and elementary time
|
Danos, Vincent |
|
2003 |
183 |
1 |
p. 123-137 15 p. |
artikel |
7 |
Linear types and non-size-increasing polynomial time computation
|
Hofmann, Martin |
|
2003 |
183 |
1 |
p. 57-85 29 p. |
artikel |
8 |
On the complexity of single-rule datalog queries
|
Gottlob, Georg |
|
2003 |
183 |
1 |
p. 104-122 19 p. |
artikel |
9 |
On the power of tree-walking automata
|
Neven, Frank |
|
2003 |
183 |
1 |
p. 86-103 18 p. |
artikel |
10 |
Term rewriting for normalization by evaluation
|
Berger, Ulrich |
|
2003 |
183 |
1 |
p. 19-42 24 p. |
artikel |