| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Acceptors for isometric parallel context-free array languages
|
Nakamura, Akira
|
|
1981
|
13 |
4-5 |
p. 182-186
5 p.
|
artikel
|
| 2 |
A hardest language recognized by two-way nondeterministic pushdown automata
|
Rytter, Wojciech
|
|
1981
|
13 |
4-5 |
p. 145-146
2 p.
|
artikel
|
| 3 |
An alternative for the implementation of the Knuth-Morris-Pratt algorithm
|
Barth, Gerhard
|
|
1981
|
13 |
4-5 |
p. 134-137
4 p.
|
artikel
|
| 4 |
An approximation algorithm for reducing expected head movement in linear storage devices
|
Troya, J.M.
|
|
1981
|
13 |
4-5 |
p. 218-220
3 p.
|
artikel
|
| 5 |
A new method for implementing LR(k) tables
|
Ancona, M.
|
|
1981
|
13 |
4-5 |
p. 171-176
6 p.
|
artikel
|
| 6 |
A systematic test for extended operator precedence
|
Williams, M.H.
|
|
1981
|
13 |
4-5 |
p. 187-190
4 p.
|
artikel
|
| 7 |
Author index to volume 13
|
|
|
1981
|
13 |
4-5 |
p. 221-223
3 p.
|
artikel
|
| 8 |
Data compression in limited capacity microcomputer systems
|
Davis, R.H.
|
|
1981
|
13 |
4-5 |
p. 138-141
4 p.
|
artikel
|
| 9 |
Efficient query evaluation in relational data bases with missing values
|
Siklóssy, L.
|
|
1981
|
13 |
4-5 |
p. 160-163
4 p.
|
artikel
|
| 10 |
Finding the minimum distance between two convex polygons
|
Schwartz, Jacob T.
|
|
1981
|
13 |
4-5 |
p. 168-170
3 p.
|
artikel
|
| 11 |
Guarded procedure: a distributed programming concept
|
Arora, R.K.
|
|
1981
|
13 |
4-5 |
p. 199-203
5 p.
|
artikel
|
| 12 |
Limitations of the chase
|
Goodman, Nathan
|
|
1981
|
13 |
4-5 |
p. 154-156
3 p.
|
artikel
|
| 13 |
Modulus division on a two's complement machine
|
Warren Jr., Henry S.
|
|
1981
|
13 |
4-5 |
p. 215-217
3 p.
|
artikel
|
| 14 |
Multi-problem-solving: knowledge representation and system architecture
|
Guida, Giovanni
|
|
1981
|
13 |
4-5 |
p. 204-214
11 p.
|
artikel
|
| 15 |
On the intersection of Orthogonal objects
|
Edelsbrunner, H.
|
|
1981
|
13 |
4-5 |
p. 177-181
5 p.
|
artikel
|
| 16 |
Projections of languages recognizable by probabilistic and alternating finite multitape automata
|
Freivalds, Rūsinś
|
|
1981
|
13 |
4-5 |
p. 195-198
4 p.
|
artikel
|
| 17 |
The clique problem for planar graphs
|
Papadimitriou, Christos H.
|
|
1981
|
13 |
4-5 |
p. 131-133
3 p.
|
artikel
|
| 18 |
The complexity of testing whether a graph is a superconcentrator
|
Blum, M.
|
|
1981
|
13 |
4-5 |
p. 164-167
4 p.
|
artikel
|
| 19 |
The edge Hamiltonian path problem is NP-complete
|
Bertossi, Alan A.
|
|
1981
|
13 |
4-5 |
p. 157-159
3 p.
|
artikel
|
| 20 |
Time complexity of languages recognized by one-way multihead pushdown automata
|
Rytter, Wojciech
|
|
1981
|
13 |
4-5 |
p. 142-144
3 p.
|
artikel
|
| 21 |
Tree equivalence of linear recursive schemata is polynomial-time decidable
|
Sabelfeld, V.K.
|
|
1981
|
13 |
4-5 |
p. 147-153
7 p.
|
artikel
|
| 22 |
Width and depth of combinational logic circuits
|
Yasuura, Hiroto
|
|
1981
|
13 |
4-5 |
p. 191-194
4 p.
|
artikel
|
Tijdschrift beschrijving