On the public citation graph

Sorting multisets and vectors in-place

0 signed · 31 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.1007/3-540-09526-8_52openalex-snapshot
The complexity of lexicographic sorting and searching
inferredcites →https://doi.org/10.1007/bfb0016255openalex-snapshot
Refined bounds on the complexity of sorting and selection in d - dimensional space
inferredcites →https://doi.org/10.1016/0304-3975(80)90057-2openalex-snapshot
Determining the mode
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.1137/0215068openalex-snapshot
Heaps on Heaps
inferredcites →https://doi.org/10.1145/1008620.1008624openalex-snapshot
Algorithms on vector sets
inferredcites →https://doi.org/10.2307/2283757openalex-snapshot
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
inferredcites →https://doi.org/10.5555/320176.320218openalex-snapshot
Suffix arrays: a new method for on-line string searches

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11523468_8openalex-snapshot
Optimal In-place Sorting of Vectors and Records
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-55706-7_37openalex-snapshot
Sorting multisets stably in minimum space
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_238openalex-snapshot
A general lower bound on the I/O-complexity of comparison-based algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-73437-6_5openalex-snapshot
On Demand String Sorting over Unbounded Alphabets
inferred← citeshttps://doi.org/10.1007/978-3-540-74128-2_5openalex-snapshot
Real-Time Model Checking on Secondary Storage
inferred← citeshttps://doi.org/10.1007/bf01178508openalex-snapshot
Sorting multisets stably in minimum space
inferred← citeshttps://doi.org/10.1007/bf01940644openalex-snapshot
Fast stable in-place sorting withO(n) data moves
inferred← citeshttps://doi.org/10.1007/bf01994842openalex-snapshot
Stable minimum space partitioning in linear time
inferred← citeshttps://doi.org/10.1007/bfb0054380openalex-snapshot
Distribution-sensitive algorithms
inferred← citeshttps://doi.org/10.1016/b978-0-12-372512-7.00020-1openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/j.jda.2011.01.003openalex-snapshot
Tight bounds for online stable sorting
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.001openalex-snapshot
On demand string sorting over unbounded alphabets
inferred← citeshttps://doi.org/10.1109/iwqos49365.2020.9212844openalex-snapshot
Supporting Multi-dimensional and Arbitrary Numbers of Ranks for Software Packet Scheduling
inferred← citeshttps://doi.org/10.1109/sequen.1997.666927openalex-snapshot
Sequence sorting in secondary storage
inferred← citeshttps://doi.org/10.1137/1.9781611975062.2openalex-snapshot
Quicksort Is Optimal For Many Equal Keys
inferred← citeshttps://doi.org/10.1145/258533.258647openalex-snapshot
On sorting strings in external memory (extended abstract)
inferred← citeshttps://doi.org/10.46298/dmtcs.3381openalex-snapshot
Distribution-sensitive set multi-partitioning
inferred← citeshttps://doi.org/10.48550/arxiv.0902.0133openalex-snapshot
New Algorithms and Lower Bounds for Sequential-Access Data Compression
inferred← citeshttps://doi.org/10.48550/arxiv.1110.3381openalex-snapshot
Partial Data Compression and Text Indexing via Optimal Suffix Multi-Selection
inferred← citeshttps://doi.org/10.5555/314161.314321openalex-snapshot
Fast algorithms for sorting and searching strings
inferred← citeshttps://doi.org/10.7146/dpb.v21i407.6641openalex-snapshot
A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms
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.