On the public citation graph

Stable Sorting and Merging with Optimal Space and Time Bounds

0 signed · 47 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.1016/0020-0190(74)90004-0openalex-snapshot
A stable minimum storage sorting algorithm
inferredcites →https://doi.org/10.1016/0304-3975(75)90019-5openalex-snapshot
A fast stable sorting algorithm with absolutely minimum storage

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118032886.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/spe.4380110604openalex-snapshot
A stable quicksort
inferred← citeshttps://doi.org/10.1006/jagm.1998.0935openalex-snapshot
Quadripartite Sort
inferred← citeshttps://doi.org/10.1007/11534273_14openalex-snapshot
Line-Segment Intersection Made In-Place
inferred← citeshttps://doi.org/10.1007/11611257_33openalex-snapshot
On Optimal and Efficient in Place Merging
inferred← citeshttps://doi.org/10.1007/11785293_10openalex-snapshot
Sorting by Merging or Merging by Sorting?
inferred← citeshttps://doi.org/10.1007/3-540-54967-6_74openalex-snapshot
Fast stable in-place sorting with O(n) data moves
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_127openalex-snapshot
Asymptotically efficient in-place merging
inferred← citeshttps://doi.org/10.1007/978-3-322-92105-5_6openalex-snapshot
Sortieralgorithmen
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_63openalex-snapshot
Stable Minimum Storage Merging by Symmetric Comparisons
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-79228-4_22openalex-snapshot
Ratio Based Stable In-Place Merging
inferred← citeshttps://doi.org/10.1007/bf00289147openalex-snapshot
Stable duplicate-key extraction with optimal time and space bounds
inferred← citeshttps://doi.org/10.1007/bf00996816openalex-snapshot
An efficient external sorting with minimal space requirement
inferred← citeshttps://doi.org/10.1007/bf01933160openalex-snapshot
Some simple in-place merging algorithms
inferred← citeshttps://doi.org/10.1007/bf01933727openalex-snapshot
Searchability in merging and implicit data structures
inferred← citeshttps://doi.org/10.1007/bf01937353openalex-snapshot
A generalized, one-way, stackless quicksort
inferred← citeshttps://doi.org/10.1007/bf01940644openalex-snapshot
Fast stable in-place sorting withO(n) data moves
inferred← citeshttps://doi.org/10.1007/bf02017344openalex-snapshot
Stable in situ sorting and minimum data movement
inferred← citeshttps://doi.org/10.1007/bfb0016253openalex-snapshot
Towards an efficient merging
inferred← citeshttps://doi.org/10.1007/bfb0036934openalex-snapshot
Searchability in merging and implicit data structures
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/0020-0190(81)90065-xopenalex-snapshot
On a stable minimum storage merging algorithm
inferred← citeshttps://doi.org/10.1016/0020-0190(84)90112-1openalex-snapshot
A simple linear-time algorithm for in situ merging
inferred← citeshttps://doi.org/10.1016/0020-0190(86)90026-8openalex-snapshot
Splitmerge—A fast stable merging algorithm
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90202-xopenalex-snapshot
Stable unmerging in linear time and constant space
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90108-topenalex-snapshot
Stable set and multiset operations in optimal time and space
inferred← citeshttps://doi.org/10.1016/0196-6774(87)90050-2openalex-snapshot
Simplified stable merging tasks
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90045-eopenalex-snapshot
Sorting with minimum data movement
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50011-4openalex-snapshot
Data Structures
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.procs.2010.12.172openalex-snapshot
A simple shuffle-based stable in-place merge algorithm
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00775-2openalex-snapshot
Optimizing stable in-place merging
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00162-5openalex-snapshot
Asymptotically efficient in-place merging
inferred← citeshttps://doi.org/10.1093/comjnl/35.6.643openalex-snapshot
Fast Stable Merging and Sorting in Constant Extra Space
inferred← citeshttps://doi.org/10.1109/icaccct.2016.7831730openalex-snapshot
Merge sort enhanced in place sorting algorithm
inferred← citeshttps://doi.org/10.1109/indicon.2015.7443165openalex-snapshot
A detailed experimental analysis of library sort algorithm
inferred← citeshttps://doi.org/10.1109/soac.1991.143874openalex-snapshot
k-way merging and k-ary sorts
inferred← citeshttps://doi.org/10.1109/tc.1985.5009387openalex-snapshot
Quicksort for Equal Keys
inferred← citeshttps://doi.org/10.1117/12.3061408openalex-snapshot
MSIEC: in-place merge sort leveraging equivalence classes
inferred← citeshttps://doi.org/10.1145/102868.102872openalex-snapshot
Minimal space, average linear time duplicate deletion
inferred← citeshttps://doi.org/10.1145/308386.308458openalex-snapshot
Stable set and multiset operations in optimal time and space
inferred← citeshttps://doi.org/10.1145/42392.42403openalex-snapshot
Practical in-place merging
inferred← citeshttps://doi.org/10.5391/jkiis.2010.20.3.428openalex-snapshot
An Efficient In-Place Block Rotation Algorithm and its Complexity Analysis
inferred← citeshttps://doi.org/10.5555/42040.42108openalex-snapshot
Practical in-place merging
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.