nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Construction of a tree from its traversals in optimal time and space
|
Andersson, Arne |
|
1990 |
34 |
1 |
p. 21-25 5 p. |
artikel |
2 |
Cooperating proofs for distributed programs with multiparty interactions
|
Francez, Nissim |
|
1990 |
34 |
1 |
p. 57- 1 p. |
artikel |
3 |
Cyclic reference counting with local mark-scan
|
MartÃnez, Alejandro D. |
|
1990 |
34 |
1 |
p. 31-35 5 p. |
artikel |
4 |
Editorial Board
|
|
|
1990 |
34 |
1 |
p. ii- 1 p. |
artikel |
5 |
Finding nearest neighbors with Voronoi tessellations
|
Murphy, O.J. |
|
1990 |
34 |
1 |
p. 37-41 5 p. |
artikel |
6 |
Flush primitives for asynchronous distributed systems
|
Ahuja, Mohan |
|
1990 |
34 |
1 |
p. 5-12 8 p. |
artikel |
7 |
Modular term rewriting systems and the termination
|
Kurihara, Masahito |
|
1990 |
34 |
1 |
p. 1-4 4 p. |
artikel |
8 |
On the classification of binding mechanisms
|
Morrison, R. |
|
1990 |
34 |
1 |
p. 51-55 5 p. |
artikel |
9 |
Preemptive scheduling to minimize mean weighted flow time
|
Leung, Joseph Y-T. |
|
1990 |
34 |
1 |
p. 47-50 4 p. |
artikel |
10 |
Routing with critical paths
|
Simonson, Shai |
|
1990 |
34 |
1 |
p. 13-19 7 p. |
artikel |
11 |
Separability and the detection of hidden channels
|
Jacob, Jeremy |
|
1990 |
34 |
1 |
p. 27-29 3 p. |
artikel |
12 |
The area-time complexity of the greatest common divisor problem: a lower bound
|
Purdy, Carla Neaderhouser |
|
1990 |
34 |
1 |
p. 43-46 4 p. |
artikel |