Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines
Journal of the ACM (JACM)
Relations Between Time and Tape Complexities
Journal of the ACM (JACM)
Some Results on Tape-Bounded Turing Machines
Journal of the ACM (JACM)
Multi-tape and infinite-state automata—a survey
Communications of the ACM
On effective procedures for speeding up algorithms
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Deterministic simulation of non-deterministic turing machines (Detailed Abstract)
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
Classes of computable functions defined by bounds on computation
Classes of computable functions defined by bounds on computation
Hard-core theorems for complexity classes
Journal of the ACM (JACM)
Subrecursive Programming Languages, Part I: efficiency and program structure
Journal of the ACM (JACM)
Ordinal Hierarchies and Naming Complexity Classes
Journal of the ACM (JACM)
On the Decidability of Grammar Problems
Journal of the ACM (JACM)
Relations between diagonalization, proof systems, and complexity gaps
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
On the complexity of grammar and related problems
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
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
Computer Science And Recursion Theory
ACM '78 Proceedings of the 1978 annual conference
Complexity of formal translations and speed-up results
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A complexity theory of grammar problems
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Algorithmic complexity of recursive and inductive algorithms
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Andrzej Grzegorczyk's Contribution to Computer Science
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Theory of computing in computer science education
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Complexity metatheorems for context-free grammar problems
Journal of Computer and System Sciences
Polynomial and abstract subrecursive classes
Journal of Computer and System Sciences
Complexity-class-encoding sets
Journal of Computer and System Sciences
Degrees of computational complexity
Journal of Computer and System Sciences
Nonexistence of program optimizers in several abstract settings
Journal of Computer and System Sciences
Andrzej Grzegorczyk's Contribution to Computer Science
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
| Hi-index | 0.01 |