On the public citation graph

Stable duplicate-key extraction with optimal time and space bounds

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.
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(84)90112-1openalex-snapshot
A simple linear-time algorithm for in situ merging
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/0196-6774(87)90050-2openalex-snapshot
Simplified stable merging tasks
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.1137/0206025openalex-snapshot
Stable Sorting and Merging with Optimal Space and Time Bounds
inferredcites →https://doi.org/10.1145/308386.308458openalex-snapshot
Stable set and multiset operations in optimal time and space
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/3-540-55706-7_37openalex-snapshot
Sorting multisets stably in minimum space
inferred← citeshttps://doi.org/10.1007/978-0-585-27330-3_7openalex-snapshot
Time-Space Optimal Parallel Computation
inferred← citeshttps://doi.org/10.1007/bf01178508openalex-snapshot
Sorting multisets stably in minimum 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/0743-7315(92)90082-xopenalex-snapshot
Parallel methods for solving fundamental file rearrangement problems
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/12.88483openalex-snapshot
Time-space optimal parallel merging and sorting
inferred← citeshttps://doi.org/10.1109/parbse.1990.77137openalex-snapshot
Time-space optimal parallel set operations
inferred← citeshttps://doi.org/10.1137/1.9781611976489.9openalex-snapshot
Parallel In-Place Algorithms: Theory and Practice
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
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.