A new recursion-theoretic characterization of the polytime functions (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Stratified functional programs and computational complexity
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The strength of non-size increasing computation
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A syntactical analysis of non-size-increasing polynomial time computation
ACM Transactions on Computational Logic (TOCL)
The Functions Provable by First Order Abstraction
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
The Strength of Non-size-increasing Computation (Introduction and Summary)
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Termination Proofs and Complexity Certification
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
On Lexicographic Termination Ordering with Space Bound Certifications
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
General Recursion on Second Order Term Algebras
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Linear Ramified Higher Type Recursion and Parallel Complexity
PTCS '01 Proceedings of the International Seminar on Proof Theory in Computer Science
Implicit Characterizations of Pspace
PTCS '01 Proceedings of the International Seminar on Proof Theory in Computer Science
Applicative Control and Computational Complexity
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Actual Arithmetic and Feasibility
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Analysing the implicit complexity of programs
Information and Computation - Special issue: ICC '99
Linear types and non-size-increasing polynomial time computation
Information and Computation - Special issue: ICC '99
Theories with self-application and computational complexity
Information and Computation
Complexity classes and fragments of C
Information Processing Letters
Algorithms with polynomial interpretation termination proof
Journal of Functional Programming
The expressive power of higher-order types or, life without CONS
Journal of Functional Programming
A predicative approach to the classification problem
Journal of Functional Programming
On characterizations of the basic feasible functionals, Part I
Journal of Functional Programming
Semantics of linear/modal lambda calculus
Journal of Functional Programming
Representing reductions of NP-complete problems in logical frameworks: a case study
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Continuous-time computation with restricted integration capabilities
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Separating NC along the δ axis
Theoretical Computer Science - Implicit computational complexity
DeQuant: a flexible multiresolution restoration framework
Signal Processing
On the computational complexity of imperative programming languages
Theoretical Computer Science - Implicit computational complexity
On an interpretation of safe recursion in light affine logic
Theoretical Computer Science - Implicit computational complexity
Recursion schemata for slowly growing depth circuit classes
Computational Complexity
A proof-theoretic characterization of the basic feasible functionals
Theoretical Computer Science
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Programming languages capturing complexity classes
Nordic Journal of Computing
A decidable characterization of the classes between lintime and exptime
Information Processing Letters
Implicit complexity over an arbitrary structure: quantifier alternations
Information and Computation
Simulation of simultaneous safe recursion over an arbitrary structure
Information Processing Letters
An arithmetic for polynomial-time computation
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Resource control for synchronous cooperative threads
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Linear logic and polynomial time
Mathematical Structures in Computer Science
Synthesis of max-plus quasi-interpretations
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Feasible reactivity in a synchronous Π-calculus
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Time-Complexity Semantics for Feasible Affine Recursions
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
The geometry of linear higher-order recursion
ACM Transactions on Computational Logic (TOCL)
Light types for polynomial time computation in lambda calculus
Information and Computation
Recursion Theoretic Operators for Function Complexity Classes
IEICE - Transactions on Information and Systems
A new function algebra of EXPTIME functions by safe nested recursion
ACM Transactions on Computational Logic (TOCL)
A flow calculus of mwp-bounds for complexity analysis
ACM Transactions on Computational Logic (TOCL)
ACM Transactions on Computational Logic (TOCL)
Dependency Pairs and Polynomial Path Orders
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Bounded Linear Logic, Revisited
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
The Computational SLR: A Logic for Reasoning about Computational Indistinguishability
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
On Constructor Rewrite Systems and the Lambda-Calculus
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Quantum implicit computational complexity
Theoretical Computer Science
Linear logic by levels and bounded time complexity
Theoretical Computer Science
Implicit complexity over an arbitrary structure: Quantifier alternations
Information and Computation
A decidable characterization of the classes between lintime and exptime
Information Processing Letters
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Ramified recurrence with dependent types
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Computability over an arbitrary structure: sequential and parallel polynomial time
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Max-plus quasi-interpretations
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Nondeterministic light logics and NP-time
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Efficient first order functional program interpreter with time bound certifications
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
From proof-nets to linear logic type systems for polynomial time computing
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Predicative analysis of feasibility and diagonalization
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Complexity analysis by rewriting
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
A characterization of NCk by first order functional programs
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
A Categorical Setting for Lower Complexity
Electronic Notes in Theoretical Computer Science (ENTCS)
A local criterion for polynomial-time stratified computations
FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
Polynomial time computation in the context of recursive analysis
FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
POP and semantic labeling using SAT
ESSLLI'08/09 Proceedings of the 2008 international conference on Interfaces: explorations in logic, language and computation
The computational slr: A logic for reasoning about computational indistinguishability
Mathematical Structures in Computer Science
A calculus for game-based security proofs
ProvSec'10 Proceedings of the 4th international conference on Provable security
Quasi-interpretations a way to control resources
Theoretical Computer Science
A formalization of polytime functions
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Ramified Corecurrence and Logspace
Electronic Notes in Theoretical Computer Science (ENTCS)
A characterization of alternating log time by first order functional programs
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Resource bound certification for a tail-recursive virtual machine
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Verification of ptime reducibility for system f terms via dual light affine logic
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Towards an implicit characterization of NCk
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Recursion theoretic operators for function complexity classes
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Proofs of termination of rewrite systems for polytime functions
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Quasi-interpretations and small space bounds
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
A survey of recursive analysis and Moore's notion of real computation
Natural Computing: an international journal
Some programming languages for LOGSPACE and PTIME
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
A polytime functional language from light linear logic
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
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
Complexity in predicative arithmetic
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Elementary linear logic revisited for polynomial time and an exponential time hierarchy
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
A short introduction to implicit computational complexity
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
A higher-order characterization of probabilistic polynomial time
FOPARA'11 Proceedings of the Second international conference on Foundational and Practical Aspects of Resource Analysis
Synthesis of max-plus quasi-interpretations
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Evolving graph-structures and their implicit computational complexity
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Safe recursion revisited I: Categorical semantics for lower complexity
Theoretical Computer Science
| Hi-index | 0.01 |