nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A clarification of the comparison between some measures of software science
|
Van Der Knijff, D. |
|
1979 |
8 |
5 |
p. 241-243 3 p. |
artikel |
2 |
A fast equivalence-checking algorithm for circular lists
|
Shiloach, Yossi |
|
1979 |
8 |
5 |
p. 236-238 3 p. |
artikel |
3 |
A note on paths embedded in trees
|
Rosenberg, Arnold L. |
|
1979 |
8 |
5 |
p. 272-273 2 p. |
artikel |
4 |
A note on the representation of finite tree automata
|
Reisig, Wolfgang |
|
1979 |
8 |
5 |
p. 239-240 2 p. |
artikel |
5 |
Author index
|
|
|
1979 |
8 |
5 |
p. 280-282 3 p. |
artikel |
6 |
Average case analysis of region search in balanced k-d trees
|
Silva-Filho, Y.V. |
|
1979 |
8 |
5 |
p. 219-223 5 p. |
artikel |
7 |
Axiomatic proofs of total correctness of programs
|
Soundararajan, N. |
|
1979 |
8 |
5 |
p. 274-277 4 p. |
artikel |
8 |
Corrigendum
|
|
|
1979 |
8 |
5 |
p. 278- 1 p. |
artikel |
9 |
Decomposable searching problems
|
Bentley, Jon Louis |
|
1979 |
8 |
5 |
p. 244-251 8 p. |
artikel |
10 |
Immediate error detection in strong LL(1) parsers
|
Fischer, C.N. |
|
1979 |
8 |
5 |
p. 261-266 6 p. |
artikel |
11 |
Mathematical solution for a data processing system
|
Loizou, Georghios |
|
1979 |
8 |
5 |
p. 252-256 5 p. |
artikel |
12 |
Methodical solution of the problem of ascending subsequences of maximum length within a given sequence
|
Broy, M. |
|
1979 |
8 |
5 |
p. 224-229 6 p. |
artikel |
13 |
On a generalization of binary search
|
Leipälä, Timo |
|
1979 |
8 |
5 |
p. 230-233 4 p. |
artikel |
14 |
O(n 2.7799) complexity for n × n approximate matrix multiplication
|
Bini, Dario |
|
1979 |
8 |
5 |
p. 234-235 2 p. |
artikel |
15 |
On the space complexity of recursive algorithms
|
Gurari, Eitan M. |
|
1979 |
8 |
5 |
p. 267-271 5 p. |
artikel |
16 |
The decidability of the FOL-DOL equivalence problem
|
Ruohonen, Keijo |
|
1979 |
8 |
5 |
p. 257-260 4 p. |
artikel |
17 |
7th international colloquium on automata, languages and programming
|
|
|
1979 |
8 |
5 |
p. 279- 1 p. |
artikel |