nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Analysis of the space of search trees under the random insertion algorithm
|
Mahmoud, Hosam M |
|
1989 |
10 |
1 |
p. 52-75 24 p. |
artikel |
2 |
Approximation algorithms for scheduling arithmetic expressions on pipelined machines
|
Bernstein, David |
|
1989 |
10 |
1 |
p. 120-139 20 p. |
artikel |
3 |
Editorial Board
|
|
|
1989 |
10 |
1 |
p. i- 1 p. |
artikel |
4 |
Fast algorithms for edge-coloring planar graphs
|
Chrobak, Marek |
|
1989 |
10 |
1 |
p. 35-51 17 p. |
artikel |
5 |
Finding feasible paths for a two-point body
|
Feinberg, Ellen B |
|
1989 |
10 |
1 |
p. 109-119 11 p. |
artikel |
6 |
Finding the edge connectivity of directed graphs
|
Mansour, Yishay |
|
1989 |
10 |
1 |
p. 76-85 10 p. |
artikel |
7 |
Hash table collision resolution with direct chaining
|
Knott, Gary D |
|
1989 |
10 |
1 |
p. 20-34 15 p. |
artikel |
8 |
Hypercube and shuffle-exchange algorithms for image component labeling
|
Cypher, R |
|
1989 |
10 |
1 |
p. 140-150 11 p. |
artikel |
9 |
On the computational complexity of continuous routing
|
Chang, Yukon |
|
1989 |
10 |
1 |
p. 86-108 23 p. |
artikel |
10 |
Papers to appear in forthcoming issues
|
|
|
1989 |
10 |
1 |
p. 155-156 2 p. |
artikel |
11 |
The probability of splitters in a list
|
Hamidoune, Yahya Ould |
|
1989 |
10 |
1 |
p. 151-154 4 p. |
artikel |
12 |
The Towers of Hanoi rainbow problem: Coloring the rings
|
Minsker, Steven |
|
1989 |
10 |
1 |
p. 1-19 19 p. |
artikel |