nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A cryptosystem for multiple communication
|
Luccio, F. |
|
1980 |
10 |
4-5 |
p. 180-183 4 p. |
artikel |
2 |
A new permutation algorithm for bubble memories
|
Chung, K.M. |
|
1980 |
10 |
4-5 |
p. 226-230 5 p. |
artikel |
3 |
A note on decision problems for three-way two-dimensional finite automata
|
Inoue, Katsushi |
|
1980 |
10 |
4-5 |
p. 245-248 4 p. |
artikel |
4 |
A remark on two-dimensional finite automata
|
Nakamura, Akira |
|
1980 |
10 |
4-5 |
p. 219-222 4 p. |
artikel |
5 |
A robust variation of interpolation search
|
Burton, F.Warren |
|
1980 |
10 |
4-5 |
p. 198-201 4 p. |
artikel |
6 |
A tribute to referees
|
|
|
1980 |
10 |
4-5 |
p. 268-269 2 p. |
artikel |
7 |
Author index
|
|
|
1980 |
10 |
4-5 |
p. 251-253 3 p. |
artikel |
8 |
Complexity bounds for equivalence and isomorphism of latin squares
|
Böhm, Corrado |
|
1980 |
10 |
4-5 |
p. 231-233 3 p. |
artikel |
9 |
Complexity of solving algebraic equations
|
Fraenkel, Aviezri S. |
|
1980 |
10 |
4-5 |
p. 178-179 2 p. |
artikel |
10 |
Controlled density sorting
|
Melville, Robert |
|
1980 |
10 |
4-5 |
p. 169-172 4 p. |
artikel |
11 |
Deadlock and fairness in parallel schemas: A set-theoretic characterization and decision problems
|
Czaja, Ludwik |
|
1980 |
10 |
4-5 |
p. 234-239 6 p. |
artikel |
12 |
Further comments on Bykat's convex hull algorithm
|
Overmars, Mark H. |
|
1980 |
10 |
4-5 |
p. 209-212 4 p. |
artikel |
13 |
International computer symposium 1980 on software development: Methodology and management
|
|
|
1980 |
10 |
4-5 |
p. 249-250 2 p. |
artikel |
14 |
Levelling terrain trees: A transshipment problem
|
Farley, Arthur M. |
|
1980 |
10 |
4-5 |
p. 189-192 4 p. |
artikel |
15 |
Lexicographically least circular substrings
|
Booth, Kellogg S. |
|
1980 |
10 |
4-5 |
p. 240-242 3 p. |
artikel |
16 |
Master index of volume 1–10
|
|
|
1980 |
10 |
4-5 |
p. 254-267 14 p. |
artikel |
17 |
Maximum matchings and trees
|
Savage, Carla |
|
1980 |
10 |
4-5 |
p. 202-205 4 p. |
artikel |
18 |
On the complexity of scheduling jobs on dedicated resources to minimize set-up costs
|
Bertossi, Alan A. |
|
1980 |
10 |
4-5 |
p. 173-177 5 p. |
artikel |
19 |
On the emptiness of the intersection of two DOS languages problem
|
Ehrenfeucht, A. |
|
1980 |
10 |
4-5 |
p. 223-225 3 p. |
artikel |
20 |
Program development: From enumeration to backtracking
|
Broy, M. |
|
1980 |
10 |
4-5 |
p. 193-197 5 p. |
artikel |
21 |
The design and analysis of a new hybrid sorting algorithm
|
Meijer, Henk |
|
1980 |
10 |
4-5 |
p. 213-218 6 p. |
artikel |
22 |
The space complexity of pebble games on trees
|
Lengauer, Thomas |
|
1980 |
10 |
4-5 |
p. 184-188 5 p. |
artikel |
23 |
The towers of Hanoi problem
|
Buneman, Peter |
|
1980 |
10 |
4-5 |
p. 243-244 2 p. |
artikel |
24 |
Variants of the software solution to mutual exclusion
|
Doran, R.W. |
|
1980 |
10 |
4-5 |
p. 206-208 3 p. |
artikel |