| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A faster off-line algorithm for the TCP acknowledgement problem
|
Noga, John
|
|
2002
|
81 |
2 |
p. 71-73
3 p.
|
artikel
|
| 2 |
An efficient method for computing dynamic program slices
|
Goswami, D.
|
|
2002
|
81 |
2 |
p. 111-117
7 p.
|
artikel
|
| 3 |
A new method for constructing pair-wise covering designs for software testing
|
Kobayashi, Noritaka
|
|
2002
|
81 |
2 |
p. 85-91
7 p.
|
artikel
|
| 4 |
Bounds for the Element Distinctness Problem on one-tape Turing machines
|
Petersen, Holger
|
|
2002
|
81 |
2 |
p. 75-79
5 p.
|
artikel
|
| 5 |
Extracting indexing information from XML DTDs
|
Chung, Tae-Sun
|
|
2002
|
81 |
2 |
p. 97-103
7 p.
|
artikel
|
| 6 |
Minimizing the total weighted completion time of deteriorating jobs
|
Bachman, Aleksander
|
|
2002
|
81 |
2 |
p. 81-84
4 p.
|
artikel
|
| 7 |
On computing a longest path in a tree
|
Bulterman, R.W.
|
|
2002
|
81 |
2 |
p. 93-96
4 p.
|
artikel
|
| 8 |
Removing edge-node intersections in drawings of graphs
|
Lai, Wei
|
|
2002
|
81 |
2 |
p. 105-110
6 p.
|
artikel
|
| 9 |
Transfer theorems via sign conditions
|
Koiran, Pascal
|
|
2002
|
81 |
2 |
p. 65-69
5 p.
|
artikel
|
| 10 |
Width-restricted layering of acyclic digraphs with consideration of dummy nodes
|
Branke, Jürgen
|
|
2002
|
81 |
2 |
p. 59-63
5 p.
|
artikel
|
Tijdschrift beschrijving