On the public citation graph

Speed-Ups by changing the order in which sets are enumerated

https://doi.org/10.1007/bf01702871
0 signed · 26 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/malq.19680142105openalex-snapshot
A Dichotomy of the Recursively Enumerable Sets
inferredcites →https://doi.org/10.1016/s0019-9958(67)90546-3openalex-snapshot
On the size of machines
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1109/swat.1969.27openalex-snapshot
The operator gap
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/321510.321525openalex-snapshot
Toward a Theory of Enumerations
inferredcites →https://doi.org/10.1145/800169.805423openalex-snapshot
Classes of computable functions defined by bounds on computation
inferredcites →https://doi.org/10.1145/800169.805424openalex-snapshot
Speed-ups by changing the order in which sets are enumerated (Preliminary Version)
inferredcites →https://doi.org/10.2307/2272545openalex-snapshot
Computational speed-up by effective operators
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.

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.19840301703openalex-snapshot
ABSTRAKTE TEMPOMASZE UND SPEED‐UP‐THEOREMEA FÜR ENUMERATIONEN REKURSIV‐AUFZÄHLBARER MENGEN
inferred← citeshttps://doi.org/10.1007/3-540-07389-2_179openalex-snapshot
Ten years of speedup
inferred← citeshttps://doi.org/10.1007/bf01084283openalex-snapshot
Complexity of algorithms and computations
inferred← citeshttps://doi.org/10.1007/bf01141626openalex-snapshot
Infimums of step-counting functions of enumeration of sets
inferred← citeshttps://doi.org/10.1007/bf01890610openalex-snapshot
Corrigendum: Speed-ups by changing the order in which sets are enumerated
inferred← citeshttps://doi.org/10.1007/bfb0030306openalex-snapshot
On the complexity of inductive inference
inferred← citeshttps://doi.org/10.1016/0022-0000(78)90008-9openalex-snapshot
The complexity of total order structures
inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80042-0openalex-snapshot
On the complexity of inductive inference
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70326-4openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1090/s0002-9939-1973-0312768-7openalex-snapshot
Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems
inferred← citeshttps://doi.org/10.1109/swat.1969.27openalex-snapshot
The operator gap
inferred← citeshttps://doi.org/10.1145/321637.321648openalex-snapshot
On Effective Procedures for Speeding Up Algorithms
inferred← citeshttps://doi.org/10.2140/pjm.1973.46.185openalex-snapshot
On orders of translations and enumerations
inferred← citeshttps://doi.org/10.2140/pjm.1978.76.485openalex-snapshot
Characterizing the orders changed by program translators
inferred← citeshttps://doi.org/10.2307/2271512openalex-snapshot
On size vs. efficiency for programs admitting speed-ups
inferred← citeshttps://doi.org/10.2307/2273375openalex-snapshot
Splitting theorems for speed-up related to order of enumeration
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.