On the public citation graph
Stable minimum space partitioning in linear time
0 signed · 42 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/3-540-19487-8_1openalex-snapshot
An implicit binomial queue with constant insertion time
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/978-3-642-58043-7_3openalex-snapshot
Backwards Analysis of Randomized Geometric Algorithms
inferredcites →https://doi.org/10.1007/bf01937353openalex-snapshot
A generalized, one-way, stackless quicksort
inferredcites →https://doi.org/10.1007/bf02017344openalex-snapshot
Stable in situ sorting and minimum data movement
inferredcites →https://doi.org/10.1007/bfb0028285openalex-snapshot
Sorting multisets and vectors in-place
inferredcites →https://doi.org/10.1016/0020-0190(87)90202-xopenalex-snapshot
Stable unmerging in linear time and constant space
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/11785293_34openalex-snapshot
In-Place Algorithms for Computing (Layers of) Maxima
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/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-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-540-31856-9_52openalex-snapshot
Sorting Stably, In-Place, with O(n log n) Comparisons and O(n) Moves
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-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/s00224-006-1311-1openalex-snapshot
Sorting Stably, in Place, with O(n log n) Comparisons and O(n) Moves
inferred← citeshttps://doi.org/10.1007/s00453-008-9193-zopenalex-snapshot
In-Place Algorithms for Computing (Layers of) Maxima
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.comgeo.2012.09.007openalex-snapshot
An in-place min–max priority search tree
inferred← citeshttps://doi.org/10.1016/j.dam.2019.05.012openalex-snapshot
Variations of largest rectangle recognition amidst a bichromatic point set
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.05.004openalex-snapshot
Space-efficient planar convex hull algorithms
inferred← citeshttps://doi.org/10.1088/1572-9494/ae6ccbopenalex-snapshot
Wick’s theorem for superoperators linear in bosonic operators and its applications
inferred← citeshttps://doi.org/10.1137/1.9781611975062.2openalex-snapshot
Quicksort Is Optimal For Many Equal Keys
inferred← citeshttps://doi.org/10.1145/3168005openalex-snapshot
Selection and Sorting in the “Restore” Model
inferred← citeshttps://doi.org/10.3390/a11120195openalex-snapshot
Convex-Hull Algorithms: Implementation, Testing, and Experimentation
inferred← citeshttps://doi.org/10.46298/dmtcs.3381openalex-snapshot
Distribution-sensitive set multi-partitioning
inferred← citeshttps://doi.org/10.48550/arxiv.1209.0572openalex-snapshot
In-place associative integer sorting
inferred← citeshttps://doi.org/10.48550/arxiv.1209.1942openalex-snapshot
Sorting distinct integer keys using in-place associative sort
inferred← citeshttps://doi.org/10.48550/arxiv.1209.3668openalex-snapshot
Improved in-place associative integer sorting
inferred← citeshttps://doi.org/10.48550/arxiv.1209.4714openalex-snapshot
Sorting distinct integers using improved in-place associative sort
inferred← citeshttps://doi.org/10.48550/arxiv.1210.1771openalex-snapshot
In-place associative permutation sort
inferred← citeshttps://doi.org/10.48550/arxiv.1307.2724openalex-snapshot
The technique of in-place associative sorting
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.