Even Simple Programs Are Hard To Analyze
Journal of the ACM (JACM)
Theory of Program Structures: Schemes, Semantics, Verification
Theory of Program Structures: Schemes, Semantics, Verification
Introduction to Mathematical Theory of Computation
Introduction to Mathematical Theory of Computation
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The complexity of loop programs
ACM '67 Proceedings of the 1967 22nd national conference
Formal languages and their relation to automata
Formal languages and their relation to automata
Algebraic Structures with Hard Equivalence and Minimization Problems
Journal of the ACM (JACM)
Lower bounds and the hardness of counting properties
Theoretical Computer Science
Hi-index | 0.01 |