Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Logic at Botik'89 Symposium on logical foundations of computer science
Experiments with implementations of two theoretical constructions
Logic at Botik'89 Symposium on logical foundations of computer science
Partial evaluation and automatic program generation
Partial evaluation and automatic program generation
A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Proceedings of the Parallel Architectures and Languages Europe, Volume I
Machine models and linear time complexity
ACM SIGACT News
ACM SIGACT News
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Parallelism in sequential functional languages
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Linear-Time Self-Interpretation of the Pure Lambda Calculus
Higher-Order and Symbolic Computation
Linear Time Self-Interpretation of the Pure Lambda Calculus
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Tighter constant-factor time hierarchies
Information Processing Letters
Lambda calculi and linear speedups
The essence of computation
The intensional content of Rice's theorem
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Precise Version of a Time Hierarchy Theorem
Fundamenta Informaticae
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Hi-index | 0.00 |