nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Algorithms for updating minimal spanning trees
|
Chin, Francis |
|
1978 |
16 |
3 |
p. 333-344 12 p. |
artikel |
2 |
A lower bound of 1 2n2 on linear search programs for the Knapsack problem
|
Dobkin, David |
|
1978 |
16 |
3 |
p. 413-417 5 p. |
artikel |
3 |
A note on pattern reproduction in tessellation structures
|
Barto, Andrew G. |
|
1978 |
16 |
3 |
p. 445-455 11 p. |
artikel |
4 |
A 222 pn upper bound on the complexity of Presburger Arithmetic
|
Oppen, Derek C. |
|
1978 |
16 |
3 |
p. 323-332 10 p. |
artikel |
5 |
A trivial algorithm whose analysis isn't
|
Jonassen, Arne T. |
|
1978 |
16 |
3 |
p. 301-322 22 p. |
artikel |
6 |
Author index for volume 16
|
|
|
1978 |
16 |
3 |
p. 462- 1 p. |
artikel |
7 |
ω-Computations on deterministic pushdown machines
|
Cohen, Rina S. |
|
1978 |
16 |
3 |
p. 275-300 26 p. |
artikel |
8 |
ET0L forms
|
Maurer, H.A. |
|
1978 |
16 |
3 |
p. 345-361 17 p. |
artikel |
9 |
Inductive definability in formal language theory
|
Schuler, P.F. |
|
1978 |
16 |
3 |
p. 400-412 13 p. |
artikel |
10 |
Nondeterminism and boolean operations in pda's
|
Wotschke, Detlef |
|
1978 |
16 |
3 |
p. 456-461 6 p. |
artikel |
11 |
On inverse deterministic pushdown transductions
|
Vitányi, Paul M.B. |
|
1978 |
16 |
3 |
p. 423-444 22 p. |
artikel |
12 |
On polynomial time isomorphisms of some new complete sets
|
Hartmanis, J. |
|
1978 |
16 |
3 |
p. 418-422 5 p. |
artikel |
13 |
On the algebraic structure of rooted trees
|
Elgot, Calvin C. |
|
1978 |
16 |
3 |
p. 362-399 38 p. |
artikel |