On the public citation graph
A new recursion-theoretic characterization of the polytime functions
0 signed · 373 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-16486-3_94openalex-snapshot
Exponential time and bounded arithmetic
inferredcites →https://doi.org/10.1007/3-540-55602-8_162openalex-snapshot
Uniform traversal combinators: Definition, use and properties
inferredcites →https://doi.org/10.1007/978-1-4612-2822-6_3openalex-snapshot
Computability and Complexity of Higher Type Functions
inferredcites →https://doi.org/10.1007/978-1-4612-3466-1_16openalex-snapshot
Subrecursion and lambda representation over free algebras
inferredcites →https://doi.org/10.1007/978-1-4612-3466-1_4openalex-snapshot
Sequential, machine-independent characterizations of the parallel complexity classes AlogTIME, AC k , NC k and NC
inferredcites →https://doi.org/10.1007/978-1-4612-3466-1_5openalex-snapshot
Characterizations of the Basic Feasible Functionals of Finite Type
inferredcites →https://doi.org/10.1016/0168-0072(91)90057-sopenalex-snapshot
Arithmetizing Uniform NC
inferredcites →https://doi.org/10.1016/0168-0072(93)90044-eopenalex-snapshot
Functional interpretations of feasibly constructive arithmetic
inferredcites →https://doi.org/10.1090/s0002-9947-1963-0158822-2openalex-snapshot
Classes of predictably computable functions
inferredcites →https://doi.org/10.1109/lics.1991.151625openalex-snapshot
A foundational delineation of computational feasibility
inferredcites →https://doi.org/10.1109/lics.1992.185541openalex-snapshot
There is no recursive axiomatization for feasible functionals of type 2
inferredcites →https://doi.org/10.1109/sct.1992.215394openalex-snapshot
Functional characterizations of uniform log-depth and polylog-depth circuit families
inferredcites →https://doi.org/10.1109/sfcs.1989.63471openalex-snapshot
Characterizations of the basic feasible functionals of finite type
inferredcites →https://doi.org/10.1137/0216051openalex-snapshot
Languages that Capture Complexity Classes
inferredcites →https://doi.org/10.1145/129712.129740openalex-snapshot
A new recursion-theoretic characterization of the polytime functions (extended abstract)
inferredcites →https://doi.org/10.1145/73007.73017openalex-snapshot
Functional interpretations of feasibly constructive arithmetic
inferredcites →https://doi.org/10.1145/800116.803756openalex-snapshot
Feasibly constructive proofs and the propositional calculus (Preliminary Version)
inferredcites →https://doi.org/10.1515/9781400858927openalex-snapshot
Predicative Arithmetic. (MN-32)
inferredcites →https://doi.org/10.2307/2270886openalex-snapshot
Alan Cobham. The intrinsic computational difficulty of functions. Logic, methodology and philosophy of science, Proceedings of the 1964 International Congress, edited by Yehoshua Bar-Hillel, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam 1965, pp.…
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.200310070openalex-snapshot
CharacterizingNCwith tier 0 pointers
inferred← citeshttps://doi.org/10.1002/malq.200610003openalex-snapshot
There is no safe pairing function over an arbitrary structure
inferred← citeshttps://doi.org/10.1002/malq.200610056openalex-snapshot
Characterizing PSPACE with pointers
inferred← citeshttps://doi.org/10.1002/malq.200710090openalex-snapshot
A lexicographic path order with slow growing derivation bounds
inferred← citeshttps://doi.org/10.1006/inco.1994.1038openalex-snapshot
A Foundational Delineation of Poly-time
inferred← citeshttps://doi.org/10.1006/inco.1996.0055openalex-snapshot
Database Query Languages Embedded in the Typed Lambda Calculus
inferred← citeshttps://doi.org/10.1006/inco.1998.9999openalex-snapshot
A Note on Complexity Measures for Inductive Classes in Constructive Type Theory
inferred← citeshttps://doi.org/10.1007/1-4020-8141-3_32openalex-snapshot
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures
inferred← citeshttps://doi.org/10.1007/10703163_25openalex-snapshot
Complexity Classes and Rewrite Systems with Polynomial Interpretation
inferred← citeshttps://doi.org/10.1007/11494645_32openalex-snapshot
The Small Grzegorczyk Classes and the Typed λ-Calculus
inferred← citeshttps://doi.org/10.1007/11494645_33openalex-snapshot
The Flow of Data and the Complexity of Algorithms
inferred← citeshttps://doi.org/10.1007/11494645_47openalex-snapshot
Complexity in Predicative Arithmetic
inferred← citeshttps://doi.org/10.1007/11538363_36openalex-snapshot
Identifying Polynomial-Time Recursive Functions
inferred← citeshttps://doi.org/10.1007/11575467_17openalex-snapshot
Resource Bound Certification for a Tail-Recursive Virtual Machine
inferred← citeshttps://doi.org/10.1007/11590156_43openalex-snapshot
Proofs of Termination of Rewrite Systems for Polytime Functions
inferred← citeshttps://doi.org/10.1007/11602613_75openalex-snapshot
Recursion Theoretic Operators for Function Complexity Classes
inferred← citeshttps://doi.org/10.1007/11784180_8openalex-snapshot
Some Programming Languages for Logspace and Ptime
inferred← citeshttps://doi.org/10.1007/11874683_10openalex-snapshot
Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic
inferred← citeshttps://doi.org/10.1007/11874683_14openalex-snapshot
Towards an Implicit Characterization of NC k
inferred← citeshttps://doi.org/10.1007/11916277_7openalex-snapshot
A Characterization of Alternating Log Time by First Order Functional Programs
inferred← citeshttps://doi.org/10.1007/3-540-36576-1_12openalex-snapshot
Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time
inferred← citeshttps://doi.org/10.1007/3-540-44404-1_3openalex-snapshot
Efficient First Order Functional Program Interpreter with Time Bound Certifications
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_6openalex-snapshot
The Strength of Non-size-increasing Computation (Introduction and Summary)
inferred← citeshttps://doi.org/10.1007/3-540-44802-0_9openalex-snapshot
Actual Arithmetic and Feasibility
inferred← citeshttps://doi.org/10.1007/3-540-44904-3_17openalex-snapshot
Nondeterministic Light Logics and NP-Time
inferred← citeshttps://doi.org/10.1007/3-540-44904-3_3openalex-snapshot
Max-Plus Quasi-interpretations
inferred← citeshttps://doi.org/10.1007/3-540-45127-7_4openalex-snapshot
General Recursion on Second Order Term Algebras
inferred← citeshttps://doi.org/10.1007/3-540-45413-6_11openalex-snapshot
Ramied Recurrence with Dependent Types
inferred← citeshttps://doi.org/10.1007/3-540-45413-6_2openalex-snapshot
From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour
inferred← citeshttps://doi.org/10.1007/3-540-45500-0_9openalex-snapshot
Termination Proofs and Complexity Certification
inferred← citeshttps://doi.org/10.1007/3-540-45504-3_1openalex-snapshot
Linear Ramified Higher Type Recursion and Parallel Complexity
inferred← citeshttps://doi.org/10.1007/3-540-45504-3_11openalex-snapshot
Implicit Characterizations of Pspace
inferred← citeshttps://doi.org/10.1007/3-540-45575-2_46openalex-snapshot
On Lexicographic Termination Ordering with Space Bound Certifications
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_23openalex-snapshot
The Functions Provable by First Order Abstraction
inferred← citeshttps://doi.org/10.1007/3-540-46521-9_20openalex-snapshot
Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_7openalex-snapshot
Applicative Control and Computational Complexity
inferred← citeshttps://doi.org/10.1007/3-540-58140-5_23openalex-snapshot
Predicative recurrence in finite types
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_60openalex-snapshot
An analysis of the Core-ML language: Expressive power and type reconstruction
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_62openalex-snapshot
Tailoring recursion for complexity
inferred← citeshttps://doi.org/10.1007/3-540-60164-3_29openalex-snapshot
V-comprehensions and P space
inferred← citeshttps://doi.org/10.1007/3-540-60178-3_76openalex-snapshot
Strict finitism and feasibility
inferred← citeshttps://doi.org/10.1007/3-540-60178-3_79openalex-snapshot
On parallel hierarchies and R ki
inferred← citeshttps://doi.org/10.1007/3-540-60178-3_81openalex-snapshot
Computation models and function algebras
inferred← citeshttps://doi.org/10.1007/3-540-60178-3_82openalex-snapshot
Expressing computational complexity in constructive type theory
inferred← citeshttps://doi.org/10.1007/3-540-60178-3_84openalex-snapshot
Intrinsic theories and computational complexity
inferred← citeshttps://doi.org/10.1007/3-540-60178-3_88openalex-snapshot
Characterizing parallel time by type 2 recursions with polynomial output length
inferred← citeshttps://doi.org/10.1007/3-540-63045-7_5openalex-snapshot
A safe recursion scheme for exponential time
inferred← citeshttps://doi.org/10.1007/978-1-4612-2566-9_11openalex-snapshot
Ramified Recurrence and Computational Complexity I: Word Recurrence and Poly-time
inferred← citeshttps://doi.org/10.1007/978-1-4612-2566-9_2openalex-snapshot
Predicative Recursion and The Polytime Hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-030-00111-7_32openalex-snapshot
Bounded-Memory Stream Processing
inferred← citeshttps://doi.org/10.1007/978-3-030-06170-8_2openalex-snapshot
Theoretical Computer Science: Computational Complexity
inferred← citeshttps://doi.org/10.1007/978-3-030-22996-2_19openalex-snapshot
More Intensional Versions of Rice’s Theorem
inferred← citeshttps://doi.org/10.1007/978-3-030-52482-1_6openalex-snapshot
Reversible Programming Languages Capturing Complexity Classes
inferred← citeshttps://doi.org/10.1007/978-3-030-85315-0_20openalex-snapshot
ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-88853-4_23openalex-snapshot
Algorithmically Broad Languages for Polynomial Time and Space
inferred← citeshttps://doi.org/10.1007/978-3-030-99253-8_19openalex-snapshot
Complete and tractable machine-independent characterizations of second-order polytime
inferred← citeshttps://doi.org/10.1007/978-3-031-13257-5_3openalex-snapshot
On the Power of Recursive Word-Functions Without Concatenation
inferred← citeshttps://doi.org/10.1007/978-3-031-13502-6_4openalex-snapshot
A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations
inferred← citeshttps://doi.org/10.1007/978-3-031-30829-1_8openalex-snapshot
A Programming Language Characterizing Quantum Polynomial Time
inferred← citeshttps://doi.org/10.1007/978-3-031-57231-9openalex-snapshot
Foundations of Software Science and Computation Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-57231-9_4openalex-snapshot
On Basic Feasible Functionals and the Interpretation Method
inferred← citeshttps://doi.org/10.1007/978-3-032-04167-8_13openalex-snapshot
Data-Driven Runtime Complexity Analysis
inferred← citeshttps://doi.org/10.1007/978-3-032-31348-5_1openalex-snapshot
Ordinary Differential Equations as a Universal Language for Computability and Complexity: From Polynomial Time to the Hyperarithmetical Hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-032-31348-5_6openalex-snapshot
Mathematical Informatics: Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-06089-7_9openalex-snapshot
Complexity Information Flow in a Multi-threaded Imperative Language
inferred← citeshttps://doi.org/10.1007/978-3-319-08918-8_13openalex-snapshot
An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-319-10882-7_7openalex-snapshot
Probabilistic Recursion Theory and Implicit Computational Complexity
inferred← citeshttps://doi.org/10.1007/978-3-319-12466-7_5openalex-snapshot
Predicative Lexicographic Path Orders
inferred← citeshttps://doi.org/10.1007/978-3-319-12466-7_8openalex-snapshot
On Paths-Based Criteria for Polynomial Time Complexity in Proof-Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-16715-2_13openalex-snapshot
Finding Shortest Lattice Vectors in the Presence of Gaps
inferred← citeshttps://doi.org/10.1007/978-3-319-22156-4_6openalex-snapshot
Discrete Transfinite Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-26529-2_21openalex-snapshot
Objects in Polynomial Time
inferred← citeshttps://doi.org/10.1007/978-3-319-29198-7_13openalex-snapshot
Pointwise Transfinite Induction and a Miniaturized Predicativity
inferred← citeshttps://doi.org/10.1007/978-3-319-68167-2_7openalex-snapshot
Loop Quasi-Invariant Chunk Detection
inferred← citeshttps://doi.org/10.1007/978-3-540-24727-2_4openalex-snapshot
Soft lambda-Calculus: A Language for Polynomial Time Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-24849-1_12openalex-snapshot
Higher-Order Linear Ramified Recurrence
inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_5openalex-snapshot
Resource Control for Synchronous Cooperative Threads
inferred← citeshttps://doi.org/10.1007/978-3-540-30124-0_22openalex-snapshot
A Functional Scenario for Bytecode Verification of Resource Bounds
inferred← citeshttps://doi.org/10.1007/978-3-540-30477-7_21openalex-snapshot
A Functional Language for Logarithmic Space
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_12openalex-snapshot
Quasi-interpretations and Small Space Bounds
inferred← citeshttps://doi.org/10.1007/978-3-540-70529-1_201openalex-snapshot
Logical Characterizations of Complexity Classes
inferred← citeshttps://doi.org/10.1007/978-3-540-70529-1_279openalex-snapshot
Large-Scale Computing for Molecular Dynamics Simulation
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_22openalex-snapshot
Time-Complexity Semantics for Feasible Affine Recursions
inferred← citeshttps://doi.org/10.1007/978-3-540-73228-0_2openalex-snapshot
From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing
inferred← citeshttps://doi.org/10.1007/978-3-540-73228-0_21openalex-snapshot
Predicative Analysis of Feasibility and Diagonalization
inferred← citeshttps://doi.org/10.1007/978-3-540-78969-7_11openalex-snapshot
Complexity Analysis by Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4openalex-snapshot
Theory and Applications of Models of Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_12openalex-snapshot
A Characterization of NC k by First Order Functional Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_6openalex-snapshot
Recursion Schemata for NC k
inferred← citeshttps://doi.org/10.1007/978-3-642-02273-9_29openalex-snapshot
The Computational SLR: A Logic for Reasoning about Computational Indistinguishability
inferred← citeshttps://doi.org/10.1007/978-3-642-02273-9_8openalex-snapshot
Bounded Linear Logic, Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-02348-4_4openalex-snapshot
Dependency Pairs and Polynomial Path Orders
inferred← citeshttps://doi.org/10.1007/978-3-642-02930-1_14openalex-snapshot
On Constructor Rewrite Systems and the Lambda-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-11957-6openalex-snapshot
Programming languages and systems : 19th European Symposium on Programming, ESOP 2010, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010 : proceedings
inferred← citeshttps://doi.org/10.1007/978-3-642-11957-6_7openalex-snapshot
A PolyTime Functional Language from Light Linear Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-14729-6_12openalex-snapshot
POP* and Semantic Labeling Using SAT
inferred← citeshttps://doi.org/10.1007/978-3-642-15331-0_10openalex-snapshot
Polynomial Time Computation in the Context of Recursive Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-15331-0_8openalex-snapshot
A Local Criterion for Polynomial-Time Stratified Computations
inferred← citeshttps://doi.org/10.1007/978-3-642-16280-0_3openalex-snapshot
A Calculus for Game-Based Security Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_27openalex-snapshot
Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-22863-6_11openalex-snapshot
A Formalization of Polytime Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-25318-8_25openalex-snapshot
Elementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-642-31485-8_3openalex-snapshot
A Short Introduction to Implicit Computational Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-32495-6_1openalex-snapshot
A Higher-Order Characterization of Probabilistic Polynomial Time
inferred← citeshttps://doi.org/10.1007/978-3-642-35182-2_20openalex-snapshot
A New Order-Theoretic Characterisation of the Polytime Computable Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_32openalex-snapshot
Evolving Graph-Structures and Their Implicit Computational Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-58622-4_8openalex-snapshot
Complexity of Primitive Recursion
inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_26openalex-snapshot
Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-662-44602-7_13openalex-snapshot
Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-662-46078-8_50openalex-snapshot
Java Loops Are Mainly Polynomial
inferred← citeshttps://doi.org/10.1007/978-3-662-46678-0_27openalex-snapshot
The Computational Contents of Ramified Corecurrence
inferred← citeshttps://doi.org/10.1007/978-3-662-47666-6_28openalex-snapshot
Parsimonious Types and Non-uniform Computation
inferred← citeshttps://doi.org/10.1007/978-3-662-49630-5_22openalex-snapshot
Unary Resolution: Characterizing Ptime
inferred← citeshttps://doi.org/10.1007/978-3-662-54434-1_25openalex-snapshot
The Power of Non-determinism in Higher-Order Implicit Complexity
inferred← citeshttps://doi.org/10.1007/978-94-010-0413-8_12openalex-snapshot
Proof Theoretic Complexity
inferred← citeshttps://doi.org/10.1007/978-94-010-0413-8_13openalex-snapshot
Feasible Computation with Higher Types
inferred← citeshttps://doi.org/10.1007/978-94-010-0413-8_7openalex-snapshot
Naïve Computational Type Theory
inferred← citeshttps://doi.org/10.1007/978-94-015-9620-6_8openalex-snapshot
Imposing Polynomial Time Complexity in Functional Programming
inferred← citeshttps://doi.org/10.1007/978-94-017-9217-2_5openalex-snapshot
Proof-Theoretic Semantics and Feasibility
inferred← citeshttps://doi.org/10.1007/bf01202288openalex-snapshot
Function-algebraic characterizations of log and polylog parallel time
inferred← citeshttps://doi.org/10.1007/bf01581144openalex-snapshot
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
inferred← citeshttps://doi.org/10.1007/bfb0022277openalex-snapshot
Ramified recurrence and computational complexity II: Substitution and poly-space
inferred← citeshttps://doi.org/10.1007/bfb0023481openalex-snapshot
Algebraic and logical characterizations of deterministic linear time classes
inferred← citeshttps://doi.org/10.1007/bfb0028020openalex-snapshot
A mixed modal/linear lambda calculus with applications to bellantoni-cook safe recursion
inferred← citeshttps://doi.org/10.1007/bfb0030611openalex-snapshot
Predicative functional recurrence and poly-space
inferred← citeshttps://doi.org/10.1007/bfb0037112openalex-snapshot
Lambda calculus characterizations of poly-time
inferred← citeshttps://doi.org/10.1007/s00037-004-0184-4openalex-snapshot
Recursion Schemata for Slowly Growing Depth Circuit Classes
inferred← citeshttps://doi.org/10.1007/s00037-023-00240-1openalex-snapshot
A Characterization of Functions over the Integers Computable in Polynomial Time Using Discrete Ordinary Differential Equations
inferred← citeshttps://doi.org/10.1007/s000370050004openalex-snapshot
Function algebraic characterizations of the polytime functions
inferred← citeshttps://doi.org/10.1007/s00153-007-0042-6openalex-snapshot
Light affine lambda calculus and polynomial time strong normalization
inferred← citeshttps://doi.org/10.1007/s00153-015-0422-2openalex-snapshot
Predicatively computable functions on sets
inferred← citeshttps://doi.org/10.1007/s00153-022-00828-4openalex-snapshot
Implicit recursion-theoretic characterizations of counting classes
inferred← citeshttps://doi.org/10.1007/s001530050054openalex-snapshot
A term rewriting characterization of the polytime functions and related complexity classes
inferred← citeshttps://doi.org/10.1007/s001530050160openalex-snapshot
Characterizing the elementary recursive functions by a fragment of Gödel's T
inferred← citeshttps://doi.org/10.1007/s001530050163openalex-snapshot
The $\mu$ -measure as a tool for classifying computational complexity
inferred← citeshttps://doi.org/10.1007/s00224-009-9181-yopenalex-snapshot
Two Algorithms in Search of a Type-System
inferred← citeshttps://doi.org/10.1007/s002240000085openalex-snapshot
Sharply Bounded Alternation and Quasilinear Time
inferred← citeshttps://doi.org/10.1007/s11047-011-9278-5openalex-snapshot
A survey of recursive analysis and Moore’s notion of real computation
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90092-8openalex-snapshot
Functions over free algebras definable in the simply typed lambda calculus
inferred← citeshttps://doi.org/10.1016/j.apal.2004.10.011openalex-snapshot
Control structures in programs and computational complexity
inferred← citeshttps://doi.org/10.1016/j.apal.2005.05.011openalex-snapshot
Inductive definitions over a predicative arithmetic
inferred← citeshttps://doi.org/10.1016/j.apal.2011.01.010openalex-snapshot
A recursion-theoretic approach to NP
inferred← citeshttps://doi.org/10.1016/j.apal.2012.05.006openalex-snapshot
Applicative theories for the polynomial hierarchy of time and its levels
inferred← citeshttps://doi.org/10.1016/j.apal.2015.12.005openalex-snapshot
Cobham recursive set functions
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.08.017openalex-snapshot
A Categorical Setting for Lower Complexity
inferred← citeshttps://doi.org/10.1016/j.entcs.2011.09.025openalex-snapshot
Ramified Corecurrence and Logspace
inferred← citeshttps://doi.org/10.1016/j.ic.2005.07.005openalex-snapshot
Implicit complexity over an arbitrary structure: Quantifier alternations
inferred← citeshttps://doi.org/10.1016/j.ic.2008.08.005openalex-snapshot
Light types for polynomial time computation in lambda calculus
inferred← citeshttps://doi.org/10.1016/j.ic.2014.10.005openalex-snapshot
On the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy
inferred← citeshttps://doi.org/10.1016/j.ic.2014.10.006openalex-snapshot
An abstract approach to stratification in linear logic
inferred← citeshttps://doi.org/10.1016/j.ic.2014.10.008openalex-snapshot
Formal security proofs with minimal fuss: Implicit computational complexity at work
inferred← citeshttps://doi.org/10.1016/j.ic.2014.10.009openalex-snapshot
A higher-order characterization of probabilistic polynomial time
inferred← citeshttps://doi.org/10.1016/j.ic.2015.12.007openalex-snapshot
A combination framework for complexity
inferred← citeshttps://doi.org/10.1016/j.ic.2015.12.008openalex-snapshot
Higher-order interpretations and program complexity
inferred← citeshttps://doi.org/10.1016/j.ic.2015.12.009openalex-snapshot
Two function algebras defining functions in NCk boolean circuits
inferred← citeshttps://doi.org/10.1016/j.ic.2015.12.013openalex-snapshot
Bounded Combinatory Logic and lower complexity
inferred← citeshttps://doi.org/10.1016/j.ic.2018.05.003openalex-snapshot
On sharing, memoization, and polynomial time
inferred← citeshttps://doi.org/10.1016/j.ic.2018.05.006openalex-snapshot
A type-based complexity analysis of Object Oriented programs
inferred← citeshttps://doi.org/10.1016/j.ipl.2003.08.010openalex-snapshot
Complexity classes and fragments of C
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.09.005openalex-snapshot
A decidable characterization of the classes between lintime and exptime
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.03.003openalex-snapshot
Simulation of simultaneous safe recursion over an arbitrary structure
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.10.004openalex-snapshot
A note on BDD problems with λ2 -gap
inferred← citeshttps://doi.org/10.1016/j.jlap.2009.02.005openalex-snapshot
Implicit characterizations of FPTIME and NC revisited
inferred← citeshttps://doi.org/10.1016/j.scico.2021.102723openalex-snapshot
Reversible computing and implicit computational complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.10.016openalex-snapshot
On the computational complexity of imperative programming languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.10.017openalex-snapshot
On an interpretation of safe recursion in light affine logic
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.10.020openalex-snapshot
Minimization and NP multifunctions
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.10.021openalex-snapshot
Separating NC along the δ axis
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.12.009openalex-snapshot
Continuous-time computation with restricted integration capabilities
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.08.009openalex-snapshot
A proof-theoretic characterization of the basic feasible functionals
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.01.017openalex-snapshot
Resource control for synchronous cooperative threads
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.03.019openalex-snapshot
An arithmetic for polynomial-time computation
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.045openalex-snapshot
Quantum implicit computational complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.09.015openalex-snapshot
Linear logic by levels and bounded time complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.02.007openalex-snapshot
Quasi-interpretations a way to control resources
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.09.034openalex-snapshot
Safe recursion revisited I: Categorical semantics for lower complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.03.003openalex-snapshot
A new order-theoretic characterisation of the polytime computable functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.03.005openalex-snapshot
Realizability models for a linear dependent PCF
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.03.006openalex-snapshot
Program equivalence in linear contexts
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.03.007openalex-snapshot
Applicative theories for logarithmic complexity classes
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.03.008openalex-snapshot
Characterizing polynomial time complexity of stream programs using interpretations
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.07.003openalex-snapshot
Type-two polynomial-time and restricted lookahead
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.11.016openalex-snapshot
The polynomial hierarchy of functions and its levels
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.02.015openalex-snapshot
On efficiency of notations for natural numbers
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115655openalex-snapshot
Towards new characterizations of small circuit classes via discrete ordinary differential equations
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80033-0openalex-snapshot
Computation Models and Function Algebras
inferred← citeshttps://doi.org/10.1016/s0168-0072(00)00006-3openalex-snapshot
Higher type recursion, ramification and polynomial time
inferred← citeshttps://doi.org/10.1016/s0168-0072(00)00010-5openalex-snapshot
Safe recursion with higher types and BCK-algebra
inferred← citeshttps://doi.org/10.1016/s0168-0072(98)00040-2openalex-snapshot
Ramified recurrence and computational complexity III: Higher type recurrence and elementary complexity
inferred← citeshttps://doi.org/10.1016/s0168-0072(99)80002-5openalex-snapshot
Mω considered as a programming language
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00116-4openalex-snapshot
A predicative and decidable characterization of the polynomial classes of languages
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00209-1openalex-snapshot
A characterization of alternating log time by ramified recurrence
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00009-9openalex-snapshot
Linear types and non-size-increasing polynomial time computation
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00011-7openalex-snapshot
Analysing the implicit complexity of programs
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00086-5openalex-snapshot
Theories with self-application and computational complexity
inferred← citeshttps://doi.org/10.1016/s1571-0661(03)00003-3openalex-snapshot
The Garland Measure and Computational Complexity of Stack Programs
inferred← citeshttps://doi.org/10.1016/s1571-0661(03)00005-7openalex-snapshot
Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH
showing the first 200 of 353 · page through all 353
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.