On the public citation graph
Ramified recurrence and computational complexity II: Substitution and poly-space
0 signed · 103 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-50171-1_9openalex-snapshot
Hypothetical datalog: Complexity and expressibility
inferredcites →https://doi.org/10.1007/3-540-58140-5_23openalex-snapshot
Predicative recurrence in finite types
inferredcites →https://doi.org/10.1007/3-540-60164-3_29openalex-snapshot
V-comprehensions and P space
inferredcites →https://doi.org/10.1007/978-1-4612-2566-9_11openalex-snapshot
Ramified Recurrence and Computational Complexity I: Word Recurrence and Poly-time
inferredcites →https://doi.org/10.1007/978-1-4612-2566-9_2openalex-snapshot
Predicative Recursion and The Polytime Hierarchy
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-3-540-92687-0openalex-snapshot
Logical Foundations of Computer Science
inferredcites →https://doi.org/10.1007/bf01200263openalex-snapshot
Logical and schematic characterization of complexity classes
inferredcites →https://doi.org/10.1007/bf01201998openalex-snapshot
A new recursion-theoretic characterization of the polytime functions
inferredcites →https://doi.org/10.1007/bf01706069openalex-snapshot
Subrecursiveness: Machine-independent notions of computability in restricted time and storage
inferredcites →https://doi.org/10.1016/0022-0000(81)90039-8openalex-snapshot
Number of quantifiers is better than number of tape cells
inferredcites →https://doi.org/10.1016/0022-0000(82)90011-3openalex-snapshot
Upper and lower bounds for first order expressibility
inferredcites →https://doi.org/10.1016/0022-0000(83)90008-9openalex-snapshot
A view of computability on term algebras
inferredcites →https://doi.org/10.1016/0022-0000(91)90032-zopenalex-snapshot
Datalog extensions for database queries and updates
inferredcites →https://doi.org/10.1016/0168-0072(86)90055-2openalex-snapshot
Fixed-point extensions of first-order logic
inferredcites →https://doi.org/10.1016/0304-3975(88)90052-7openalex-snapshot
Some relationships between logics of programs and complexity theory
inferredcites →https://doi.org/10.1016/0304-3975(92)90363-kopenalex-snapshot
Characterizing complexity classes by higher type primitive recursive definitions
inferredcites →https://doi.org/10.1016/0890-5401(90)90006-4openalex-snapshot
Inductive definitions over finite structures
inferredcites →https://doi.org/10.1016/s0019-9958(86)80029-8openalex-snapshot
Relational queries computable in polynomial time
inferredcites →https://doi.org/10.1090/s0002-9947-1963-0158822-2openalex-snapshot
Classes of predictably computable functions
inferredcites →https://doi.org/10.1109/lics.1989.39160openalex-snapshot
Fixpoint extensions of first-order logic and datalog-like languages
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.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/158511.158659openalex-snapshot
Stratified functional programs and computational complexity
inferredcites →https://doi.org/10.1145/298514.298575openalex-snapshot
Non-deterministic languages to express deterministic transformations
inferredcites →https://doi.org/10.1145/800070.802186openalex-snapshot
The complexity of relational query languages (Extended Abstract)
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.…
inferredcites →https://doi.org/10.2307/2272354openalex-snapshot
Turing machines and the spectra of first-order formulas
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.200610056openalex-snapshot
Characterizing PSPACE with pointers
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/11874683_14openalex-snapshot
Towards an Implicit Characterization of NC k
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-45413-6_11openalex-snapshot
Ramied Recurrence with Dependent Types
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-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-60164-3_29openalex-snapshot
V-comprehensions and P space
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/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-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-540-24849-1_12openalex-snapshot
Higher-Order Linear Ramified Recurrence
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_22openalex-snapshot
The Role of Polymorphism in the Characterisation of Complexity by Soft Types
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-37075-5_20openalex-snapshot
Type-Based Complexity Analysis for Fork Processes
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/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/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.1016/j.entcs.2008.03.066openalex-snapshot
Soft Linear Logic and Polynomial Complexity Classes
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.2014.10.009openalex-snapshot
A higher-order characterization of probabilistic polynomial time
inferred← citeshttps://doi.org/10.1016/j.ic.2015.12.011openalex-snapshot
The role of polymorphism in the characterisation of complexity by soft types
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.ipl.2005.09.005openalex-snapshot
A decidable characterization of the classes between lintime and exptime
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/s0168-0072(00)00010-5openalex-snapshot
Safe recursion with higher types and BCK-algebra
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/s1571-0661(03)00005-7openalex-snapshot
Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH
inferred← citeshttps://doi.org/10.1017/s0956796800003853openalex-snapshot
A predicative approach to the classification problem
inferred← citeshttps://doi.org/10.1017/s0960129521000505openalex-snapshot
Implicit computation complexity in higher-order programming languages
inferred← citeshttps://doi.org/10.1093/logcom/exh036openalex-snapshot
Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time
inferred← citeshttps://doi.org/10.1109/lics.1999.782641openalex-snapshot
Linear types and non-size-increasing polynomial time computation
inferred← citeshttps://doi.org/10.1109/lics.2005.52openalex-snapshot
The Geometry of Linear Higher-Order Recursion
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743522openalex-snapshot
A characterization of NC by tree recurrence
inferred← citeshttps://doi.org/10.1137/s009753979528175xopenalex-snapshot
Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited
inferred← citeshttps://doi.org/10.1142/s0129054124470014openalex-snapshot
A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations
inferred← citeshttps://doi.org/10.1145/1462179.1462180openalex-snapshot
The geometry of linear higher-order recursion
inferred← citeshttps://doi.org/10.1145/2069216.2069253openalex-snapshot
Course of value distinguishes the intentionality of programming languages
inferred← citeshttps://doi.org/10.1145/2159531.2159540openalex-snapshot
An Implicit Characterization of PSPACE
inferred← citeshttps://doi.org/10.1145/2764906openalex-snapshot
Computational Complexity Via Finite Types
inferred← citeshttps://doi.org/10.4204/eptcs.183.3openalex-snapshot
Complexity Analysis of Precedence Terminating Infinite Graph Rewrite Systems
inferred← citeshttps://doi.org/10.4204/eptcs.191.5openalex-snapshot
Formalizing Termination Proofs under Polynomial Quasi-interpretations
inferred← citeshttps://doi.org/10.4204/eptcs.23.3openalex-snapshot
Church => Scott = Ptime: an application of resource sensitive realizability
inferred← citeshttps://doi.org/10.4204/eptcs.298.3openalex-snapshot
Pointers in Recursion: Exploring the Tropics
inferred← citeshttps://doi.org/10.4204/eptcs.75.4openalex-snapshot
A type system for PSPACE derived from light linear logic
inferred← citeshttps://doi.org/10.48550/arxiv.0712.4222openalex-snapshot
Weak Affine Light Typing: Polytime intensional expressivity, soundness and completeness
inferred← citeshttps://doi.org/10.48550/arxiv.1006.0030openalex-snapshot
An Implicit Characterization of PSPACE
inferred← citeshttps://doi.org/10.48550/arxiv.1202.3317openalex-snapshot
An Higher-Order Characterization of Probabilistic Polynomial Time (Long Version)
inferred← citeshttps://doi.org/10.48550/arxiv.1502.01257openalex-snapshot
Towards a Complexity-through-Realisability Theory
inferred← citeshttps://doi.org/10.48550/arxiv.1609.07895openalex-snapshot
Interaction Graphs: Nondeterministic Automata
inferred← citeshttps://doi.org/10.48550/arxiv.1911.04026openalex-snapshot
A generic imperative language for polynomial time
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0010008openalex-snapshot
The Light Lexicographic path Ordering
inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/5573openalex-snapshot
Implicit computational complexity and probabilistic classes
inferred← citeshttps://doi.org/10.70675/7b24b28ez6913z4370zb5e2z272a28c751e7openalex-snapshot
Implicit Computational Complexity and Compilers
inferred← citeshttps://doi.org/10.7146/brics.v8i46.21706openalex-snapshot
The Implicit Computational Complexity of Imperative Programming Languages
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.