Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Computability of Recursive Functions
Journal of the ACM (JACM)
Random-Access Stored-Program Machines, an Approach to Programming Languages
Journal of the ACM (JACM)
A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
An Overview of the Theory of Computational Complexity
Journal of the ACM (JACM)
On the size of programs in subrecursive formalisms
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
On effective procedures for speeding up algorithms
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Classes of computable functions defined by bounds on computation: Preliminary Report
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
The complexity of loop programs
ACM '67 Proceedings of the 1967 22nd national conference
Upward and Downward Diagonalization over Axiomatic Complexity Classes
Upward and Downward Diagonalization over Axiomatic Complexity Classes
Computation: finite and infinite machines
Computation: finite and infinite machines
Programming Languages, Information Structures, and Machine Organization.
Programming Languages, Information Structures, and Machine Organization.
A Complete and Consistent Hoare Axiomatics for a Simple Programming Language
Journal of the ACM (JACM)
The Complexity of the Equivalence Problem for Simple Programs
Journal of the ACM (JACM)
A complete and consistent hoare axiomatics for a simple programming language
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Analysis of simple programs over different sets of primitives
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Polynomial and abstract subrecursive classes
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Type two computational complexity
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Indexing of subrecursive classes
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of the equivalence problem for counter machines, semilinear sets, and simple programs
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Towards a canonical form for computer programs
ACM '75 Proceedings of the 1975 annual conference
On the teaching of disciplined programming
ACM SIGPLAN Notices
Journal of Computer and System Sciences
Polynomial and abstract subrecursive classes
Journal of Computer and System Sciences
Survey: A survey of state vectors
Computer Science Review
| Hi-index | 0.00 |