On the public citation graph

On parallel integer sorting

https://doi.org/10.1007/bf01178563
0 signed · 48 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/978-3-642-69672-5openalex-snapshot
Data Structures and Algorithms 1
inferredcites →https://doi.org/10.1007/bf01840376openalex-snapshot
Efficient parallel algorithms for graph problems
inferredcites →https://doi.org/10.1007/bf02579338openalex-snapshot
Sorting inc logn parallel steps
inferredcites →https://doi.org/10.1007/bfb0105127openalex-snapshot
Finding the maximum, merging and sorting in a parallel computation model
inferredcites →https://doi.org/10.1016/0020-0190(88)90186-xopenalex-snapshot
An optimally efficient selection algorithm
inferredcites →https://doi.org/10.1016/0020-0190(89)90066-5openalex-snapshot
Hybridsort revisited and parallelized
inferredcites →https://doi.org/10.1016/0020-0190(89)90120-8openalex-snapshot
Parallel iterated bucket sort
inferredcites →https://doi.org/10.1016/0022-0000(79)90045-xopenalex-snapshot
Fast probabilistic algorithms for hamiltonian circuits and matchings
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/0890-5401(87)90062-9openalex-snapshot
Towards optimal parallel bucket sorting
inferredcites →https://doi.org/10.1016/0890-5401(89)90036-9openalex-snapshot
Faster optimal parallel prefix sums and list ranking
inferredcites →https://doi.org/10.1016/0890-5401(91)90031-vopenalex-snapshot
Improved deterministic parallel integer sorting
inferredcites →https://doi.org/10.1137/0214030openalex-snapshot
Probabilistic Parallel Algorithms for Sorting and Selection
inferredcites →https://doi.org/10.1137/0217049openalex-snapshot
Parallel Merge Sort
inferredcites →https://doi.org/10.1137/0218041openalex-snapshot
Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
inferredcites →https://doi.org/10.1145/321341.321349openalex-snapshot
Internal Sorting by Radix Plus Sifting
inferredcites →https://doi.org/10.1145/322217.322232openalex-snapshot
Parallel Prefix Computation
inferredcites →https://doi.org/10.1145/7531.7532openalex-snapshot
A logarithmic time sort for linear size networks
inferredcites →https://doi.org/10.1145/800061.808726openalex-snapshot
An 0(n log n) sorting network
inferredcites →https://doi.org/10.1214/aoms/1177729330openalex-snapshot
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
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.1006/inco.1997.2632openalex-snapshot
Improved Parallel Integer Sorting without Concurrent Writing
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-53487-3_42openalex-snapshot
The power of collision: Randomized parallel algorithms for chaining and integer sorting
inferred← citeshttps://doi.org/10.1007/978-1-4684-5511-3_11openalex-snapshot
Randomized Parallel Computation
inferred← citeshttps://doi.org/10.1007/bf01185406openalex-snapshot
Parallel integer sorting using small operations
inferred← citeshttps://doi.org/10.1007/bf01758753openalex-snapshot
Optimal randomized parallel algorithms for computational geometry
inferred← citeshttps://doi.org/10.1007/bf03036466openalex-snapshot
Parallel integer sorting and simulation amongst CRCW models
inferred← citeshttps://doi.org/10.1007/bfb0030847openalex-snapshot
Conservative algorithms for parallel and sequential integer sorting
inferred← citeshttps://doi.org/10.1007/bfb0057950openalex-snapshot
Parallel solutions of Simple Indexed Recurrence equations
inferred← citeshttps://doi.org/10.1007/s11227-018-2623-zopenalex-snapshot
A new constant-time parallel algorithm for merging
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90097-hopenalex-snapshot
Improved nonconservative sequential and parallel integer sorting
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.02.007openalex-snapshot
Probabilistic integer sorting
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.09.003openalex-snapshot
An improved reliability bound of a probabilistic parallel integer sorting algorithm
inferred← citeshttps://doi.org/10.1016/j.jpdc.2003.11.003openalex-snapshot
Efficient parallel solutions of linear algebraic circuits
inferred← citeshttps://doi.org/10.1023/a:1015365901501openalex-snapshot
Parallel Self-Index Integer Sorting
inferred← citeshttps://doi.org/10.1109/71.308536openalex-snapshot
Efficient EREW PRAM algorithms for parentheses-matching
inferred← citeshttps://doi.org/10.1109/71.899937openalex-snapshot
Parallel solutions of simple indexed recurrence equations
inferred← citeshttps://doi.org/10.1109/ipps.1995.395934openalex-snapshot
A note on reducing parallel model simulations to integer sorting
inferred← citeshttps://doi.org/10.1109/iscc.2008.4625708openalex-snapshot
Efficient sorting algorithms for the cell broadband engine
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366877openalex-snapshot
Using difficulty of prediction to decrease computation: fast sort, priority queue and convex hull on entropy bounded inputs
inferred← citeshttps://doi.org/10.1137/s0097539799352449openalex-snapshot
Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs
inferred← citeshttps://doi.org/10.1142/s0129054105002899openalex-snapshot
RANDOMIZED SORTING ON THE POPS NETWORK
inferred← citeshttps://doi.org/10.1142/s0129054122500071openalex-snapshot
More Efficient Parallel Integer Sorting
inferred← citeshttps://doi.org/10.1145/2755573.2755597openalex-snapshot
A Top-Down Parallel Semisort
inferred← citeshttps://doi.org/10.2478/squa-2013-0003openalex-snapshot
Lightning-Caused and Human-Induced Forest Fires as Evidenced By Pteridium Spores in Selected Quaternary Records from Poland
inferred← citeshttps://doi.org/10.48550/arxiv.1204.6508openalex-snapshot
Efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model
inferred← citeshttps://doi.org/10.48550/arxiv.2004.12532openalex-snapshot
In-Place Parallel-Partition Algorithms using Exclusive-Read-and-Write Memory
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.