| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A heuristic method for generating large random expressions
|
Bainbridge, John
|
|
1992
|
44 |
3 |
p. 165-170
6 p.
|
artikel
|
| 2 |
An optimal parallel algorithm for computing furthest neighbors in a tree
|
Ghosh, Subir Kumar
|
|
1992
|
44 |
3 |
p. 155-160
6 p.
|
artikel
|
| 3 |
A simple proof of a completeness result for leads-to, in the UNITY logic
|
Pachl, Jan
|
|
1992
|
44 |
3 |
p. 171-
1 p.
|
artikel
|
| 4 |
Mapping a chain task to chained processors
|
Han, Y.
|
|
1992
|
44 |
3 |
p. 141-148
8 p.
|
artikel
|
| 5 |
On the regularity of languages on a binary alphabet generated by copying systems
|
Bovet, Daniel P.
|
|
1992
|
44 |
3 |
p. 119-123
5 p.
|
artikel
|
| 6 |
Polynomial division with a remainder by means of evaluation and interpolation
|
Pan, Victor
|
|
1992
|
44 |
3 |
p. 149-153
5 p.
|
artikel
|
| 7 |
Relating minimal models and pre-requisite-free normal defaults
|
Lobo, Jorge
|
|
1992
|
44 |
3 |
p. 129-133
5 p.
|
artikel
|
| 8 |
Remarks on the structural grammatical inference problem for context-free grammars
|
Mäkinen, Erkki
|
|
1992
|
44 |
3 |
p. 125-127
3 p.
|
artikel
|
| 9 |
The completeness of gp-resolution for annotated logics
|
Lu, James J.
|
|
1992
|
44 |
3 |
p. 135-140
6 p.
|
artikel
|
| 10 |
The complexity of finding arborescences in hypergraphs
|
Woeginger, Gerhard J.
|
|
1992
|
44 |
3 |
p. 161-164
4 p.
|
artikel
|
| 11 |
The complexity of model checking for circumscriptive formulae
|
Cadoli, Marco
|
|
1992
|
44 |
3 |
p. 113-118
6 p.
|
artikel
|
Tijdschrift beschrijving