nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A note on a construction of Margulis
|
Angluin, Dana |
|
1979 |
8 |
1 |
p. 17-19 3 p. |
artikel |
2 |
A note on bottom-up pyramid acceptors
|
Inoue, Katsushi |
|
1979 |
8 |
1 |
p. 34-37 4 p. |
artikel |
3 |
A note on cyclic closure operations
|
Inoue, Katsushi |
|
1979 |
8 |
1 |
p. 15-16 2 p. |
artikel |
4 |
A note on Rabin's nearest-neighbor algorithm
|
Fortune, Steve |
|
1979 |
8 |
1 |
p. 20-23 4 p. |
artikel |
5 |
A note on vector grammars
|
Jantzen, M. |
|
1979 |
8 |
1 |
p. 32-33 2 p. |
artikel |
6 |
Edge-disjoint branching in directed multigraphs
|
Shiloach, Yossi |
|
1979 |
8 |
1 |
p. 24-27 4 p. |
artikel |
7 |
Editorial Board
|
|
|
1979 |
8 |
1 |
p. ii- 1 p. |
artikel |
8 |
Efficient search for rationals
|
Papadimitriou, Christos H. |
|
1979 |
8 |
1 |
p. 1-4 4 p. |
artikel |
9 |
Erratum
|
|
|
1979 |
8 |
1 |
p. 54- 1 p. |
artikel |
10 |
Factoring numbers in O(logn) arithmetic steps
|
Shamir, Adi |
|
1979 |
8 |
1 |
p. 28-31 4 p. |
artikel |
11 |
Generalized1.5 sequential machine maps
|
Buda, A. |
|
1979 |
8 |
1 |
p. 38-40 3 p. |
artikel |
12 |
Paired sequential lists in a memory interval
|
Fraenkel, Aviezri S. |
|
1979 |
8 |
1 |
p. 9-10 2 p. |
artikel |
13 |
Reference counting can manage the circular invironments of mutual recursion
|
Friedman, Daniel P. |
|
1979 |
8 |
1 |
p. 41-45 5 p. |
artikel |
14 |
Some decidability results about regular and pushdown translations
|
Culik II, K. |
|
1979 |
8 |
1 |
p. 5-8 4 p. |
artikel |
15 |
Summer 1979 computer science spectacular
|
|
|
1979 |
8 |
1 |
p. 55- 1 p. |
artikel |
16 |
Testing for existence of a covering Boyce-Codd normal form
|
Osborn, Sylvia L. |
|
1979 |
8 |
1 |
p. 11-14 4 p. |
artikel |
17 |
Three efficient algorithms for counting problems
|
Bertoni, Alberto |
|
1979 |
8 |
1 |
p. 50-53 4 p. |
artikel |
18 |
Using duality to compute the pair of matrix products QY and Y T Q over a commutative ring
|
Makarov, O.M. |
|
1979 |
8 |
1 |
p. 46-49 4 p. |
artikel |