On the public citation graph
The realm of primitive recursion
0 signed · 73 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.1002/malq.19710170113openalex-snapshot
Eine Klassifikation der ε0‐Rekursiven Funktionen
inferredcites →https://doi.org/10.1007/978-3-662-12898-5openalex-snapshot
Recursion-Theoretic Hierarchies
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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/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/11874683_14openalex-snapshot
Towards an Implicit Characterization of NC k
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-44802-0_9openalex-snapshot
Actual Arithmetic and Feasibility
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-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-60178-3_81openalex-snapshot
Computation models and function algebras
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/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-031-64309-5_20openalex-snapshot
Recursion-Theoretic Alternation
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-29198-7_13openalex-snapshot
Pointwise Transfinite Induction and a Miniaturized Predicativity
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-87531-4_6openalex-snapshot
Recursion Schemata for NC k
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-35182-2_20openalex-snapshot
A New Order-Theoretic Characterisation of the Polytime Computable Functions
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-642-76799-9_1openalex-snapshot
Theory of Computation and Specification over Abstract Data Types, and its Applications
inferred← citeshttps://doi.org/10.1007/978-94-010-0413-8_13openalex-snapshot
Feasible Computation with Higher Types
inferred← citeshttps://doi.org/10.1007/bfb0022277openalex-snapshot
Ramified recurrence and computational complexity II: Substitution and poly-space
inferred← citeshttps://doi.org/10.1007/bfb0030611openalex-snapshot
Predicative functional recurrence and poly-space
inferred← citeshttps://doi.org/10.1007/s00037-005-0191-0openalex-snapshot
Neat function algebraic characterizations of logspace and linspace
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.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.ic.2015.12.009openalex-snapshot
Two function algebras defining functions in NCk boolean circuits
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.tcs.2003.10.016openalex-snapshot
On the computational complexity of imperative programming languages
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.2006.03.019openalex-snapshot
An arithmetic for polynomial-time computation
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/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(96)00015-2openalex-snapshot
Term rewriting theory for the primitive recursive functions
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/s0304-3975(96)00052-7openalex-snapshot
Unification of infinite sets of terms schematized by primal grammars
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)00011-7openalex-snapshot
Analysing the implicit complexity of programs
inferred← citeshttps://doi.org/10.1017/s0956796800003853openalex-snapshot
A predicative approach to the classification problem
inferred← citeshttps://doi.org/10.1017/s0956796800003877openalex-snapshot
Algorithms with polynomial interpretation termination proof
inferred← citeshttps://doi.org/10.1093/logcom/exq009openalex-snapshot
Higher Types, Finite Domains and Resource-bounded Turing Machines
inferred← citeshttps://doi.org/10.1109/lics.2000.855758openalex-snapshot
A syntactical analysis of non-size-increasing polynomial time computation
inferred← citeshttps://doi.org/10.1109/lics.2011.41openalex-snapshot
A Type System for Complexity Flow Analysis
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743522openalex-snapshot
A characterization of NC by tree recurrence
inferred← citeshttps://doi.org/10.1137/s0097539701387854openalex-snapshot
Safe Weak Minimization Revisited
inferred← citeshttps://doi.org/10.1137/s0097539704445597openalex-snapshot
Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs
inferred← citeshttps://doi.org/10.1145/1555746.1555752openalex-snapshot
A flow calculus ofmwp-bounds for complexity analysis
inferred← citeshttps://doi.org/10.1145/507382.507386openalex-snapshot
A syntactical analysis of non-size-increasing polynomial time computation
inferred← citeshttps://doi.org/10.2168/lmcs-12(3:8)2016openalex-snapshot
Build your own clarithmetic I: Setup and completeness
inferred← citeshttps://doi.org/10.2168/lmcs-5(1:7)2009openalex-snapshot
On tiered small jump operators
inferred← citeshttps://doi.org/10.2178/bsl/1122038991openalex-snapshot
Tiering as a Recursion Technique
inferred← citeshttps://doi.org/10.4204/eptcs.23.4openalex-snapshot
General Ramified Recurrence is Sound for Polynomial Time
inferred← citeshttps://doi.org/10.4204/eptcs.311.4openalex-snapshot
Smarter Features, Simpler Learning?
inferred← citeshttps://doi.org/10.48550/arxiv.0904.0981openalex-snapshot
Dependency Pairs and Polynomial Path Orders
inferred← citeshttps://doi.org/10.48550/arxiv.1201.2553openalex-snapshot
A New Order-theoretic Characterisation of the Polytime Computable Functions
inferred← citeshttps://doi.org/10.48550/arxiv.1209.3793openalex-snapshot
Polynomial Path Orders: A Maximal Model
inferred← citeshttps://doi.org/10.48550/arxiv.1308.0247openalex-snapshot
Predicative Lexicographic Path Orders: An Application of Term Rewriting to the Region of Primitive Recursive Functions
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0011037openalex-snapshot
A syntactical analysis of non-size-increasing polynomial time computation
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.