On the public citation graph
A synthesis of several sorting algorithms
0 signed · 118 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.1016/0004-3702(75)90008-9openalex-snapshot
Knowledge and reasoning in program synthesis
inferredcites →https://doi.org/10.1016/s0004-3702(78)80016-2openalex-snapshot
On program synthesis knowledge
inferredcites →https://doi.org/10.1145/321992.321996openalex-snapshot
A Transformation System for Developing Recursive Programs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nme.7638openalex-snapshot
A Multi‐Time Stepping Algorithm for the Modelling of Heterogeneous Structures With Explicit Time Integration
inferred← citeshttps://doi.org/10.1007/3-540-11157-3_30openalex-snapshot
The logical approach to programming
inferred← citeshttps://doi.org/10.1007/3-540-15199-0_14openalex-snapshot
A theory of abstract data types for program development: Bridging the gap?
inferred← citeshttps://doi.org/10.1007/3-540-15199-0_15openalex-snapshot
Program development and documentation by informal transformations and derivations
inferred← citeshttps://doi.org/10.1007/3-540-16780-3_127openalex-snapshot
Deductive synthesis of sorting programs
inferred← citeshttps://doi.org/10.1007/3-540-31288-9_20openalex-snapshot
Imperative Specification Programming
inferred← citeshttps://doi.org/10.1007/3-540-49727-7_7openalex-snapshot
Deriving Analysers by Folding/Unfolding of Natural Semantics and a Case Study: Slicing
inferred← citeshttps://doi.org/10.1007/3-540-54141-1_13openalex-snapshot
Bulk types for large scale programming
inferred← citeshttps://doi.org/10.1007/3-540-58485-4_58openalex-snapshot
Mechanical elimination of commutative redundancy
inferred← citeshttps://doi.org/10.1007/3-540-60117-1_6openalex-snapshot
Derivation of parallel algorithms from functional specifications to CSP processes
inferred← citeshttps://doi.org/10.1007/978-0-387-35264-0_12openalex-snapshot
Program Derivation via List Introduction
inferred← citeshttps://doi.org/10.1007/978-1-349-21151-7_9openalex-snapshot
Sorting: An Algorithm on the ADT List
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-1-4614-5725-1_2openalex-snapshot
Chapter 1 Elliptic Functions
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-3-319-35122-3_5openalex-snapshot
Tax-PLEASE—Towards Taxonomy-Based Software Product Line Engineering
inferred← citeshttps://doi.org/10.1007/978-3-319-47166-2_54openalex-snapshot
Correctness-by-Construction $$\wedge $$ Taxonomies $$\Rightarrow $$ Deep Comprehension of Algorithm Families
inferred← citeshttps://doi.org/10.1007/978-3-540-88643-3_4openalex-snapshot
Transforming Data by Calculation
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_35openalex-snapshot
Towards a Taxonomy for ECFG and RRPG Parsing
inferred← citeshttps://doi.org/10.1007/978-3-642-11999-6_6openalex-snapshot
A Taxonomy of Some Right-to-Left String-Matching Algorithms
inferred← citeshttps://doi.org/10.1007/bf00263502openalex-snapshot
A note on synthesis and classification of sorting algorithms
inferred← citeshttps://doi.org/10.1007/bf00288643openalex-snapshot
Remarks on ?A Synthesis of Several Sorting Algorithms? by John Darlington
inferred← citeshttps://doi.org/10.1007/bf01132777openalex-snapshot
Design of symbolic-processing algorithms
inferred← citeshttps://doi.org/10.1007/bf01887204openalex-snapshot
Program development in the constructive set theory TK
inferred← citeshttps://doi.org/10.1007/bf02915444openalex-snapshot
Corrections to “A synthesis of several sorting algorithms” by J. Darlington
inferred← citeshttps://doi.org/10.1007/bf02983374openalex-snapshot
Efficient memo-table management strategies
inferred← citeshttps://doi.org/10.1007/bf03038309openalex-snapshot
Derivation of algorithms by introduction of generation functions
inferred← citeshttps://doi.org/10.1007/bfb0014672openalex-snapshot
Systematics of transformation rules
inferred← citeshttps://doi.org/10.1007/bfb0022492openalex-snapshot
Formal description of programming concepts
inferred← citeshttps://doi.org/10.1007/s00165-011-0205-4openalex-snapshot
Experiments in program verification using Event-B
inferred← citeshttps://doi.org/10.1007/s00165-013-0287-2openalex-snapshot
Provably correct derivation of algorithms using FermaT
inferred← citeshttps://doi.org/10.1007/s001650200011openalex-snapshot
The List Introduction Strategy for the Derivation of Logic Programs
inferred← citeshttps://doi.org/10.1016/0004-3702(80)90001-6openalex-snapshot
Synthesising recursive functions with side effects
inferred← citeshttps://doi.org/10.1016/0004-3702(80)90050-8openalex-snapshot
Syntax-directed, semantics-supported program synthesis
inferred← citeshttps://doi.org/10.1016/0004-3702(81)90014-xopenalex-snapshot
An experimental program transformation and synthesis system
inferred← citeshttps://doi.org/10.1016/0004-3702(85)90083-9openalex-snapshot
Top-down synthesis of divide-and-conquer algorithms
inferred← citeshttps://doi.org/10.1016/0020-0190(84)90007-3openalex-snapshot
Some equivalent transformations of recursive programs based on their schematic properties
inferred← citeshttps://doi.org/10.1016/0020-0190(84)90094-2openalex-snapshot
On synthesis of scheduling algorithms
inferred← citeshttps://doi.org/10.1016/0164-1212(95)00095-xopenalex-snapshot
Space-efficient memo-functions
inferred← citeshttps://doi.org/10.1016/0167-6423(82)90010-7openalex-snapshot
Implementing specification freedoms
inferred← citeshttps://doi.org/10.1016/0167-6423(82)90017-xopenalex-snapshot
An exercise in program synthesis: algorithms for computing the transitive closure of a relation
inferred← citeshttps://doi.org/10.1016/0167-6423(83)90002-3openalex-snapshot
An exercise in the transformational derivation of an efficient program by joint development of control and data structure
inferred← citeshttps://doi.org/10.1016/0167-6423(84)90010-8openalex-snapshot
Structuring transformational developments: A case study based on earley's recognizer
inferred← citeshttps://doi.org/10.1016/0167-6423(86)90008-0openalex-snapshot
Transformational program development in a particular problem domain
inferred← citeshttps://doi.org/10.1016/0167-6423(86)90026-2openalex-snapshot
Program derivation through transformations: The evolution of list-copying algorithms
inferred← citeshttps://doi.org/10.1016/0167-6423(88)90052-4openalex-snapshot
Linearisation: An optimisation for nonlinear functional programs
inferred← citeshttps://doi.org/10.1016/0167-6423(91)90022-popenalex-snapshot
An exercise in transformational programming: Backtracking and branch-and-bound
inferred← citeshttps://doi.org/10.1016/0167-6423(95)00033-xopenalex-snapshot
Functional algorithm design
inferred← citeshttps://doi.org/10.1016/0167-6423(96)00008-1openalex-snapshot
A taxonomy of sublinear multiple keyword pattern matching algorithms
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90111-6openalex-snapshot
Mixed computation: potential applications and problems for study
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90037-gopenalex-snapshot
Program development in constructive type theory
inferred← citeshttps://doi.org/10.1016/0306-4573(84)90042-6openalex-snapshot
Problem solving techniques for the design of algorithms
inferred← citeshttps://doi.org/10.1016/0898-1221(81)90058-4openalex-snapshot
A strange sorting method inspired by formal differentiation
inferred← citeshttps://doi.org/10.1016/b978-0-934613-12-5.50007-0openalex-snapshot
Top-Down Synthesis of Divide-and-Conquer Algorithms
inferred← citeshttps://doi.org/10.1016/b978-0-934613-12-5.50026-4openalex-snapshot
IMPLEMENTING SPECIFICATION FREEDOMS**This research was supported by Defense Advanced Research Projects Agency contract DAHC15 72 C0308. Views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official opinion or policy of DARPA,…
inferred← citeshttps://doi.org/10.1016/b978-0-934613-12-5.50040-9openalex-snapshot
Program Abstraction and Instantiation An earlier version of this paper was presented at the Fifth Conference on Software Engineering, San Diego, Calif., March 1981.
inferred← citeshttps://doi.org/10.1016/b978-0-934613-38-5.50011-8openalex-snapshot
Semi-Applicative Programming: Examples of Context Free Recognizers
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50015-1openalex-snapshot
The Automation of Proof by Mathematical Induction
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.08.003openalex-snapshot
Constructing Induction Rules for Deductive Synthesis Proofs
inferred← citeshttps://doi.org/10.1016/j.jlamp.2017.09.003openalex-snapshot
Programming from metaphorisms
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.1016/s0004-3702(78)80016-2openalex-snapshot
On program synthesis knowledge
inferred← citeshttps://doi.org/10.1016/s0020-7373(82)80018-7openalex-snapshot
Problem solving as a basis for program synthesis: design and experimentation of the BIS system
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80040-9openalex-snapshot
Deductive synthesis of sorting programs
inferred← citeshttps://doi.org/10.1017/s0956796800000964openalex-snapshot
How powerful are folding/unfolding transformations?
inferred← citeshttps://doi.org/10.1017/s095679680000188xopenalex-snapshot
New dimensions in heap profiling
inferred← citeshttps://doi.org/10.1017/s0956796800020049openalex-snapshot
Retrieving reusable software components by polymorphic type
inferred← citeshttps://doi.org/10.1080/0899340940050107openalex-snapshot
An Expanded Taxonomy of Sorting Algorithms
inferred← citeshttps://doi.org/10.1093/combul/21.4.22openalex-snapshot
Program transformation: An introduction and survey
inferred← citeshttps://doi.org/10.1093/comjnl/30.6.512openalex-snapshot
Derivation of Sorting Algorithms from a Specification
inferred← citeshttps://doi.org/10.1093/jigpal/jzi003openalex-snapshot
An Application of Logic Engineering
inferred← citeshttps://doi.org/10.1109/cgo.2005.24openalex-snapshot
Optimizing Sorting with Genetic Algorithms
inferred← citeshttps://doi.org/10.1109/csde56538.2022.10089247openalex-snapshot
A Comparative Analysis of Swarm Intelligent Algorithms
inferred← citeshttps://doi.org/10.1109/icfem.2000.873816openalex-snapshot
Filter promotion transformation strategies for deriving efficient programs from Z specifications
inferred← citeshttps://doi.org/10.1109/icis.2008.34openalex-snapshot
Generating Algorithms plus Loop Invariants by Formal Derivation
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370499openalex-snapshot
Optimizing Sorting with Machine Learning Algorithms
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/sisy.2012.6339532openalex-snapshot
Discovery of inductive algorithms through automated reasoning: A case study on sorting
inferred← citeshttps://doi.org/10.1109/synasc.2011.23openalex-snapshot
Proof Techniques for Synthesis of Sorting Algorithms
inferred← citeshttps://doi.org/10.1109/tencon.1989.176921openalex-snapshot
Improving list comprehension database queries
inferred← citeshttps://doi.org/10.1139/f92-280openalex-snapshot
Genetic Population Structure of American Plaice (Hippoglossoides platessoides) from the Gulf of St. Lawrence, Canada
inferred← citeshttps://doi.org/10.1145/1706356.1706372openalex-snapshot
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
inferred← citeshttps://doi.org/10.1145/1780.1781openalex-snapshot
The promotion and accumulation strategies in transformational programming
inferred← citeshttps://doi.org/10.1145/182.358444openalex-snapshot
A constructive approach to the design of algorithms and their data structures
inferred← citeshttps://doi.org/10.1145/227699.227716openalex-snapshot
Total correctness by local improvement in the transformation of functional programs
inferred← citeshttps://doi.org/10.1145/2465.214925openalex-snapshot
An inverted taxonomy of sorting algorithms
inferred← citeshttps://doi.org/10.1145/3183519.3183528openalex-snapshot
Cross-language optimizations in big data systems
inferred← citeshttps://doi.org/10.1145/357153.357154openalex-snapshot
A System for Assisting Program Transformation
inferred← citeshttps://doi.org/10.1145/357162.357171openalex-snapshot
Some Techniques for Recursion Removal from Recursive Functions
inferred← citeshttps://doi.org/10.1145/3579027.3608989openalex-snapshot
True Variability Shining Through Taxonomy Mining
inferred← citeshttps://doi.org/10.1145/3916.3986openalex-snapshot
Program abstraction and instantiation
inferred← citeshttps://doi.org/10.1145/567067.567071openalex-snapshot
Derivation of efficient DAG marking algorithms
inferred← citeshttps://doi.org/10.1145/567532.567536openalex-snapshot
Program improvement by internal specialization
inferred← citeshttps://doi.org/10.1145/800055.802044openalex-snapshot
A powerful strategy for deriving efficient programs by transformation
inferred← citeshttps://doi.org/10.1145/800223.806766openalex-snapshot
The semantic elegance of applicative languages
inferred← citeshttps://doi.org/10.1145/800228.806947openalex-snapshot
Self-redefinition as a program manipulation strategy
inferred← citeshttps://doi.org/10.1145/99370.99383openalex-snapshot
Retrieving re-usable software components by polymorphic type
inferred← citeshttps://doi.org/10.1177/007327531305100302openalex-snapshot
Gender, Race and Science in Twentieth-Century India: E. K. Janaki Ammal and the History of Science
inferred← citeshttps://doi.org/10.14569/ijacsa.2013.040917openalex-snapshot
The Bitwise Operations Related to a Fast Sorting Algorithm
inferred← citeshttps://doi.org/10.21236/ada125211openalex-snapshot
Problem Solving Techniques for the Design of Algorithms
inferred← citeshttps://doi.org/10.2478/pbj-2014-0032openalex-snapshot
Second record of the rare species Phacus bętkowskii (Euglenophyceae)
inferred← citeshttps://doi.org/10.3109/00365519409095210openalex-snapshot
Measurement of ionized magnesium with neutral carrier based ISE's. Progress and results with the AVL 988-4 magnesium analyzer
inferred← citeshttps://doi.org/10.3990/1.9789090048161openalex-snapshot
Law and Order in Algorithmics
inferred← citeshttps://doi.org/10.4204/eptcs.320.1openalex-snapshot
A Historical Account of My Early Research Interests
inferred← citeshttps://doi.org/10.48550/arxiv.1810.02254openalex-snapshot
Deriving sorting algorithms via abductive logic program transformation
inferred← citeshttps://doi.org/10.5120/21847-5155openalex-snapshot
MQ Sort an Innovative Algorithm using Quick Sort and Merge Sort
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.