nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A hierarchical clustering algorithm using strong components
|
Tarjan, R. Endre |
|
1982 |
14 |
1 |
p. 26-29 4 p. |
artikel |
2 |
A note on ‘master keys for group sharing’
|
Brouwer, Andries E. |
|
1982 |
14 |
1 |
p. 12-14 3 p. |
artikel |
3 |
Arithmetic of finite fields
|
Chor, Ben-Zion |
|
1982 |
14 |
1 |
p. 4-6 3 p. |
artikel |
4 |
Compile time type checking of structure field accessing
|
Gunn, Hamish I.E. |
|
1982 |
14 |
1 |
p. 22-25 4 p. |
artikel |
5 |
Editorial Board
|
|
|
1982 |
14 |
1 |
p. ii- 1 p. |
artikel |
6 |
Efficient recognition of rational relations
|
van Leeuwen, Jan |
|
1982 |
14 |
1 |
p. 34-38 5 p. |
artikel |
7 |
Generation and ranking of K-ary trees
|
Zaks, Shmuel |
|
1982 |
14 |
1 |
p. 44-48 5 p. |
artikel |
8 |
On the computational power of the floor function
|
Schmitt, Alfred |
|
1982 |
14 |
1 |
p. 1-3 3 p. |
artikel |
9 |
On the size of projections: I
|
Gelenbe, Erol |
|
1982 |
14 |
1 |
p. 18-21 4 p. |
artikel |
10 |
Parallel algorithms for the connected components and minimal spanning tree problems
|
Nath, Dhruva |
|
1982 |
14 |
1 |
p. 7-11 5 p. |
artikel |
11 |
Sensitivity analysis of minimum spanning trees and shortest path trees
|
Tarjan, Robert Endre |
|
1982 |
14 |
1 |
p. 30-33 4 p. |
artikel |
12 |
Some observations on the probabilistic algorithms and NP-hard problems
|
Ko, Ker-I |
|
1982 |
14 |
1 |
p. 39-43 5 p. |
artikel |
13 |
Writing a number as the sum of two squares: A new solution
|
Backhouse, Ronald |
|
1982 |
14 |
1 |
p. 15-17 3 p. |
artikel |