On the public citation graph
Usort: An efficient hybrid of Distributive Partitioning Sorting
0 signed · 19 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.1007/bf02243418openalex-snapshot
Average time behavior of distributive sorting algorithms
inferredcites →https://doi.org/10.1016/0020-0190(78)90028-5openalex-snapshot
Sorting by distributive partitioning
inferredcites →https://doi.org/10.1016/0020-0190(79)90013-9openalex-snapshot
The practical significance of distributive partitioning sort
inferredcites →https://doi.org/10.1016/0020-0190(79)90014-0openalex-snapshot
The practical significance of D.P. sort revisited
inferredcites →https://doi.org/10.1016/0020-0190(80)90023-xopenalex-snapshot
Selection by distributive partitioning
inferredcites →https://doi.org/10.1016/0020-0190(80)90069-1openalex-snapshot
A fast sorting algorithm, a hybrid of distributive and merge sorting
inferredcites →https://doi.org/10.1016/0020-0190(80)90143-xopenalex-snapshot
The design and analysis of a new hybrid sorting algorithm
inferredcites →https://doi.org/10.1145/359619.359631openalex-snapshot
Implementing Quicksort programs
inferredcites →https://doi.org/10.1145/360860.360870openalex-snapshot
Some performance tests of ?quicksort? and descendants
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf01933729openalex-snapshot
Sorting in parallel by double distributive partitioning
inferred← citeshttps://doi.org/10.1007/bf01934510openalex-snapshot
Some performance tests of convex hull algorithms
inferred← citeshttps://doi.org/10.1007/bf02017340openalex-snapshot
The multilevel principle applied to sorting
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90137-7openalex-snapshot
A space efficient distributive sort
inferred← citeshttps://doi.org/10.1016/0196-6774(85)90024-0openalex-snapshot
Two levels are as good as any
inferred← citeshttps://doi.org/10.1080/00207168408803412openalex-snapshot
Parallel distributive partitioned sorting methods
inferred← citeshttps://doi.org/10.1093/comjnl/35.2.177openalex-snapshot
An Internal Hybrid Sort Algorithm Revisited
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.