nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An approximation result for a duo-processor task scheduling problem
|
Dell'Olmo, P. |
|
1997 |
61 |
4 |
p. 195-200 6 p. |
artikel |
2 |
Black-box polynomial resultants
|
Encarnación, Mark J. |
|
1997 |
61 |
4 |
p. 201-204 4 p. |
artikel |
3 |
Connectivity of the crossed cube
|
Kulasinghe, Priyalal D. |
|
1997 |
61 |
4 |
p. 221-226 6 p. |
artikel |
4 |
Dynamic suffix tree and two-dimensional texts management
|
Choi, Y. |
|
1997 |
61 |
4 |
p. 213-220 8 p. |
artikel |
5 |
Faithful 1-edge fault tolerant graphs
|
Wang, Shih-Yih |
|
1997 |
61 |
4 |
p. 173-181 9 p. |
artikel |
6 |
Improving bounds for the number of correlation immune Boolean functions
|
Park, Sung Mo |
|
1997 |
61 |
4 |
p. 209-212 4 p. |
artikel |
7 |
Note on shortest and nearest lattice vectors
|
Henk, Martin |
|
1997 |
61 |
4 |
p. 183-188 6 p. |
artikel |
8 |
On approximating the memory-Constrained Module Allocation Problem
|
Roupin, Frédéric |
|
1997 |
61 |
4 |
p. 205-208 4 p. |
artikel |
9 |
Revisiting a result of Ko
|
Cintioli, Patrizio |
|
1997 |
61 |
4 |
p. 189-194 6 p. |
artikel |