On the public citation graph
Analysis of the performance of the parallel quicksort method
0 signed · 21 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/bf00289467openalex-snapshot
The analysis of Quicksort programs
inferredcites →https://doi.org/10.1080/00207168208803323openalex-snapshot
The parallel quicksort algorithm part i–run time analysis
inferredcites →https://doi.org/10.1080/00207168208803331openalex-snapshot
The parallel quicksort algorithm part 2—simulation
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
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/cpe.4330030102openalex-snapshot
Sorting with near linear speed‐up on tightly coupled multiprocessors
inferred← citeshttps://doi.org/10.1016/0167-8191(92)90089-popenalex-snapshot
A parallel partition for enhanced parallel QuickSort
inferred← citeshttps://doi.org/10.1016/0167-8191(92)90114-mopenalex-snapshot
An efficient parallel sorting algorithm for shared memory multiprocessors
inferred← citeshttps://doi.org/10.1016/0167-8191(92)90126-ropenalex-snapshot
Parallel-architecture-directed program transformation
inferred← citeshttps://doi.org/10.1016/0743-7315(92)90075-xopenalex-snapshot
Parallel sorting by regular sampling
inferred← citeshttps://doi.org/10.1109/12.46289openalex-snapshot
Parallel Quicksort using fetch-and-add
inferred← citeshttps://doi.org/10.1109/12.9738openalex-snapshot
A benchmark parallel sort for shared memory multiprocessors
inferred← citeshttps://doi.org/10.1109/iccsn.2011.6014966openalex-snapshot
Array-indexed sorting algorithm for natural numbers
inferred← citeshttps://doi.org/10.1109/spdp.1991.218293openalex-snapshot
Parallel algorithms that solve problems by communication
inferred← citeshttps://doi.org/10.1145/130069.130085openalex-snapshot
Parallel Quicksort in hypercubes
inferred← citeshttps://doi.org/10.48550/arxiv.2005.12648openalex-snapshot
On the improvement of the in-place merge algorithm parallelization
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.