| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An Algorithm for Handling Many Relational Calculus Queries Efficiently
|
Willard, Dan E.
|
|
2002
|
65 |
2 |
p. 295-331
37 p.
|
artikel
|
| 2 |
Generalization Error of Combined Classifiers
|
Mason, Llew
|
|
2002
|
65 |
2 |
p. 415-438
24 p.
|
artikel
|
| 3 |
New Lowness Results for ZPPNP and Other Complexity Classes
|
Arvind, V.
|
|
2002
|
65 |
2 |
p. 257-277
21 p.
|
artikel
|
| 4 |
Node Replacements in Embedding Normal Form
|
Skodinis, K.
|
|
2002
|
65 |
2 |
p. 351-376
26 p.
|
artikel
|
| 5 |
Online Learning of Binary and n-ary Relations over Clustered Domains
|
Nakamura, Atsuyoshi
|
|
2002
|
65 |
2 |
p. 224-256
33 p.
|
artikel
|
| 6 |
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts
|
Berman, Piotr
|
|
2002
|
65 |
2 |
p. 332-350
19 p.
|
artikel
|
| 7 |
Papers to Appear in Forthcoming Issues
|
|
|
2002
|
65 |
2 |
p. 439-
1 p.
|
artikel
|
| 8 |
Reducibility between Classes of Port Graph Grammar
|
Stewart, Charles
|
|
2002
|
65 |
2 |
p. 169-223
55 p.
|
artikel
|
| 9 |
Some Decision Problems Concerning Semilinearity and Commutation
|
Harju, Tero
|
|
2002
|
65 |
2 |
p. 278-294
17 p.
|
artikel
|
| 10 |
The Equivalence Problem for DF0L Languages and Power Series
|
Honkala, Juha
|
|
2002
|
65 |
2 |
p. 377-392
16 p.
|
artikel
|
| 11 |
Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds
|
Pighizzini, Giovanni
|
|
2002
|
65 |
2 |
p. 393-414
22 p.
|
artikel
|
Tijdschrift beschrijving