| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Functional Approach to External Graph Algorithms
|
Abello,
|
|
Inc.
|
32 |
3 |
p. 437-458
|
artikel
|
| 2 |
A Functional Approach to External Graph Algorithms
|
Abello,
|
|
2001
|
32 |
3 |
p. 437-458
|
artikel
|
| 3 |
Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach
|
Cohen,
|
|
Inc.
|
32 |
3 |
p. 459-466
|
artikel
|
| 4 |
Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach
|
Cohen,
|
|
2001
|
32 |
3 |
p. 459-466
|
artikel
|
| 5 |
Embedding Linkages on an Integer Lattice
|
Landau,
|
|
Inc.
|
32 |
3 |
p. 423-436
|
artikel
|
| 6 |
Embedding Linkages on an Integer Lattice
|
Landau,
|
|
2001
|
32 |
3 |
p. 423-436
|
artikel
|
| 7 |
Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks
|
Jansen,
|
|
Inc.
|
32 |
3 |
p. 507-520
|
artikel
|
| 8 |
Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks
|
Jansen,
|
|
2001
|
32 |
3 |
p. 507-520
|
artikel
|
| 9 |
Lower Bounds for Dynamic Data Structures on Algebraic RAMs
|
Ben-Amram,
|
|
Inc.
|
32 |
3 |
p. 364-395
|
artikel
|
| 10 |
Lower Bounds for Dynamic Data Structures on Algebraic RAMs
|
Ben-Amram,
|
|
2001
|
32 |
3 |
p. 364-395
|
artikel
|
| 11 |
Minimum Congestion Redundant Assignments to Tolerate Random Faults
|
Fotakis,
|
|
Inc.
|
32 |
3 |
p. 396-422
|
artikel
|
| 12 |
Minimum Congestion Redundant Assignments to Tolerate Random Faults
|
Fotakis,
|
|
2001
|
32 |
3 |
p. 396-422
|
artikel
|
| 13 |
One-by-One Cleaning for Practical Parallel List Ranking
|
Sibeyn,
|
|
Inc.
|
32 |
3 |
p. 345-363
|
artikel
|
| 14 |
One-by-One Cleaning for Practical Parallel List Ranking
|
Sibeyn,
|
|
2001
|
32 |
3 |
p. 345-363
|
artikel
|
| 15 |
Quasi-Upward Planarity
|
Bertolazzi,
|
|
Inc.
|
32 |
3 |
p. 474-506
|
artikel
|
| 16 |
Quasi-Upward Planarity
|
Bertolazzi,
|
|
2001
|
32 |
3 |
p. 474-506
|
artikel
|
| 17 |
Routing Flow Through a Strongly Connected Graph
|
Erlebach,
|
|
Inc.
|
32 |
3 |
p. 467-473
|
artikel
|
| 18 |
Routing Flow Through a Strongly Connected Graph
|
Erlebach,
|
|
2001
|
32 |
3 |
p. 467-473
|
artikel
|
Tijdschrift beschrijving