| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Addendum to “A fully parallel algorithm for residue to binary conversion”
|
Barsi, F.
|
|
1995
|
56 |
2 |
p. 121-
1 p.
|
artikel
|
| 2 |
An algorithm for “Ulam's Game” and its application to error correcting codes
|
Lawler, Eugene L.
|
|
1995
|
56 |
2 |
p. 89-93
5 p.
|
artikel
|
| 3 |
An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs
|
Yue-Li, Wang
|
|
1995
|
56 |
2 |
p. 83-87
5 p.
|
artikel
|
| 4 |
A note on the Horton-Strahler number for random trees
|
Devroye, Luc
|
|
1995
|
56 |
2 |
p. 95-99
5 p.
|
artikel
|
| 5 |
A simpler derivation of schema hazard in genetic algorithms
|
Chakraborty, Uday Kumar
|
|
1995
|
56 |
2 |
p. 77-78
2 p.
|
artikel
|
| 6 |
Cryptanalysis of a public key system based on Diophantine equations
|
Cusick, Thomas W.
|
|
1995
|
56 |
2 |
p. 73-75
3 p.
|
artikel
|
| 7 |
Minimizing elimination tree height can increase fill more than linearly
|
Aspvall, Bengt
|
|
1995
|
56 |
2 |
p. 115-120
6 p.
|
artikel
|
| 8 |
On a generalization of the p-Center Problem
|
Krumke, S.O.
|
|
1995
|
56 |
2 |
p. 67-71
5 p.
|
artikel
|
| 9 |
On reductions to sets that avoid EXPSPACE
|
Arvind, V.
|
|
1995
|
56 |
2 |
p. 109-114
6 p.
|
artikel
|
| 10 |
Steiner set and connected domination in trapezoid graphs
|
Liang, Y.Daniel
|
|
1995
|
56 |
2 |
p. 101-108
8 p.
|
artikel
|
| 11 |
The worst-case running time of the random simplex algorithm is exponential in the height
|
Broder, Andrei Z.
|
|
1995
|
56 |
2 |
p. 79-81
3 p.
|
artikel
|
Tijdschrift beschrijving