Journal of the ACM Bibliography

Additional Key Words and Phrases: algorithmic efficiency, programming efficiency, optimization of algorithms, measures of algorithms, efficiency, measurement, space-time, optimization, complexity, Turing machines, computer programs, programs, algorithms, recursive functions

Selected papers that cite this one

• David Pager. Further results on the problem of finding minimal length programs for decision tables. Journal of the ACM, 21(2):207-212, April 1974.

Selected references

• Manuel Blum. A machine-independent theory of the complexity of recursive functions. Journal of the ACM, 14(2):322-336, April 1967.

• David Pager. On the problem of finding minimal programs for tables. Information and Control, 14(6):550-554, June 1969.

• Michael O. Rabin and Hao Wang. Words in the history of a Turing machine with a fixed input. Journal of the ACM, 10(4):526-527, October 1963.

• J. C. Shepherdson and H. E. Sturgis. Computability of recursive functions. Journal of the ACM, 10(2):217-255, April 1963.

• R. E. Stearns, J. Hartmanis, and P. M. Lewis II. Hierarchies of memory limited computations. In Proceedings of the Sixth Annual Symposium on Switching Circuit Theory and Logical Design, pages 179-190. IEEE, 1965.

Shortcuts: