nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A simple factor-3 approximation for labeling points with circles
|
Jiang, Minghui |
|
2003 |
87 |
2 |
p. 101-105 5 p. |
artikel |
2 |
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
|
Li, Tseng-Kuei |
|
2003 |
87 |
2 |
p. 107-110 4 p. |
artikel |
3 |
Board of Editors
|
|
|
2003 |
87 |
2 |
p. IFC- 1 p. |
artikel |
4 |
Inclusion–exclusion for k-CNF formulas
|
Amano, Kazuyuki |
|
2003 |
87 |
2 |
p. 111-117 7 p. |
artikel |
5 |
Maximum number of edges joining vertices on a cube
|
Abdel-Ghaffar, Khaled A.S. |
|
2003 |
87 |
2 |
p. 95-99 5 p. |
artikel |
6 |
On computing the semi-sum of two integers
|
Ruggieri, Salvatore |
|
2003 |
87 |
2 |
p. 67-71 5 p. |
artikel |
7 |
Optimal one-page tree embeddings in linear time
|
Hochberg, Robert A. |
|
2003 |
87 |
2 |
p. 59-66 8 p. |
artikel |
8 |
Quantum zero-error algorithms cannot be composed
|
Buhrman, Harry |
|
2003 |
87 |
2 |
p. 79-84 6 p. |
artikel |
9 |
Reduced Error Pruning of branching programs cannot be approximated to within a logarithmic factor
|
Nock, Richard |
|
2003 |
87 |
2 |
p. 73-78 6 p. |
artikel |
10 |
Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
|
Wu, Chin-Chia |
|
2003 |
87 |
2 |
p. 89-93 5 p. |
artikel |
11 |
The number of tests required to search an unordered table
|
Fredman, Michael L. |
|
2003 |
87 |
2 |
p. 85-88 4 p. |
artikel |