| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A linear expected-time algorithm for computing planar relative neighbourhood graphs
|
Katajainen, Jyrki
|
|
1987
|
25 |
2 |
p. 77-86
10 p.
|
artikel
|
| 2 |
An observation concerning constraint-based compaction
|
Maley, F.Miller
|
|
1987
|
25 |
2 |
p. 119-122
4 p.
|
artikel
|
| 3 |
A time-optimal message-efficient distributed algorithm for depth-first-search
|
Lakshmanan, K.B.
|
|
1987
|
25 |
2 |
p. 103-109
7 p.
|
artikel
|
| 4 |
Corrigendum
|
|
|
1987
|
25 |
2 |
p. 139-
1 p.
|
artikel
|
| 5 |
Does co-NP have short interactive proofs?
|
Boppana, Ravi B.
|
|
1987
|
25 |
2 |
p. 127-132
6 p.
|
artikel
|
| 6 |
Efficient algorithms for common transversals
|
Atallah, Mikhail
|
|
1987
|
25 |
2 |
p. 87-91
5 p.
|
artikel
|
| 7 |
Parallel algorithms for finding Hamilton cycles in random graphs
|
Frieze, A.M.
|
|
1987
|
25 |
2 |
p. 111-117
7 p.
|
artikel
|
| 8 |
Predicative specifications for functional programs describing communicating networks
|
Broy, Manfred
|
|
1987
|
25 |
2 |
p. 93-101
9 p.
|
artikel
|
| 9 |
Prespecification in data refinement
|
Hoare, C.A.R.
|
|
1987
|
25 |
2 |
p. 71-76
6 p.
|
artikel
|
| 10 |
Quantification in algol-like languages
|
Tennent, R.D.
|
|
1987
|
25 |
2 |
p. 133-137
5 p.
|
artikel
|
| 11 |
The complexity of preemptive scheduling given interprocessor communication delays
|
Rayward-Smith, V.J.
|
|
1987
|
25 |
2 |
p. 123-125
3 p.
|
artikel
|
Tijdschrift beschrijving