| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An agent calculus with simple actions where the enabling and disabling are derived operators
|
Massart, T.
|
|
1991
|
40 |
4 |
p. 213-218
6 p.
|
artikel
|
| 2 |
τ-Bisimulations and full abstraction for refinement of actions
|
Cherief, F.
|
|
1991
|
40 |
4 |
p. 219-222
4 p.
|
artikel
|
| 3 |
Covering a set of points in multidimensional space
|
Gonzalez, Teofilo F.
|
|
1991
|
40 |
4 |
p. 181-188
8 p.
|
artikel
|
| 4 |
DFS-traversing graphs in a paging environment, LRU or MRU?
|
Jiang, Bin
|
|
1991
|
40 |
4 |
p. 193-196
4 p.
|
artikel
|
| 5 |
Fast algorithms for lowest common ancestors on a processor array with reconfigurable buses
|
Lin, Rong
|
|
1991
|
40 |
4 |
p. 223-230
8 p.
|
artikel
|
| 6 |
On disjoint concave chains in arrangements of (pseudo) lines
|
Halperin, Dan
|
|
1991
|
40 |
4 |
p. 189-192
4 p.
|
artikel
|
| 7 |
On the logarithmic evaluation of recurrence relations
|
Rönn, Stefan
|
|
1991
|
40 |
4 |
p. 197-199
3 p.
|
artikel
|
| 8 |
Satisfying general proximity / similarity queries with metric trees
|
Uhlmann, Jeffrey K.
|
|
1991
|
40 |
4 |
p. 175-179
5 p.
|
artikel
|
| 9 |
Yet another efficient backward execution algorithm in the AND/OR process model
|
Kim, Do-Hyung
|
|
1991
|
40 |
4 |
p. 201-211
11 p.
|
artikel
|
Tijdschrift beschrijving