On the public citation graph

Sorting multisets stably in minimum space

0 signed · 43 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.1006/inco.1994.1050openalex-snapshot
Sorting Shuffled Monotone Sequences
inferredcites →https://doi.org/10.1007/3-540-19487-8_1openalex-snapshot
An implicit binomial queue with constant insertion time
inferredcites →https://doi.org/10.1007/3-540-19487-8_2openalex-snapshot
Implicit selection
inferredcites →https://doi.org/10.1007/3-540-54458-5_77openalex-snapshot
An optimal adaptive in-place sorting algorithm
inferredcites →https://doi.org/10.1007/bf00289147openalex-snapshot
Stable duplicate-key extraction with optimal time and space bounds
inferredcites →https://doi.org/10.1007/bf01937353openalex-snapshot
A generalized, one-way, stackless quicksort
inferredcites →https://doi.org/10.1007/bf01994842openalex-snapshot
Stable minimum space partitioning in linear time
inferredcites →https://doi.org/10.1007/bf02017344openalex-snapshot
Stable in situ sorting and minimum data movement
inferredcites →https://doi.org/10.1007/bfb0016252openalex-snapshot
Quicksort without a stack
inferredcites →https://doi.org/10.1007/bfb0028285openalex-snapshot
Sorting multisets and vectors in-place
inferredcites →https://doi.org/10.1016/0020-0190(82)90043-6openalex-snapshot
Sorting numbers in linear expected time and optimal extra space
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/0022-0000(86)90043-7openalex-snapshot
An implicit data structure supporting insertion, deletion, and search in Olog2n) time
inferredcites →https://doi.org/10.1016/0196-6774(87)90050-2openalex-snapshot
Simplified stable merging tasks
inferredcites →https://doi.org/10.1016/s0022-0000(73)80033-9openalex-snapshot
Time bounds for selection
inferredcites →https://doi.org/10.1051/ita/1993270402951openalex-snapshot
Space-efficient parallel merging
inferredcites →https://doi.org/10.1093/comjnl/35.6.643openalex-snapshot
Fast Stable Merging and Sorting in Constant Extra Space
inferredcites →https://doi.org/10.1109/tc.1985.5009387openalex-snapshot
Quicksort for Equal Keys
inferredcites →https://doi.org/10.1137/0205001openalex-snapshot
Sorting and Searching in Multisets
inferredcites →https://doi.org/10.1145/322063.322064openalex-snapshot
Stable Sorting in Asymptotically Optimal Time and Extra Space
inferredcites →https://doi.org/10.1145/42392.42403openalex-snapshot
Practical in-place merging
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.1007/11534273_14openalex-snapshot
Line-Segment Intersection Made In-Place
inferred← citeshttps://doi.org/10.1007/3-540-45471-3_42openalex-snapshot
A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset
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-540-75520-3_19openalex-snapshot
Radix Sorting with No Extra Space
inferred← citeshttps://doi.org/10.1007/978-3-540-89639-5_64openalex-snapshot
Linear Time Constant-Working Space Algorithm for Computing the Genus of a Digital Object
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/s00224-006-1311-1openalex-snapshot
Sorting Stably, in Place, with O(n log n) Comparisons and O(n) Moves
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.comgeo.2006.03.006openalex-snapshot
Space-efficient geometric divide-and-conquer algorithms
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.09.001openalex-snapshot
Line-segment intersection made in-place
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.06.012openalex-snapshot
Selection from read-only memory with limited workspace
inferred← citeshttps://doi.org/10.1111/rssc.12487openalex-snapshot
Likelihood-Free Parameter Estimation for Dynamic Queueing Networks: Case Study of Passenger Flow in an International Airport Terminal
inferred← citeshttps://doi.org/10.1137/1.9781611975062.2openalex-snapshot
Quicksort Is Optimal For Many Equal Keys
inferred← citeshttps://doi.org/10.1142/s0218654308001129openalex-snapshot
GENUS AND DIMENSION OF DIGITAL IMAGES AND THEIR TIME- AND SPACE-EFFICIENT COMPUTATION
inferred← citeshttps://doi.org/10.1145/3168005openalex-snapshot
Selection and Sorting in the “Restore” Model
inferred← citeshttps://doi.org/10.1145/3452938openalex-snapshot
Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls
inferred← citeshttps://doi.org/10.48550/arxiv.1209.0572openalex-snapshot
In-place associative integer sorting
inferred← citeshttps://doi.org/10.48550/arxiv.1209.3668openalex-snapshot
Improved in-place associative integer sorting
inferred← citeshttps://doi.org/10.48550/arxiv.1407.3342openalex-snapshot
Selection from read-only memory with limited workspace
inferred← citeshttps://doi.org/10.48550/arxiv.1804.02526openalex-snapshot
Likelihood-free parameter estimation for dynamic queueing networks: case study of passenger flow in an international airport terminal
inferred← citeshttps://doi.org/10.5204/thesis.eprints.180771openalex-snapshot
Dynamic queueing networks: Simulation, estimation and prediction
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.