nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An 0(|E|loglog|V|) algorithm for finding minimum spanning trees
|
Yao, Andrew Chi-chih |
|
1975 |
4 |
1 |
p. 21-23 3 p. |
artikel |
2 |
Editorial Board
|
|
|
1975 |
4 |
1 |
p. ii- 1 p. |
artikel |
3 |
Etol-grammars and N-grammars
|
Penttonen, Martti |
|
1975 |
4 |
1 |
p. 11-13 3 p. |
artikel |
4 |
On homomorphic images of transition graphs
|
Nieminen, Juhani |
|
1975 |
4 |
1 |
p. 14-15 2 p. |
artikel |
5 |
Optimal chain partitions of trees
|
Misra, Jayadev |
|
1975 |
4 |
1 |
p. 24-26 3 p. |
artikel |
6 |
Sequence-to-sequence recursiveness
|
Germano, G. |
|
1975 |
4 |
1 |
p. 1-6 6 p. |
artikel |
7 |
Some observations on the determination of an upper bound for the clique number of a graph
|
Nieminen, Juhani |
|
1975 |
4 |
1 |
p. 16-17 2 p. |
artikel |
8 |
Some properties of a centroid of a free tree
|
Kang, Andy N.C. |
|
1975 |
4 |
1 |
p. 18-20 3 p. |
artikel |
9 |
Three results of comparison between L languages with and without interaction
|
Ruohonen, Keijo |
|
1975 |
4 |
1 |
p. 7-10 4 p. |
artikel |