| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Ancient and New Algorithms for Load Balancing in the lp Norm
|
Avidor, A.
|
|
2001
|
29 |
3 |
p. 422-441
|
artikel
|
| 2 |
Ancient and New Algorithms for Load Balancing in the lp Norm
|
Avidor, A.
|
|
Inc.
|
29 |
3 |
p. 422-441
|
artikel
|
| 3 |
A Randomized Algorithm for Approximate String Matching
|
Atallah, M. J.
|
|
2001
|
29 |
3 |
p. 468-486
|
artikel
|
| 4 |
A Randomized Algorithm for Approximate String Matching
|
Atallah, M. J.
|
|
Inc.
|
29 |
3 |
p. 468-486
|
artikel
|
| 5 |
Efficient Parallel Computation of the Characteristic Polynomial of a Sparse, Separable Matrix
|
Reif, J. H.
|
|
2001
|
29 |
3 |
p. 487-510
|
artikel
|
| 6 |
Efficient Parallel Computation of the Characteristic Polynomial of a Sparse, Separable Matrix
|
Reif, J. H.
|
|
Inc.
|
29 |
3 |
p. 487-510
|
artikel
|
| 7 |
On Two Class-Constrained Versions of the Multiple Knapsack Problem
|
Shachnai, H.
|
|
2001
|
29 |
3 |
p. 442-467
|
artikel
|
| 8 |
On Two Class-Constrained Versions of the Multiple Knapsack Problem
|
Shachnai, H.
|
|
Inc.
|
29 |
3 |
p. 442-467
|
artikel
|
| 9 |
Solving Some Discrepancy Problems in NC
|
Mahajan, S.
|
|
2001
|
29 |
3 |
p. 371-395
|
artikel
|
| 10 |
Solving Some Discrepancy Problems in NC
|
Mahajan, S.
|
|
Inc.
|
29 |
3 |
p. 371-395
|
artikel
|
| 11 |
Static Frequency Assignment in Cellular Networks
|
Narayanan, L.
|
|
2001
|
29 |
3 |
p. 396-409
|
artikel
|
| 12 |
Static Frequency Assignment in Cellular Networks
|
Narayanan, L.
|
|
Inc.
|
29 |
3 |
p. 396-409
|
artikel
|
| 13 |
The Dense k -Subgraph Problem
|
Feige, U.
|
|
2001
|
29 |
3 |
p. 410-421
|
artikel
|
| 14 |
The Dense k -Subgraph Problem
|
Feige, U.
|
|
Inc.
|
29 |
3 |
p. 410-421
|
artikel
|
Tijdschrift beschrijving