On the public citation graph
Complexity of algorithms and computations
0 signed · 169 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.19600060105openalex-snapshot
Weak Second‐Order Arithmetic and Finite Automata
inferredcites →https://doi.org/10.1002/malq.19610070702openalex-snapshot
Note on the 3‐Recursive Functions
inferredcites →https://doi.org/10.1002/malq.19630090106openalex-snapshot
Enumeration and the Grzegorczyk Hierarchy
inferredcites →https://doi.org/10.1002/malq.19630092202openalex-snapshot
A Hierarchy of Primitive Recursive Functions
inferredcites →https://doi.org/10.1002/malq.19650110310openalex-snapshot
Iteration of Primitive Recursion
inferredcites →https://doi.org/10.1002/malq.19680140706openalex-snapshot
The Halting Problem of one State Turing Machines with n‐Dimensional Tape
inferredcites →https://doi.org/10.1002/malq.19680142106openalex-snapshot
Hierarchies of Primitive Recursive Functions
inferredcites →https://doi.org/10.1002/malq.19710170125openalex-snapshot
The Equivalence of Different Hierarchies of Elementary Functions
inferredcites →https://doi.org/10.1002/malq.19720180405openalex-snapshot
A Classification of the Recursive Functions
inferredcites →https://doi.org/10.1002/zamm.19700500140openalex-snapshot
Programmkomplexität von berechenbaren Funktionen
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_22openalex-snapshot
Weak Second-Order Arithmetic and Finite Automata
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-0348-5879-3_12openalex-snapshot
Probleme der Komplexität in der Theorie der Algorithmen und Automaten
inferredcites →https://doi.org/10.1007/bf00534110openalex-snapshot
Complexity oscillations in infinite binary sequences
inferredcites →https://doi.org/10.1007/bf00534115openalex-snapshot
Eine Bemerkung zum Begriff der zuf�lligen Folge
inferredcites →https://doi.org/10.1007/bf00538763openalex-snapshot
Klassifikation der Zufallsgesetze nach Komplexit�t und Ordnung
inferredcites →https://doi.org/10.1007/bf01070498openalex-snapshot
Rudimentary interpretation of two-tape turing computation
inferredcites →https://doi.org/10.1007/bf01070520openalex-snapshot
Turing machines with three states and two symbols, and with one state and n symbols
inferredcites →https://doi.org/10.1007/bf01691468openalex-snapshot
A note on dense and nondense families of complexity classes
inferredcites →https://doi.org/10.1007/bf01694011openalex-snapshot
Counter machines and counter languages
inferredcites →https://doi.org/10.1007/bf01694077openalex-snapshot
On restricted turing computability
inferredcites →https://doi.org/10.1007/bf01694181openalex-snapshot
A unified approach to the definition of random sequences
inferredcites →https://doi.org/10.1007/bf01702870openalex-snapshot
The range of a vector measure with values in a montel space
inferredcites →https://doi.org/10.1007/bf01702871openalex-snapshot
Speed-Ups by changing the order in which sets are enumerated
inferredcites →https://doi.org/10.1007/bf01706069openalex-snapshot
Subrecursiveness: Machine-independent notions of computability in restricted time and storage
inferredcites →https://doi.org/10.1007/bf01746518openalex-snapshot
Two memory bounds for the recognition of primes by automata
inferredcites →https://doi.org/10.1007/bf01973616openalex-snapshot
Hierarchies of number-theoretic functions II
inferredcites →https://doi.org/10.1007/bf01973619openalex-snapshot
A classification of the ordinal recursive functions
inferredcites →https://doi.org/10.1007/bf01982053openalex-snapshot
Rekursionszahlen und die Grzegorczyk-Hierarchie
inferredcites →https://doi.org/10.1007/bf02218627openalex-snapshot
Complexity of computing pseudorandom sequences
inferredcites →https://doi.org/10.1007/bf02238815openalex-snapshot
k-Band-Simulation von k-Kopf-Turing-Maschinen
inferredcites →https://doi.org/10.1007/bf02242349openalex-snapshot
Zwei-Band Simulation von Turingmaschinen
inferredcites →https://doi.org/10.1007/bf02242355openalex-snapshot
Schnelle Multiplikation großer Zahlen
inferredcites →https://doi.org/10.1007/bfb0064872openalex-snapshot
Weak monadic second order theory of succesor is not elementary-recursive
inferredcites →https://doi.org/10.1016/0020-0255(69)90014-0openalex-snapshot
Automata-based computational complexity
inferredcites →https://doi.org/10.1016/0020-0255(69)90017-6openalex-snapshot
Some small, multitape universal Turing machines
inferredcites →https://doi.org/10.1016/b978-0-12-417750-5.50006-3openalex-snapshot
COMPUTATIONALLY COMPLEX AND PSEUDO-RANDOM ZERO-ONE VALUED FUNCTIONS††Portions of this work were carried out at Carngie-Mellon University, while the authors were in the Department of Computer Science. Portions of these results were reported in preliminary form in [1].
inferredcites →https://doi.org/10.1016/s0019-9958(64)90131-7openalex-snapshot
A formal theory of inductive inference. Part II
inferredcites →https://doi.org/10.1016/s0019-9958(64)90223-2openalex-snapshot
A formal theory of inductive inference. Part I
inferredcites →https://doi.org/10.1016/s0019-9958(65)90399-2openalex-snapshot
One-tape, off-line Turing machine computations
inferredcites →https://doi.org/10.1016/s0019-9958(66)80018-9openalex-snapshot
The definition of random sequences
inferredcites →https://doi.org/10.1016/s0019-9958(67)90433-0openalex-snapshot
Turing machines with a schedule to keep
inferredcites →https://doi.org/10.1016/s0019-9958(67)90546-3openalex-snapshot
On the size of machines
inferredcites →https://doi.org/10.1016/s0019-9958(68)90477-4openalex-snapshot
On-line turing machine recognition
inferredcites →https://doi.org/10.1016/s0019-9958(69)90538-5openalex-snapshot
A variant of the Kolmogorov concept of complexity
inferredcites →https://doi.org/10.1016/s0019-9958(70)90440-7openalex-snapshot
The state complexity of Turing machines
inferredcites →https://doi.org/10.1016/s0019-9958(70)90549-8openalex-snapshot
Note on tape reversal complexity of languages
inferredcites →https://doi.org/10.1016/s0019-9958(72)90592-xopenalex-snapshot
Program size in restricted programming languages
inferredcites →https://doi.org/10.1016/s0019-9958(72)90843-1openalex-snapshot
On the speed of addition and multiplication on one-tape, off-line turing machines
inferredcites →https://doi.org/10.1016/s0020-0255(71)80024-5openalex-snapshot
Complexity problems in real time languages
inferredcites →https://doi.org/10.1016/s0022-0000(68)80027-3openalex-snapshot
Tape-reversal bounded turing machine computations
inferredcites →https://doi.org/10.1016/s0022-0000(68)80028-5openalex-snapshot
The reduction of tape reversals for off-line one-tape Turing machines
inferredcites →https://doi.org/10.1016/s0022-0000(70)80006-xopenalex-snapshot
Relationships between nondeterministic and deterministic tape complexities
inferredcites →https://doi.org/10.1016/s0022-0000(70)80012-5openalex-snapshot
Time-restricted sequence generation
inferredcites →https://doi.org/10.1016/s0022-0000(71)80037-5openalex-snapshot
The enumerability and invariance of complexity classes
inferredcites →https://doi.org/10.1016/s0022-0000(72)80004-7openalex-snapshot
Real-time language recognition by one-dimensional cellular automata
inferredcites →https://doi.org/10.1016/s0022-0000(72)80010-2openalex-snapshot
Degrees of computational complexity
inferredcites →https://doi.org/10.1016/s0022-0000(72)80017-5openalex-snapshot
Tape bounds for time-bounded turing machines
inferredcites →https://doi.org/10.1016/s0049-237x(08)70741-9openalex-snapshot
On the Notion of Randomness
inferredcites →https://doi.org/10.1070/im1967v001n01abeh000552openalex-snapshot
NORMAL ALGORITHMS CONNECTED WITH THE COMPUTATION OF BOOLEAN FUNCTIONS
inferredcites →https://doi.org/10.1070/rm1970v025n06abeh001269openalex-snapshot
THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
inferredcites →https://doi.org/10.1090/pspum/005/0142452openalex-snapshot
Size and structure of universal Turing machines using tag systems
inferredcites →https://doi.org/10.1090/s0002-9904-1940-07154-xopenalex-snapshot
On the concept of a random sequence
inferredcites →https://doi.org/10.1090/s0002-9939-1965-0181538-0openalex-snapshot
Machine Dependence of Degrees of Difficulty
inferredcites →https://doi.org/10.1090/s0002-9939-1969-0250878-2openalex-snapshot
A New Hierarchy of Elementary Functions
inferredcites →https://doi.org/10.1090/s0002-9947-1962-0142453-3openalex-snapshot
Classifications of Recursive Functions by Means of Hierarchies
inferredcites →https://doi.org/10.1090/s0002-9947-1963-0158822-2openalex-snapshot
Classes of predictably computable functions
inferredcites →https://doi.org/10.1090/s0002-9947-1965-0170805-7openalex-snapshot
On the Computational Complexity of Algorithms
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0249212-8openalex-snapshot
On the Minimum Computation Time of Functions
inferredcites →https://doi.org/10.1090/s0002-9947-1976-0403933-6openalex-snapshot
Relativization of the theory of computational complexity
inferredcites →https://doi.org/10.1109/focs.1965.11openalex-snapshot
Hierarchies of memory limited computations
inferredcites →https://doi.org/10.1109/focs.1965.33openalex-snapshot
Translational methods and computational complexity
inferredcites →https://doi.org/10.1109/focs.1965.5openalex-snapshot
Crossing sequences and off-line turing machine computations
inferredcites →https://doi.org/10.1109/focs.1967.35openalex-snapshot
Turing machines with several read-write heads
inferredcites →https://doi.org/10.1109/pgec.1965.264145openalex-snapshot
A One-Dimensional Real-Time Iterative Multiplier
inferredcites →https://doi.org/10.1109/pgec.1966.264374openalex-snapshot
On-Line Turing Machine Computations
inferredcites →https://doi.org/10.1109/swat.1968.33openalex-snapshot
Tape reversal complexity hierarchies
inferredcites →https://doi.org/10.1109/swat.1969.4openalex-snapshot
Dense and non-dense families of complexity classes
inferredcites →https://doi.org/10.1109/swat.1970.16openalex-snapshot
On the efficiency of programs in subrecursive formalisms
inferredcites →https://doi.org/10.1109/swat.1971.11openalex-snapshot
Economy of description by automata, grammars, and formal systems
inferredcites →https://doi.org/10.1109/swat.1972.8openalex-snapshot
Honest bounds for complexity classes of recursive functions
inferredcites →https://doi.org/10.1109/tec.1962.5219459openalex-snapshot
Real-Time Computation and Recursive Functions Not Real-Time Computable
inferredcites →https://doi.org/10.1145/1008311.1008313openalex-snapshot
Corrections for "On the lengths of proofs in the propositional calculus preliminary version"
inferredcites →https://doi.org/10.1145/1008861.1008864openalex-snapshot
Review of "Checking Landau's "Grundlagen" in the Automath system" by L. S. Van Benthem Jutting. Mathematical Centre 1979.
inferredcites →https://doi.org/10.1145/1247036.1247037openalex-snapshot
Axioms for time dependence of resource consumption in computing recursive functions
inferredcites →https://doi.org/10.1145/1247054.1247057openalex-snapshot
A corrected definition of "local speed-up"
inferredcites →https://doi.org/10.1145/1478873.1478939openalex-snapshot
On the structure of Blum measure
inferredcites →https://doi.org/10.1145/1810926.1810928openalex-snapshot
How to have your abstract rejected
inferredcites →https://doi.org/10.1145/321088.321090openalex-snapshot
5-Symbol 8-State and 5-Symbol 6-State Universal Turing Machines
inferredcites →https://doi.org/10.1145/321264.321279openalex-snapshot
On the Time Required to Perform Addition
inferredcites →https://doi.org/10.1145/321356.321362openalex-snapshot
Two-Tape Simulation of Multitape Turing Machines
inferredcites →https://doi.org/10.1145/321356.321363openalex-snapshot
On the Length of Programs for Computing Finite Binary Sequences
inferredcites →https://doi.org/10.1145/321386.321395openalex-snapshot
A Machine-Independent Theory of the Complexity of Recursive Functions
inferredcites →https://doi.org/10.1145/321406.321410openalex-snapshot
Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines
inferredcites →https://doi.org/10.1145/321420.321426openalex-snapshot
The Solvability of the Halting Problem for 2-State Post Machines
inferredcites →https://doi.org/10.1145/321420.321438openalex-snapshot
On the Time Required to Perform Multiplication
inferredcites →https://doi.org/10.1145/321450.321464openalex-snapshot
Computational Complexity of One-Tape Turing Machine Computations
inferredcites →https://doi.org/10.1145/321466.321474openalex-snapshot
Relations Between Time and Tape Complexities
inferredcites →https://doi.org/10.1145/321495.321506openalex-snapshot
On the Length of Programs for Computing Finite Binary Sequences
inferredcites →https://doi.org/10.1145/321495.321507openalex-snapshot
On the Complexity of Undecidable Problems in Automata Theory
inferredcites →https://doi.org/10.1145/321495.321508openalex-snapshot
Some Results on Tape-Bounded Turing Machines
inferredcites →https://doi.org/10.1145/321541.321551openalex-snapshot
Random Sets in Subrecursive Hierarchies
inferredcites →https://doi.org/10.1145/321607.321619openalex-snapshot
On the Efficiency of Algorithms
inferredcites →https://doi.org/10.1145/321623.321625openalex-snapshot
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
inferredcites →https://doi.org/10.1145/321637.321648openalex-snapshot
On Effective Procedures for Speeding Up Algorithms
inferredcites →https://doi.org/10.1145/321650.321661openalex-snapshot
An Overview of the Theory of Computational Complexity
inferredcites →https://doi.org/10.1145/321679.321691openalex-snapshot
Computational Complexity and the Existence of Complexity Gaps
inferredcites →https://doi.org/10.1145/321694.321702openalex-snapshot
Recursive Properties of Abstract Complexity Classes
inferredcites →https://doi.org/10.1145/321724.321726openalex-snapshot
Real-Time Simulation of Multihead Tape Units
inferredcites →https://doi.org/10.1145/321724.321727openalex-snapshot
A Note Concerning Nondeterministic Tape Complexities
inferredcites →https://doi.org/10.1145/800125.804029openalex-snapshot
Word problems requiring exponential time(Preliminary Report)
inferredcites →https://doi.org/10.1145/800152.804910openalex-snapshot
The process complexity and effective random tests.
inferredcites →https://doi.org/10.1145/800152.804912openalex-snapshot
Program size and economy of descriptions
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.1145/800157.805053openalex-snapshot
Complexity of formal translations and speed-up results
inferredcites →https://doi.org/10.1145/800157.805055openalex-snapshot
Complexity classes of partial recursive functions (Preliminary Version)
inferredcites →https://doi.org/10.1145/800161.805143openalex-snapshot
On the size of programs in subrecursive formalisms
inferredcites →https://doi.org/10.1145/800161.805150openalex-snapshot
Complexity problems in real time computation
inferredcites →https://doi.org/10.1145/800169.805423openalex-snapshot
Classes of computable functions defined by bounds on computation
inferredcites →https://doi.org/10.1305/ndjfl/1093957149openalex-snapshot
Proof of some theorems on recursively enumerable sets.
inferredcites →https://doi.org/10.1515/9781400882007openalex-snapshot
Theory of Formal Systems. (AM-47)
inferredcites →https://doi.org/10.1515/9781400882618-007openalex-snapshot
A Universal Turing Machine with Two Internal States
inferredcites →https://doi.org/10.2140/pjm.1965.15.1027openalex-snapshot
Classes of recursive functions based on Ackermann’s function
inferredcites →https://doi.org/10.2307/2267315openalex-snapshot
László Kalmár. Egyszeril példa eldönthetetlen aritmetikai problémára (Ein einfaches Beispiel für ein unentscheidbares arithmetisches Problem). Ungarisch mit deutschem Auszug. Ebd., S. 1–23.
inferredcites →https://doi.org/10.2307/2268337openalex-snapshot
Zusammenhang der mehrfachen und transfiniten Rekursionen
inferredcites →https://doi.org/10.2307/2269717openalex-snapshot
M. L. Minsky. Size and structure of universal Turing machines using Tag systems. Recursive function theory, Proceedings of symposia in pure mathematics, vol. 5, American Mathematical Society, Providence 1962, pp. 229–238.
inferredcites →https://doi.org/10.2307/2270381openalex-snapshot
Paul Axt. Note on the 3-recursive functions. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, Bd. 7 (1961), S. 97–98.
inferredcites →https://doi.org/10.2307/2270588openalex-snapshot
Paul Axt. Enumeration and the Grzegorczyk hierarchy. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, Bd. 9 (1963), S. 53–65.
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/2271026openalex-snapshot
G. S. Matvééva. К téorémé Rabina o složnosti vyčislimyh funkcij (On a theorem of Rabin concerning the complexity of computable functions). Sibirskij matématičéskij žurnal, vol. 6 (1965), pp. 546–555.
inferredcites →https://doi.org/10.2307/2271512openalex-snapshot
On size vs. efficiency for programs admitting speed-ups
inferredcites →https://doi.org/10.2307/2272353openalex-snapshot
Honest bounds for complexity classes of recursive functions
inferredcites →https://doi.org/10.2307/2272545openalex-snapshot
Computational speed-up by effective operators
inferredcites →https://doi.org/10.2307/2272973openalex-snapshot
Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy
inferredcites →https://doi.org/10.2307/2313471openalex-snapshot
Computation: Finite and Infinite Machines.
inferredcites →https://doi.org/10.4064/cm-6-1-67-78openalex-snapshot
Extension of an effectively generated class of functions by enumeration
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-08353-7_134openalex-snapshot
Frequency algorithms and computations
inferred← citeshttps://doi.org/10.1007/3-540-09526-8_24openalex-snapshot
Bounds on computational complexity and approximability of initial segments of recursive sets
inferred← citeshttps://doi.org/10.1007/978-1-4615-9050-7_1openalex-snapshot
Theory of Algorithms and Discrete Processors
inferred← citeshttps://doi.org/10.1007/978-3-642-02017-9_12openalex-snapshot
Quantitative Aspects of Speed-Up and Gap Phenomena
inferred← citeshttps://doi.org/10.1007/978-3-7091-3008-7_7openalex-snapshot
Complexity and Information Theory
inferred← citeshttps://doi.org/10.1007/978-94-017-2973-4_13openalex-snapshot
The Combinatorial Foundations of Information Theory and the Probability Calculus
inferred← citeshttps://doi.org/10.1007/bf01068368openalex-snapshot
Deterministic realization of nondeterministic computations with a low measure of nondeterminism
inferred← citeshttps://doi.org/10.1007/bf01068589openalex-snapshot
Certain special cases of the problem of stopping and functional equivalence of automata
inferred← citeshttps://doi.org/10.1007/bf01070378openalex-snapshot
Facet classification of software quality measures
inferred← citeshttps://doi.org/10.1007/bf01073301openalex-snapshot
Comparison of two-sided automata with respect to operating time and decidability in the problem of functional equivalence in a certain class of discrete transducers and program schemes over memory
inferred← citeshttps://doi.org/10.1007/bf01073983openalex-snapshot
Difficulty of translating the languages used to record formulas
inferred← citeshttps://doi.org/10.1007/bf01078500openalex-snapshot
Toward mechanical analysis of the computational complexity of algorithms
inferred← citeshttps://doi.org/10.1007/bf02547921openalex-snapshot
On the algorithms for determining the primary structure of biopolymers
inferred← citeshttps://doi.org/10.1007/s10559-009-9139-8openalex-snapshot
Technique of traces in solving the equivalence problem in algebraic program models
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00066-6openalex-snapshot
Effective category and measure in abstract complexity theory
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00163-8openalex-snapshot
Computational complexity of functions
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50008-4openalex-snapshot
Machine-Independent Complexity Theory
inferred← citeshttps://doi.org/10.1109/swat.1972.8openalex-snapshot
Honest bounds for complexity classes of recursive functions
inferred← citeshttps://doi.org/10.2307/2272353openalex-snapshot
Honest bounds for complexity classes of recursive functions
inferred← citeshttps://doi.org/10.3166/ejc.15.449-467openalex-snapshot
The Problem of Stabilization of Networked Systems under Computational Power Constraints
inferred← citeshttps://doi.org/10.5287/ora-6rbaxj8rzopenalex-snapshot
A model-independent theory of computational complexity: from patience to precision and beyond
inferred← citeshttps://doi.org/10.7463/0713.0588392openalex-snapshot
Measuring phase difference of quasi-harmonic signals in real time
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.