| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A calculus of durations
|
Chaochen, Zhou
|
|
1991
|
40 |
5 |
p. 269-276
8 p.
|
artikel
|
| 2 |
A randomized NC algorithm for the maximal tree cover problem
|
Chen, Zhi-Zhong
|
|
1991
|
40 |
5 |
p. 241-246
6 p.
|
artikel
|
| 3 |
A special case of the n-vertex traveling-salesman problem that can be solved in O(n) time
|
Park, James K.
|
|
1991
|
40 |
5 |
p. 247-254
8 p.
|
artikel
|
| 4 |
Comments on “Always-true is not invariant”: assertional reasoning about invariance
|
Pettersson, Jimmi S.
|
|
1991
|
40 |
5 |
p. 231-233
3 p.
|
artikel
|
| 5 |
Complete problems for symmetric logspace involving free groups
|
Stewart, Iain A.
|
|
1991
|
40 |
5 |
p. 263-267
5 p.
|
artikel
|
| 6 |
Distributed user identification by zero-knowledge access rights proving
|
Domingo-Ferrer, Josep
|
|
1991
|
40 |
5 |
p. 235-239
5 p.
|
artikel
|
| 7 |
Expected time analysis of interpolation merge — a simple new merging algorithm
|
Guha, Sumanta
|
|
1991
|
40 |
5 |
p. 277-281
5 p.
|
artikel
|
| 8 |
Further comments on the subtree isomorphism for ordered trees
|
Grossi, Roberto
|
|
1991
|
40 |
5 |
p. 255-256
2 p.
|
artikel
|
| 9 |
Modelling a fast parallel thinning algorithm for shared memory SIMD computers
|
Mahapatra, Rabi N.
|
|
1991
|
40 |
5 |
p. 257-261
5 p.
|
artikel
|
| 10 |
Solving the single step graph searching problem by solving the maximum two-independent set problem
|
Hsiao, Ju Yuan
|
|
1991
|
40 |
5 |
p. 283-287
5 p.
|
artikel
|
Tijdschrift beschrijving