nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Divide-and-Conquer Approach to the Minimum k -Way Cut Problem
|
Kamidoi, |
|
Inc. |
32 |
2 |
p. 262-276 |
artikel |
2 |
A Divide-and-Conquer Approach to the Minimum k -Way Cut Problem
|
Kamidoi, |
|
2001 |
32 |
2 |
p. 262-276 |
artikel |
3 |
New Algorithms for Disk Scheduling
|
Andrews, |
|
Inc. |
32 |
2 |
p. 277-301 |
artikel |
4 |
New Algorithms for Disk Scheduling
|
Andrews, |
|
2001 |
32 |
2 |
p. 277-301 |
artikel |
5 |
On the Competitive Theory and Practice of Online List Accessing Algorithms
|
Bachrach, |
|
Inc. |
32 |
2 |
p. 201-245 |
artikel |
6 |
On the Competitive Theory and Practice of Online List Accessing Algorithms
|
Bachrach, |
|
2001 |
32 |
2 |
p. 201-245 |
artikel |
7 |
Optimal Time-Critical Scheduling via Resource Augmentation
|
Phillips, |
|
Inc. |
32 |
2 |
p. 163-200 |
artikel |
8 |
Optimal Time-Critical Scheduling via Resource Augmentation
|
Phillips, |
|
2001 |
32 |
2 |
p. 163-200 |
artikel |
9 |
Property Testing in Bounded Degree Graphs
|
Goldreich, |
|
Inc. |
32 |
2 |
p. 302-343 |
artikel |
10 |
Property Testing in Bounded Degree Graphs
|
Goldreich, |
|
2001 |
32 |
2 |
p. 302-343 |
artikel |
11 |
Scheduling Independent Multiprocessor Tasks
|
Amoura, |
|
Inc. |
32 |
2 |
p. 247-261 |
artikel |
12 |
Scheduling Independent Multiprocessor Tasks
|
Amoura, |
|
2001 |
32 |
2 |
p. 247-261 |
artikel |