On the public citation graph
Quicksort without a stack
0 signed · 13 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.1145/359619.359631openalex-snapshot
Implementing Quicksort programs
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-46521-9_13openalex-snapshot
QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms
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-030-59758-0openalex-snapshot
Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1007/bf01178508openalex-snapshot
Sorting multisets stably in minimum space
inferred← citeshttps://doi.org/10.1007/bf01994842openalex-snapshot
Stable minimum space partitioning in linear time
inferred← citeshttps://doi.org/10.1007/bf02017344openalex-snapshot
Stable in situ sorting and minimum data movement
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50014-xopenalex-snapshot
Average-Case Analysis of Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00208-0openalex-snapshot
An asymptotic theory for Cauchy–Euler differential equations with applications to the analysis of algorithms
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00288-2openalex-snapshot
QuickHeapsort, an efficient mix of classical sorting algorithms
inferred← citeshttps://doi.org/10.1145/3505286openalex-snapshot
Engineering In-place (Shared-memory) Sorting Algorithms
inferred← citeshttps://doi.org/10.46298/dmtcs.3381openalex-snapshot
Distribution-sensitive set multi-partitioning
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.