On the public citation graph
Design and implementation of an efficient integer count sort in CUDA GPUs
0 signed · 23 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-540-87744-8_21openalex-snapshot
A Practical Quicksort Algorithm for Graphics Processors
inferredcites →https://doi.org/10.1016/j.jpdc.2008.05.012openalex-snapshot
Fast parallel GPU-sorting using a hybrid algorithm
inferredcites →https://doi.org/10.1109/ipdps.2006.1639284openalex-snapshot
GPU-ABiSort: optimal parallel sorting on stream architectures
inferredcites →https://doi.org/10.1109/ipdps.2009.5161005openalex-snapshot
Designing efficient sorting algorithms for manycore GPUs
inferredcites →https://doi.org/10.1145/1066157.1066227openalex-snapshot
Fast and approximate stream mining of quantiles and frequencies using graphics processors
inferredcites →https://doi.org/10.1145/1854273.1854344openalex-snapshot
Revisiting sorting for GPGPU stream architectures
inferredcites →https://doi.org/10.1184/r1/6608579openalex-snapshot
Prefix sums and their applications
inferredcites →https://doi.org/10.14778/1454159.1454171openalex-snapshot
Efficient implementation of sorting on multi-core SIMD CPU architecture
inferredcites →https://doi.org/10.5555/1898953.1898980openalex-snapshot
GPU-ABiSort: optimal parallel sorting on stream architectures
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.2846openalex-snapshot
A profiling based task scheduling approach for multicore network processors
inferred← citeshttps://doi.org/10.1016/j.cmpb.2012.07.005openalex-snapshot
Fast box-counting algorithm on GPU
inferred← citeshttps://doi.org/10.1016/j.robot.2015.06.005openalex-snapshot
Rapid motion planning algorithm for optimal UVMS interventions in semi-structured environments using GPUs
inferred← citeshttps://doi.org/10.1109/icbdaci.2017.8070874openalex-snapshot
Comprehensive comparison of parallel sorting techniques, architectures and behaviors which support for distributed environments
inferred← citeshttps://doi.org/10.1109/ipdpsw.2014.72openalex-snapshot
A Novel Computational Model for GPUs with Application to I/O Optimal Sorting Algorithms
inferred← citeshttps://doi.org/10.1142/s0129626426500052openalex-snapshot
Efficient GPU-Implementation of a Sorting Algorithm Based on Histogram Computation and Prefix-Sums
inferred← citeshttps://doi.org/10.1145/2502323.2502325openalex-snapshot
Counting and occurrence sort for GPUs using an embedded language
inferred← citeshttps://doi.org/10.1145/3472456.3472486openalex-snapshot
Efficient GPU-Implementation for Integer Sorting Based on Histogram and Prefix-Sums
inferred← citeshttps://doi.org/10.1145/3635035.3635051openalex-snapshot
Efficient GPU-Implementation of H-P Sort Based on Improved Histogram Computation
inferred← citeshttps://doi.org/10.1186/s40537-020-00376-9openalex-snapshot
Comparison of sort algorithms in Hadoop and PCJ
inferred← citeshttps://doi.org/10.15803/ijnc.5.1_26openalex-snapshot
A Novel Computational Model for GPUs with Applications to Efficient Algorithms
inferred← citeshttps://doi.org/10.3390/a7030295openalex-snapshot
Solving the Examination Timetabling Problem in GPUs
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.