| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A new fair scheduling algorithm for periodic tasks on multiprocessors
|
Kim, Heeheon
|
|
2011
|
111 |
7 |
p. 301-309
9 p.
|
artikel
|
| 2 |
A note on improving the performance of approximation algorithms for radiation therapy
|
Biedl, Therese
|
|
2011
|
111 |
7 |
p. 326-333
8 p.
|
artikel
|
| 3 |
Comments on “Generalized rate monotonic schedulability bounds using relative period ratios”
|
Park, Moonju
|
|
2011
|
111 |
7 |
p. 334-337
4 p.
|
artikel
|
| 4 |
Editorial Board
|
|
|
2011
|
111 |
7 |
p. IFC-
1 p.
|
artikel
|
| 5 |
E = I + T : The internal extent formula for compacted tries
|
Boldi, Paolo
|
|
2011
|
111 |
7 |
p. 310-313
4 p.
|
artikel
|
| 6 |
Maximum subset intersection
|
Clifford, Raphaël
|
|
2011
|
111 |
7 |
p. 323-325
3 p.
|
artikel
|
| 7 |
P-hardness of the emptiness problem for visibly pushdown languages
|
Lange, Martin
|
|
2011
|
111 |
7 |
p. 338-341
4 p.
|
artikel
|
| 8 |
Proof system representations of degrees of disjoint NP-pairs
|
Zhang, Liyu
|
|
2011
|
111 |
7 |
p. 348-351
4 p.
|
artikel
|
| 9 |
The indexing for one-dimensional proportionally-scaled strings
|
Peng, Yung-Hsing
|
|
2011
|
111 |
7 |
p. 318-322
5 p.
|
artikel
|
| 10 |
The NP-completeness of the Road Coloring Problem
|
Roman, Adam
|
|
2011
|
111 |
7 |
p. 342-347
6 p.
|
artikel
|
| 11 |
Using 5-isogenies to quintuple points on elliptic curves
|
Moody, Dustin
|
|
2011
|
111 |
7 |
p. 314-317
4 p.
|
artikel
|
Tijdschrift beschrijving