On the public citation graph

K-way bitonic sort

0 signed · 51 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(85)90060-2openalex-snapshot
k-Fold bitonic sort on a mesh-connected parallel computer
inferredcites →https://doi.org/10.1016/s0019-9958(84)80022-4openalex-snapshot
The complexity of sorting on distributed systems
inferredcites →https://doi.org/10.1109/t-c.1971.223205openalex-snapshot
Parallel Processing with the Perfect Shuffle
inferredcites →https://doi.org/10.1109/t-c.1975.224157openalex-snapshot
Access and Alignment of Data in an Array Processor
inferredcites →https://doi.org/10.1109/tc.1976.1674718openalex-snapshot
Implementation of Permutation Functions in Illiac IV-Type Computers
inferredcites →https://doi.org/10.1109/tc.1979.1675216openalex-snapshot
Bitonic Sort on a Mesh-Connected Parallel Computer
inferredcites →https://doi.org/10.1109/tc.1980.1675626openalex-snapshot
On the Complexity of Sorting in Magnetic Bubble Memory Systems
inferredcites →https://doi.org/10.1109/tc.1983.1676178openalex-snapshot
The VLSI Complexity of Sorting
inferredcites →https://doi.org/10.1109/tc.1983.1676279openalex-snapshot
Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
inferredcites →https://doi.org/10.1109/tc.1984.1676356openalex-snapshot
External Sorting in VLSI
inferredcites →https://doi.org/10.1109/tc.1984.5009338openalex-snapshot
An Architecture for Bitonic Sorting with Optimal VLSI Performnance
inferredcites →https://doi.org/10.1109/tc.1984.5009340openalex-snapshot
VLSI Sorting with Reduced Hardware
inferredcites →https://doi.org/10.1109/tc.1985.5009391openalex-snapshot
Parallel Sorting with Serial Memories
inferredcites →https://doi.org/10.1109/tc.1986.1676800openalex-snapshot
Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks
inferredcites →https://doi.org/10.1109/tse.1978.231484openalex-snapshot
Sorting on STAR
inferredcites →https://doi.org/10.1145/1468075.1468121openalex-snapshot
Sorting networks and their applications
inferredcites →https://doi.org/10.1145/358645.358660openalex-snapshot
The cube-connected cycles: a versatile network for parallel computation
inferredcites →https://doi.org/10.1145/359461.359481openalex-snapshot
Sorting on a mesh-connected parallel computer
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/978-1-4471-3182-3_5openalex-snapshot
Sorts of butterflies
inferred← citeshttps://doi.org/10.1007/978-3-540-30117-2_66openalex-snapshot
A Reconfigurable Recurrent Bitonic Sorting Network for Concurrently Accessible Data
inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_24openalex-snapshot
Optimal Conclusive Sets for Comparator Networks
inferred← citeshttps://doi.org/10.1007/bf00134013openalex-snapshot
Fault-tolerance in balanced sorting networks
inferred← citeshttps://doi.org/10.1007/bf02916597openalex-snapshot
Sloping-and-shaking
inferred← citeshttps://doi.org/10.1007/bf02917110openalex-snapshot
K-bitonic sort
inferred← citeshttps://doi.org/10.1007/s00224-010-9257-8openalex-snapshot
The Strongest Model of Computation Obeying 0-1 Principles
inferred← citeshttps://doi.org/10.1007/s10489-023-04837-5openalex-snapshot
Quantile estimation for encrypted data
inferred← citeshttps://doi.org/10.1016/j.sysarc.2004.11.005openalex-snapshot
A generalized fault-tolerant sorting algorithm on a product network
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.12.021openalex-snapshot
Optimal conclusive sets for comparator networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.04.024openalex-snapshot
Accelerating certain outputs of merging and sorting networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.01.006openalex-snapshot
Bitonic sorters of minimal depth
inferred← citeshttps://doi.org/10.1109/12.324563openalex-snapshot
Serial array time slot interchangers and optical implementations
inferred← citeshttps://doi.org/10.1109/71.640013openalex-snapshot
Generalized algorithm for parallel sorting on product networks
inferred← citeshttps://doi.org/10.1109/71.852399openalex-snapshot
Minimizing communication in the bitonic sort
inferred← citeshttps://doi.org/10.1109/92.238413openalex-snapshot
Design and analysis of defect tolerant hierarchical sorting networks
inferred← citeshttps://doi.org/10.1109/csci54926.2021.00334openalex-snapshot
Non-Blocking Technique for Parallel Algorithms with Global Barrier Synchronization
inferred← citeshttps://doi.org/10.1109/dac63849.2025.11133032openalex-snapshot
GSAcc: Accelerate 3D Gaussian Splatting via Depth Speculation and Gaussian-centric Rasterization
inferred← citeshttps://doi.org/10.1109/fmpc.1992.234892openalex-snapshot
A modulo merge sorting network
inferred← citeshttps://doi.org/10.1109/icacte.2008.102openalex-snapshot
An Improved Parallel Sorting Algorithm for Odd Sequence
inferred← citeshttps://doi.org/10.1109/icpp.1993.23openalex-snapshot
A Generalized Bitonic Sorting Network
inferred← citeshttps://doi.org/10.1109/icpp.1994.137openalex-snapshot
On Sorting Multiple Bitonic Sequences
inferred← citeshttps://doi.org/10.1109/icwsi.1992.171816openalex-snapshot
Design and analysis of defect tolerant hierarchical sorting networks
inferred← citeshttps://doi.org/10.1109/iscas.2001.922292openalex-snapshot
A hardware design approach for merge-sorting network
inferred← citeshttps://doi.org/10.1109/iscas.2007.378475openalex-snapshot
Area and Throughput Aware Comparator Networks Optimization for Parallel Data Processing on FPGA
inferred← citeshttps://doi.org/10.1109/iscas.2009.5118240openalex-snapshot
Sorting binary numbers in hardware - A novel algorithm and its implementation
inferred← citeshttps://doi.org/10.1109/pact.2007.12openalex-snapshot
AA-Sort: A New Parallel Sorting Algorithm for Multi-Core SIMD Processors
inferred← citeshttps://doi.org/10.1109/pact.2007.4336211openalex-snapshot
AA-Sort: A New Parallel Sorting Algorithm for Multi-Core SIMD Processors
inferred← citeshttps://doi.org/10.1109/tc.2012.108openalex-snapshot
Modular Design of High-Throughput, Low-Latency Sorting Units
inferred← citeshttps://doi.org/10.14778/1454159.1454171openalex-snapshot
Efficient implementation of sorting on multi-core SIMD CPU architecture
inferred← citeshttps://doi.org/10.5120/19890-1930openalex-snapshot
Bitonic Sorting Algorithm: A Review
inferred← citeshttps://doi.org/10.7936/k7q23xfkopenalex-snapshot
Sorting as a Streaming Application Executing on Chip Multiprocessors
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.