A new recursion-theoretic characterization of the polytime functions
Computational Complexity
Computability and complexity: from a programming perspective
Computability and complexity: from a programming perspective
LOGSPACE and PTIME characterized by programming languages
Theoretical Computer Science - Special issue on mathematical foundations of programming semantics
Elements of the Theory of Computation
Elements of the Theory of Computation
The expressive power of higher-order types or, life without CONS
Journal of Functional Programming
Programming languages capturing complexity classes
Nordic Journal of Computing
Pure Iteration and Periodicity
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Recursion in Higher Types and Resource Bounded Turing Machines
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
A flow calculus of mwp-bounds for complexity analysis
ACM Transactions on Computational Logic (TOCL)
A characterisation of the relations definable in Presburger arithmetic
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Bounded minimalisation and bounded counting in argument-bounded idc's
Mathematical Structures in Computer Science
Complexity-Theoretic hierarchies
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
The small grzegorczyk classes and the typed λ-calculus
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
The flow of data and the complexity of algorithms
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Hi-index | 0.89 |