nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An almost perfect heuristic for the N nonattacking queens problem
|
Kalé, L.V. |
|
1990 |
34 |
4 |
p. 173-178 6 p. |
artikel |
2 |
CASOP: A fast algorithm for computing the n-ary composition of a binary associative operator
|
Cooper, James |
|
1990 |
34 |
4 |
p. 209-213 5 p. |
artikel |
3 |
Coloring algorithms for K 5-minor free graphs
|
Khuller, Samir |
|
1990 |
34 |
4 |
p. 203-208 6 p. |
artikel |
4 |
Constant time sorting on a processor array with a reconfigurable bus system
|
Wang, Biing-Feng |
|
1990 |
34 |
4 |
p. 187-192 6 p. |
artikel |
5 |
New sequential and parallel algorithms for interval graph recognition
|
Ramalingam, G. |
|
1990 |
34 |
4 |
p. 215-219 5 p. |
artikel |
6 |
Parallel algorithms for gossiping by mail
|
Bagchi, A. |
|
1990 |
34 |
4 |
p. 197-202 6 p. |
artikel |
7 |
Recognizing breadth-first search trees in linear time
|
Manber, Udi |
|
1990 |
34 |
4 |
p. 167-171 5 p. |
artikel |
8 |
Sequence matching with binary codes
|
Bradford, James H. |
|
1990 |
34 |
4 |
p. 193-196 4 p. |
artikel |
9 |
Some proofs of data refinement
|
Lutz, Earlin |
|
1990 |
34 |
4 |
p. 179-185 7 p. |
artikel |