| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A fully distributed (minimal) spanning tree algorithm
|
Lavallee, Ivan
|
|
1986
|
23 |
2 |
p. 55-62
8 p.
|
artikel
|
| 2 |
An algorithm for the derivation of codefinitions in computer programs
|
Laski, Janusz
|
|
1986
|
23 |
2 |
p. 85-90
6 p.
|
artikel
|
| 3 |
An application of Mehlhorn's algorithm for bracket languages to log(n) space recognition of input-driven languages
|
Rytter, Wojciech
|
|
1986
|
23 |
2 |
p. 81-84
4 p.
|
artikel
|
| 4 |
An implementation of mutual inclusion
|
Hoogerwoord, Rob R.
|
|
1986
|
23 |
2 |
p. 77-80
4 p.
|
artikel
|
| 5 |
Area-time tradeoffs for bilinear forms computations in VLSI
|
Codenotti, Bruno
|
|
1986
|
23 |
2 |
p. 107-109
3 p.
|
artikel
|
| 6 |
Comments on Morris's starvation-free solution to the mutual exclusion problem
|
Annot, J.K.
|
|
1986
|
23 |
2 |
p. 91-97
7 p.
|
artikel
|
| 7 |
Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings
|
Apostolico, Alberto
|
|
1986
|
23 |
2 |
p. 63-69
7 p.
|
artikel
|
| 8 |
On Gallery Watchmen in grids
|
Ntafos, Simeon
|
|
1986
|
23 |
2 |
p. 99-102
4 p.
|
artikel
|
| 9 |
On the probabilistic performance of algorithms for the satisfiability problem
|
Franco, John
|
|
1986
|
23 |
2 |
p. 103-106
4 p.
|
artikel
|
| 10 |
Shortest paths in the plane with convex polygonal obstacles
|
Rohnert, Hans
|
|
1986
|
23 |
2 |
p. 71-76
6 p.
|
artikel
|
Tijdschrift beschrijving