nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A faster approximation algorithm for the Steiner problem in graphs
|
Mehlhorn, Kurt |
|
1988 |
27 |
3 |
p. 125-128 4 p. |
artikel |
2 |
A simple parallel algorithm for finding a satisfying truth assignment to a 2-cnf formula
|
Cook, Stephen A. |
|
1988 |
27 |
3 |
p. 141-145 5 p. |
artikel |
3 |
Logic programming with external procedures: introducing S-unification
|
Leszczylowski, Jacek |
|
1988 |
27 |
3 |
p. 159-165 7 p. |
artikel |
4 |
On generating all maximal independent sets
|
Johnson, David S. |
|
1988 |
27 |
3 |
p. 119-123 5 p. |
artikel |
5 |
On hardness of one-way functions
|
Watanabe, Osamu |
|
1988 |
27 |
3 |
p. 151-157 7 p. |
artikel |
6 |
Order statistics on a hypercube
|
Chandran, Sharat |
|
1988 |
27 |
3 |
p. 129-132 4 p. |
artikel |
7 |
Parallel circle-cover algorithms
|
Bertossi, Alan A. |
|
1988 |
27 |
3 |
p. 133-139 7 p. |
artikel |
8 |
Positive Boolean dependencies
|
Berman, Joel |
|
1988 |
27 |
3 |
p. 147-150 4 p. |
artikel |
9 |
Propositional description of finite cause-effect structures
|
Holenderski, Leszek |
|
1988 |
27 |
3 |
p. 111-117 7 p. |
artikel |