| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A direct routing algorithm for the bit-reversal permutation on a shuffle-exchange network
|
Birkhoff, Ingrid J.M.
|
|
1985
|
21 |
5 |
p. 259-268
10 p.
|
artikel
|
| 2 |
A fast algorithm for renaming a set of clauses as a horn set
|
Mannila, Heikki
|
|
1985
|
21 |
5 |
p. 269-272
4 p.
|
artikel
|
| 3 |
An efficient Dijkstra-like labeling method for computing shortest odd/even paths
|
Derigs, Ulrich
|
|
1985
|
21 |
5 |
p. 253-258
6 p.
|
artikel
|
| 4 |
A note on natural selection
|
Dobosiewicz, Wlodzimierz
|
|
1985
|
21 |
5 |
p. 239-243
5 p.
|
artikel
|
| 5 |
Author index volume 21 (1985)
|
|
|
1985
|
21 |
5 |
p. 273-274
2 p.
|
artikel
|
| 6 |
Decomposing a set of points into chains, with applications to permutation and circle graphs
|
Supowit, Kenneth J.
|
|
1985
|
21 |
5 |
p. 249-252
4 p.
|
artikel
|
| 7 |
Incremental string matching
|
Meyer, Bertrand
|
|
1985
|
21 |
5 |
p. 219-227
9 p.
|
artikel
|
| 8 |
Performance evaluation of systems of cyclic sequential processes with mutual exclusion using Petri nets
|
Magott, Jan
|
|
1985
|
21 |
5 |
p. 229-232
4 p.
|
artikel
|
| 9 |
The unwind property for programs with bounded memory
|
Kfoury, A.J.
|
|
1985
|
21 |
5 |
p. 233-238
6 p.
|
artikel
|
| 10 |
Tight chip area lower bounds for discrete Fourier and Walsh-Hadamard transformations
|
Ďuriš, Pavol
|
|
1985
|
21 |
5 |
p. 245-247
3 p.
|
artikel
|
Tijdschrift beschrijving