nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A note on word chains and regular languages
|
Roth, Peter |
|
1989 |
30 |
1 |
p. 15-18 4 p. |
artikel |
2 |
Bismulation and effectiveness
|
Darondeau, Ph. |
|
1989 |
30 |
1 |
p. 19-20 2 p. |
artikel |
3 |
Editorial Board
|
|
|
1989 |
30 |
1 |
p. ii- 1 p. |
artikel |
4 |
Increasing search efficiency using multiple heuristics
|
Chakrabarti, P.P. |
|
1989 |
30 |
1 |
p. 33-36 4 p. |
artikel |
5 |
L-infinity interdistance selection by parametric search
|
Salowe, Jeffrey S. |
|
1989 |
30 |
1 |
p. 9-14 6 p. |
artikel |
6 |
Lower bounds for synchronous circuits and planar circuits
|
Turán, György |
|
1989 |
30 |
1 |
p. 37-40 4 p. |
artikel |
7 |
Lower bounds on the area of finite-state machines
|
Foster, M.J. |
|
1989 |
30 |
1 |
p. 1-7 7 p. |
artikel |
8 |
Parallel evaluation of the determinant and of the inverse of a matrix
|
Galil, Zvi |
|
1989 |
30 |
1 |
p. 41-45 5 p. |
artikel |
9 |
Real-time programming
|
C.R. Hehner, Eric |
|
1989 |
30 |
1 |
p. 51-56 6 p. |
artikel |
10 |
Subtree isomorphism is NC reducible to bipartite perfect matching
|
Lingas, Andrzej |
|
1989 |
30 |
1 |
p. 27-32 6 p. |
artikel |
11 |
There are no p-complete families of symmetric boolean functions
|
Geréb-Graus, Mihály |
|
1989 |
30 |
1 |
p. 47-49 3 p. |
artikel |
12 |
The reflected tree hierarchy for protection and sharing
|
Sandhu, Ravinderpal Singh |
|
1989 |
30 |
1 |
p. 21-26 6 p. |
artikel |