 | 1985 |
|---|
| 6 |       | D. T. Goodwin:
Further Study of a Stack-Length Model.
Comput. J. 28(1): 9-16 (1985) |
| 5 | | D. T. Goodwin:
The Computability of Stack Non-Underflow.
Comput. J. 28(3): 257-263 (1985) |
| 1980 |
|---|
| 4 | | D. T. Goodwin:
Partial Non-Underflow and Non-Overflow of an Arithmetic Stack.
Comput. J. 23(2): 153-160 (1980) |
| 1977 |
|---|
| 3 | | D. T. Goodwin:
Conditions for Underflow and Overflow of an Arithmetic Stack.
Comput. J. 20(1): 56-62 (1977) |
| 1975 |
|---|
| 2 | | D. T. Goodwin:
An Algorithm for Inverting Certain Translators of Context-Free Languages.
Comput. J. 18(4): 349-354 (1975) |
| 1964 |
|---|
| 1 | | D. T. Goodwin,
J. L. Venn:
On polyphase sort.
Commun. ACM 7(5): 315 (1964) |
Data released under the ODC-BY 1.0 license — See also our legal information page