On the public citation graph

Stable in situ sorting and minimum data movement

0 signed · 22 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/3-540-51542-9_46openalex-snapshot
Sorting with minimum data movement (preliminary draft)
inferredcites →https://doi.org/10.1007/bf01937353openalex-snapshot
A generalized, one-way, stackless quicksort
inferredcites →https://doi.org/10.1007/bfb0016252openalex-snapshot
Quicksort without a stack
inferredcites →https://doi.org/10.1016/0020-0190(87)90202-xopenalex-snapshot
Stable unmerging in linear time and constant space
inferredcites →https://doi.org/10.1016/0196-6774(87)90050-2openalex-snapshot
Simplified stable merging tasks
inferredcites →https://doi.org/10.1093/comjnl/2.1.47openalex-snapshot
Transposing Matrices in a Digital Computer
inferredcites →https://doi.org/10.1137/0206025openalex-snapshot
Stable Sorting and Merging with Optimal Space and Time Bounds
inferredcites →https://doi.org/10.1145/366622.366644openalex-snapshot
Algorithm 64: Quicksort
inferredcites →https://doi.org/10.1145/366622.366647openalex-snapshot
Algorithm 65: find

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-45995-2_43openalex-snapshot
In-Place Planar Convex Hull Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_44openalex-snapshot
The Level Ancestor Problem Simplified
inferred← citeshttps://doi.org/10.1007/3-540-54967-6_74openalex-snapshot
Fast stable in-place sorting with O(n) data moves
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_37openalex-snapshot
Sorting multisets stably in minimum space
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_20openalex-snapshot
Space-Efficient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-642-00826-9_12openalex-snapshot
Constant-Working-Space Algorithms for Image Processing
inferred← citeshttps://doi.org/10.1007/bf01178508openalex-snapshot
Sorting multisets stably in minimum space
inferred← citeshttps://doi.org/10.1007/bf01940644openalex-snapshot
Fast stable in-place sorting withO(n) data moves
inferred← citeshttps://doi.org/10.1007/bf01994842openalex-snapshot
Stable minimum space partitioning in linear time
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90045-eopenalex-snapshot
Sorting with minimum data movement
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.11.005openalex-snapshot
Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.05.004openalex-snapshot
Space-efficient planar convex hull algorithms
inferred← citeshttps://doi.org/10.1145/3168005openalex-snapshot
Selection and Sorting in the “Restore” Model
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.