nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An O ̃ (n 3 14 )-coloring algorithm for 3-colorable graphs
|
Blum, Avrim |
|
1997 |
61 |
1 |
p. 49-53 5 p. |
artikel |
2 |
Communication algorithms in k-ary n-cube interconnection networks
|
Ashir, Yaagoub |
|
1997 |
61 |
1 |
p. 43-48 6 p. |
artikel |
3 |
Containment of butterflies in networks constructed by the line digraph operation
|
Hasunuma, Toru |
|
1997 |
61 |
1 |
p. 25-30 6 p. |
artikel |
4 |
Editorial Board
|
|
|
1997 |
61 |
1 |
p. ii- 1 p. |
artikel |
5 |
Improvements on the accelerated integer GCD algorithm
|
Sedjelmaci, Mohamed S. |
|
1997 |
61 |
1 |
p. 31-36 6 p. |
artikel |
6 |
NP-hard sets are superterse unless NP is small
|
Wang, Yongge |
|
1997 |
61 |
1 |
p. 1-6 6 p. |
artikel |
7 |
Odd-even sort in powerlists
|
Kornerup, Jacob |
|
1997 |
61 |
1 |
p. 15-24 10 p. |
artikel |
8 |
On-line algorithms for the dominating set problem
|
King, Gow-Hsing |
|
1997 |
61 |
1 |
p. 11-14 4 p. |
artikel |
9 |
Optimal parallel randomized renaming
|
Farach, Martin |
|
1997 |
61 |
1 |
p. 7-10 4 p. |
artikel |
10 |
The average height of a node in the BANG abstract directory tree
|
Taylor, Stephen |
|
1997 |
61 |
1 |
p. 55-61 7 p. |
artikel |
11 |
The space-optimal version of a known rectangle enclosure reporting algorithm
|
Bozanis, Panayiotis |
|
1997 |
61 |
1 |
p. 37-41 5 p. |
artikel |