| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An O(log n) algorithm for parallel update of minimum spanning trees
|
Pawagi, Shaunak
|
|
1986
|
22 |
5 |
p. 223-229
7 p.
|
artikel
|
| 2 |
Approximate storage utilization of B-trees
|
Gupta, G.K.
|
|
1986
|
22 |
5 |
p. 243-246
4 p.
|
artikel
|
| 3 |
Batched search of index sequential files
|
Manolopoulos, Yannis
|
|
1986
|
22 |
5 |
p. 267-272
6 p.
|
artikel
|
| 4 |
Determining the shape of a convex n-sided polygon by using 2n + k tactile probes
|
Bernstein, Herbert J.
|
|
1986
|
22 |
5 |
p. 255-260
6 p.
|
artikel
|
| 5 |
Experiments with trees for the storage and retrieval of future events
|
Evans, John B.
|
|
1986
|
22 |
5 |
p. 237-242
6 p.
|
artikel
|
| 6 |
Lower and upper bounds of the sizes of domains: Estimates and experiments
|
Bourret, Paul
|
|
1986
|
22 |
5 |
p. 247-253
7 p.
|
artikel
|
| 7 |
On the calculation of control transition probabilities in a program
|
Alanko, Timo O.
|
|
1986
|
22 |
5 |
p. 273-276
4 p.
|
artikel
|
| 8 |
Optimal algorithms for finding the symmetries of a planar point set
|
Highnam, P.T.
|
|
1986
|
22 |
5 |
p. 219-222
4 p.
|
artikel
|
| 9 |
Set-theoretic problems of null completion in relational databases
|
Keller, Arthur M.
|
|
1986
|
22 |
5 |
p. 261-265
5 p.
|
artikel
|
| 10 |
String-matching cannot be done by a two-head one-way deterministic finite automaton
|
Li, Ming
|
|
1986
|
22 |
5 |
p. 231-235
5 p.
|
artikel
|
Tijdschrift beschrijving