| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Acyclic directed hypercubes may have exponential diameter
|
Everett, H.
|
|
1989
|
32 |
5 |
p. 243-245
3 p.
|
artikel
|
| 2 |
A general implementation of relational recursion with speedup techniques for programmers
|
Clouatre, A.
|
|
1989
|
32 |
5 |
p. 257-262
6 p.
|
artikel
|
| 3 |
Another note on recursive ascent
|
Roberts, George H.
|
|
1989
|
32 |
5 |
p. 263-266
4 p.
|
artikel
|
| 4 |
A one-to-one correspondence between two classes of ordered trees
|
Kemp, R.
|
|
1989
|
32 |
5 |
p. 229-234
6 p.
|
artikel
|
| 5 |
Centering a spanning tree of a biconnected graph
|
Cheston, Grant A.
|
|
1989
|
32 |
5 |
p. 247-250
4 p.
|
artikel
|
| 6 |
Cooperating proofs for distributed programs with multiparty interactions
|
Francez, Nissim
|
|
1989
|
32 |
5 |
p. 235-242
8 p.
|
artikel
|
| 7 |
Factorial languages with quadratically upper bounded growth functions and nonlinearly upper bounded subword complexities
|
Baron, Gerd
|
|
1989
|
32 |
5 |
p. 267-269
3 p.
|
artikel
|
| 8 |
Increasing search efficiency using multiple heuristics
|
Chakrabarti, P.P.
|
|
1989
|
32 |
5 |
p. 275-
1 p.
|
artikel
|
| 9 |
On the relative complexity of some languages in NC1
|
Mix Barrington, David A.
|
|
1989
|
32 |
5 |
p. 251-256
6 p.
|
artikel
|
| 10 |
On the subtree isomorphism problem for ordered trees
|
Mäkinen, Erkki
|
|
1989
|
32 |
5 |
p. 271-273
3 p.
|
artikel
|
| 11 |
Procol: a protocol-constrained concurrent object-oriented language
|
van den Bos, Jan
|
|
1989
|
32 |
5 |
p. 221-227
7 p.
|
artikel
|
Tijdschrift beschrijving