On the public citation graph

Remarks on ?A Synthesis of Several Sorting Algorithms? by John Darlington

https://doi.org/10.1007/bf00288643
0 signed · 20 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.1007/bf00264597openalex-snapshot
A synthesis of several sorting algorithms
inferredcites →https://doi.org/10.1016/0004-3702(79)90013-4openalex-snapshot
An experiment in knowledge-based automatic programming
inferredcites →https://doi.org/10.1016/s0004-3702(78)80016-2openalex-snapshot
On program synthesis knowledge
inferredcites →https://doi.org/10.2307/2005383openalex-snapshot
The Art of Computer Programming, Vol. 3: Sorting and Searching

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118032886.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/978-1-4471-2386-6_13openalex-snapshot
Experiment Analysis on the Bubble Sort Algorithm and Its Improved Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-85315-0_18openalex-snapshot
AlCons : Deductive Synthesis of Sorting Algorithms in Theorema
inferred← citeshttps://doi.org/10.1007/978-94-009-7019-9_1openalex-snapshot
Program Construction by Transformations: A Family Tree of Sorting Programs
inferred← citeshttps://doi.org/10.1007/bf00263502openalex-snapshot
A note on synthesis and classification of sorting algorithms
inferred← citeshttps://doi.org/10.1016/0020-0190(84)90094-2openalex-snapshot
On synthesis of scheduling algorithms
inferred← citeshttps://doi.org/10.1016/j.jlamp.2020.100635openalex-snapshot
Synthesis of sorting algorithms using multisets in Theorema
inferred← citeshttps://doi.org/10.1016/j.jsc.2014.09.030openalex-snapshot
Synthesis of list algorithms by mechanical proving
inferred← citeshttps://doi.org/10.1080/0899340940050107openalex-snapshot
An Expanded Taxonomy of Sorting Algorithms
inferred← citeshttps://doi.org/10.1109/icis.2008.34openalex-snapshot
Generating Algorithms plus Loop Invariants by Formal Derivation
inferred← citeshttps://doi.org/10.1109/saci49304.2020.9118814openalex-snapshot
Deductive Synthesis of Min-Max-Sort Using Multisets in Theorema
inferred← citeshttps://doi.org/10.1109/sami48414.2020.9108725openalex-snapshot
Deductive Synthesis of Bubble–Sort Using Multisets
inferred← citeshttps://doi.org/10.1109/sisy60376.2023.10417933openalex-snapshot
Mechanical Verification of Insert-Sort and Merge-Sort Using Multisets in Theorema
inferred← citeshttps://doi.org/10.1145/2465.214925openalex-snapshot
An inverted taxonomy of sorting algorithms
inferred← citeshttps://doi.org/10.1145/800037.800987openalex-snapshot
A top down approach to sorting
inferred← citeshttps://doi.org/10.2478/v10129-010-0019-1openalex-snapshot
Protection of segetal flora and vegetation in Poland (historical outline)
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.