On the public citation graph

Conservative algorithms for parallel and sequential integer sorting

https://doi.org/10.1007/bfb0030847
0 signed · 29 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.1997.2632openalex-snapshot
Improved Parallel Integer Sorting without Concurrent Writing
inferredcites →https://doi.org/10.1007/3-540-53487-3_42openalex-snapshot
The power of collision: Randomized parallel algorithms for chaining and integer sorting
inferredcites →https://doi.org/10.1007/bf01178563openalex-snapshot
On parallel integer sorting
inferredcites →https://doi.org/10.1007/bf01759076openalex-snapshot
Deterministic parallel list ranking
inferredcites →https://doi.org/10.1016/0020-0190(90)90097-hopenalex-snapshot
Improved nonconservative sequential and parallel integer sorting
inferredcites →https://doi.org/10.1016/0304-3975(83)90023-3openalex-snapshot
Upper bounds for sorting integers on random access machines
inferredcites →https://doi.org/10.1016/0743-7315(89)90005-1openalex-snapshot
Parallel algorithms for computing linked list prefix
inferredcites →https://doi.org/10.1016/0890-5401(87)90062-9openalex-snapshot
Towards optimal parallel bucket sorting
inferredcites →https://doi.org/10.1016/0890-5401(91)90031-vopenalex-snapshot
Improved deterministic parallel integer sorting
inferredcites →https://doi.org/10.1109/tc.1973.5009159openalex-snapshot
A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
inferredcites →https://doi.org/10.1109/tc.1978.1675167openalex-snapshot
New Parallel-Sorting Schemes
inferredcites →https://doi.org/10.1137/0204030openalex-snapshot
Parallelism in Comparison Problems
inferredcites →https://doi.org/10.1137/0218041openalex-snapshot
Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
inferredcites →https://doi.org/10.1145/100216.100217openalex-snapshot
BLASTING through the information theoretic barrier with FUSION TREES
inferredcites →https://doi.org/10.1145/322217.322232openalex-snapshot
Parallel Prefix Computation

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.2001.3053openalex-snapshot
Improved Fast Integer Sorting in Linear Space
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_20openalex-snapshot
Fast Integer Sorting in Linear Space
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_45openalex-snapshot
Improving Parallel Computation with Fast Integer Sorting
inferred← citeshttps://doi.org/10.1007/978-3-319-19647-3_9openalex-snapshot
A Linear Time Algorithm for Ordered Partition
inferred← citeshttps://doi.org/10.1007/s00453-019-00626-0openalex-snapshot
Sorting Real Numbers in $$O\big (n\sqrt{\log n}\big )$$ Time and Linear Space
inferred← citeshttps://doi.org/10.1016/j.jalgor.2003.09.001openalex-snapshot
Deterministic sorting in O(nloglogn) time and linear space
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00560-7openalex-snapshot
Improving the efficiency of parallel minimum spanning tree algorithms
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181890openalex-snapshot
Integer sorting in O(n√(log log n)) expected time and linear space
inferred← citeshttps://doi.org/10.1142/s0129054122500071openalex-snapshot
More Efficient Parallel Integer Sorting
inferred← citeshttps://doi.org/10.1145/509907.509993openalex-snapshot
Deterministic sorting in O ( n log log n ) time and linear space
inferred← citeshttps://doi.org/10.29007/2s4gopenalex-snapshot
An NC Algorithm for Sorting Real Numbers in O(nlogn/√loglogn) Operations
inferred← citeshttps://doi.org/10.4236/ojapps.2019.95034openalex-snapshot
An NC Algorithm for Sorting Real Numbers in O(nlogn/√loglogn) Operations
inferred← citeshttps://doi.org/10.48550/arxiv.1801.00776openalex-snapshot
Sorting Real Numbers in $O(n\sqrt{\log n})$ Time and Linear Space
inferred← citeshttps://doi.org/10.5120/2929-3876openalex-snapshot
Implementation and Performance Analysis of Exponential Tree 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.