nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An efficient distributed termination test
|
Mattern, Friedemann |
|
1989 |
31 |
4 |
p. 203-208 6 p. |
artikel |
2 |
An improved data-dependency-based backtracking scheme for prolog
|
Malhotra, Vishv Mohan |
|
1989 |
31 |
4 |
p. 185-189 5 p. |
artikel |
3 |
An O(nlog2 n) algorithm for the maximum weigthed tardiness problem
|
Hochbaum, Dorit S. |
|
1989 |
31 |
4 |
p. 215-219 5 p. |
artikel |
4 |
A space efficient greedy triangulation algorithm
|
Goldman, Sally A. |
|
1989 |
31 |
4 |
p. 191-196 6 p. |
artikel |
5 |
Error bounds on disk arrangement using frequency information
|
Carson, Scott D. |
|
1989 |
31 |
4 |
p. 209-213 5 p. |
artikel |
6 |
Fast approximations to discrete optimal quantization
|
Wu, Xiaolin |
|
1989 |
31 |
4 |
p. 175-179 5 p. |
artikel |
7 |
Fault-tolerant routing in unique-path multistage interconnection networks
|
Varma, Anujan |
|
1989 |
31 |
4 |
p. 197-201 5 p. |
artikel |
8 |
Parallel iterated bucket sort
|
Chlebus, Bogdan S. |
|
1989 |
31 |
4 |
p. 181-183 3 p. |
artikel |
9 |
Unit-length embedding of binary trees on a square grid
|
Gregori, Angelo |
|
1989 |
31 |
4 |
p. 167-173 7 p. |
artikel |