nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A generalized deadlock predicate
|
O'Hallaron, David R. |
|
1986 |
23 |
4 |
p. 181-188 8 p. |
artikel |
2 |
Eliminating the flag in threaded binary search trees
|
Gordon, Dan |
|
1986 |
23 |
4 |
p. 209-214 6 p. |
artikel |
3 |
Finitely generated ω-languages
|
Latteux, M. |
|
1986 |
23 |
4 |
p. 171-175 5 p. |
artikel |
4 |
Hamiltonian circuits in interval graph generalizations
|
Bertossi, Alan A. |
|
1986 |
23 |
4 |
p. 195-200 6 p. |
artikel |
5 |
Resolution deduction to detect satisfiability for another class including non-horn sentences in propositional logic
|
Yamasaki, Susumu |
|
1986 |
23 |
4 |
p. 201-207 7 p. |
artikel |
6 |
Safety without stuttering
|
Alpern, Bowen |
|
1986 |
23 |
4 |
p. 177-180 4 p. |
artikel |
7 |
Sensitivity analysis of minimum spanning trees and shortest path trees
|
Tarjan, Robert Endre |
|
1986 |
23 |
4 |
p. 219- 1 p. |
artikel |
8 |
The efficiency of using k-d trees for finding nearest neighbors in discrete space
|
Murphy, O.J. |
|
1986 |
23 |
4 |
p. 215-218 4 p. |
artikel |
9 |
Towards an asymptotic analysis of Karmarkar's algorithm
|
Blum, Lenore |
|
1986 |
23 |
4 |
p. 189-194 6 p. |
artikel |
10 |
Turing complexity of the ordinals
|
Dehornoy, Patrick |
|
1986 |
23 |
4 |
p. 167-170 4 p. |
artikel |