nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A note on bounded-reversal multipushdown machines
|
Chrobak, Marek |
|
1984 |
19 |
4 |
p. 179-180 2 p. |
artikel |
2 |
Approximate storage utilisation of B-trees: A simple derivation and generalisations
|
Leung, Clement H.C. |
|
1984 |
19 |
4 |
p. 199-201 3 p. |
artikel |
3 |
How evenly should one divide to conquer quickly?
|
Walsh, T.R. |
|
1984 |
19 |
4 |
p. 203-208 6 p. |
artikel |
4 |
How to produce all sentences from a two-level grammar
|
Grune, Dick |
|
1984 |
19 |
4 |
p. 181-185 5 p. |
artikel |
5 |
On linear context-free languages and one-way multihead automata
|
Rytter, Wojciech |
|
1984 |
19 |
4 |
p. 163-166 4 p. |
artikel |
6 |
On software equations
|
Král, J. |
|
1984 |
19 |
4 |
p. 191-196 6 p. |
artikel |
7 |
On the centers of the set of weakly square-free words on a two letter alphabet
|
Carpi, Arturo |
|
1984 |
19 |
4 |
p. 187-190 4 p. |
artikel |
8 |
Probabilistics Turing machines and recursively enumerable Dedekind cuts
|
Chrobak, M. |
|
1984 |
19 |
4 |
p. 167-171 5 p. |
artikel |
9 |
The complexity of incremental convex hull algorithms in Rd
|
Kallay, Michael |
|
1984 |
19 |
4 |
p. 197- 1 p. |
artikel |
10 |
Throughput concavity and response time convexity
|
Dowdy, Lawrence W. |
|
1984 |
19 |
4 |
p. 209-212 4 p. |
artikel |
11 |
Towards a formal proof system for ω-rational expressions
|
Darondeau, Ph. |
|
1984 |
19 |
4 |
p. 173-177 5 p. |
artikel |