nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A better lower bound on the competitive ratio of the randomized 2-server problem
|
Chrobak, Marek |
|
1997 |
63 |
2 |
p. 79-83 5 p. |
artikel |
2 |
A fast algorithm for stereo matching
|
Chung, Kuo-Liang |
|
1997 |
63 |
2 |
p. 57-61 5 p. |
artikel |
3 |
An approximation algorithm for maximum packing of 3-edge paths
|
Hassin, Refael |
|
1997 |
63 |
2 |
p. 63-67 5 p. |
artikel |
4 |
Bounded fan-out m-center problem
|
Jan-Ming, Ho |
|
1997 |
63 |
2 |
p. 103-108 6 p. |
artikel |
5 |
3D straight-line grid drawing of 4-colorable graphs
|
Calamoneri, Tiziana |
|
1997 |
63 |
2 |
p. 97-102 6 p. |
artikel |
6 |
Dynamic maintenance of majority information in constant time per update
|
Frandsen, Gudmund S. |
|
1997 |
63 |
2 |
p. 75-78 4 p. |
artikel |
7 |
Impossibility results for weak threshold networks
|
Busch, Costas |
|
1997 |
63 |
2 |
p. 85-90 6 p. |
artikel |
8 |
Partitions with minimum entropy of regions in R 2
|
Gaines, J.G. |
|
1997 |
63 |
2 |
p. 69-73 5 p. |
artikel |
9 |
Performance bounds for modeling NUMA architectures
|
Geist, Robert |
|
1997 |
63 |
2 |
p. 113-117 5 p. |
artikel |
10 |
Recognizing Hamming graphs in linear time and space
|
Imrich, Wilfried |
|
1997 |
63 |
2 |
p. 91-95 5 p. |
artikel |
11 |
The bit complexity of the predecessor problem
|
Afek, Y. |
|
1997 |
63 |
2 |
p. 109-112 4 p. |
artikel |