nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A subquadratic algorithm for constructing approximately optimal binary search trees
|
Larmore, Lawrence L |
|
1987 |
8 |
4 |
p. 579-591 13 p. |
artikel |
2 |
Author index for volume 8
|
|
|
1987 |
8 |
4 |
p. 600-601 2 p. |
artikel |
3 |
Coloring planar graphs in parallel
|
Boyar, Joan F |
|
1987 |
8 |
4 |
p. 470-479 10 p. |
artikel |
4 |
Generating the maximum spanning trees of a weighted graph
|
Gavril, Fǎnicǎ |
|
1987 |
8 |
4 |
p. 592-597 6 p. |
artikel |
5 |
How much is that DAWG in the window? a moving window algorithm for the directed acyclic word graph
|
Blumer, Janet A |
|
1987 |
8 |
4 |
p. 451-469 19 p. |
artikel |
6 |
Improved constants for some separator theorems
|
Venkatesan, Shankar M |
|
1987 |
8 |
4 |
p. 572-578 7 p. |
artikel |
7 |
On bipartite matchings of minimum density
|
Atallah, Mikhail J |
|
1987 |
8 |
4 |
p. 480-502 23 p. |
artikel |
8 |
Papers to appear in forthcoming issues
|
|
|
1987 |
8 |
4 |
p. 598-599 2 p. |
artikel |
9 |
Simplified stable merging tasks
|
Salowe, Jeffrey |
|
1987 |
8 |
4 |
p. 557-571 15 p. |
artikel |
10 |
The rotation graph of binary trees is Hamiltonian
|
Lucas, Joan M |
|
1987 |
8 |
4 |
p. 503-535 33 p. |
artikel |
11 |
The virtues of locking by symbolic names
|
Wolfson, Ouri |
|
1987 |
8 |
4 |
p. 536-556 21 p. |
artikel |