Sample Sort
Sample Sort is a parallel sorting algorithm that partitions data by selecting a sample of elements, sorting them to determine approximate splitters, and then distributing the remaining elements into buckets based on these splitters, thereby enabling efficient load balancing across processors.
23
Publications
1.6K
Citations
80
Authors
42
Institutions
Publications per year
2017–2026
2
Parents
23
A Fully Automated Approach to Spike Sorting
Jason E. Chung, Jeremy F. Magland, Alex H. Barnett et al. · Neuron · 2017 · 552 citations · Full text
Nikolaj Leischner, Vitaly Osipov, Peter Sanders · 2010 · 106 citations
1–5 of 23
80
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 80
42
The University of Texas at Austin
Austin, United States
2 h-index
4 publications
64 citations
Karlsruhe Institute of Technology
Karlsruhe, Germany
2 h-index
7 publications
498 citations
Universidad de Londres
Mexico City, Mexico
1 h-index
2 publications
20 citations

Hong Kong Polytechnic University
Hong Kong, Hong Kong
1 h-index
4 publications
108 citations

Imperial College London
London, United Kingdom
1 h-index
2 publications
20 citations
University of California, Santa Barbara
Santa Barbara, United States
1 h-index
1 publications
99 citations
New York University
New York, United States
1 h-index
1 publications
25 citations
Institut National Polytechnique de Toulouse
Toulouse, France
1 h-index
2 publications
50 citations
1–8 of 42
2 publications · 52 citations
2
h-index
CAGEO · 1 publications · 10 citations
1
h-index
1 publications · 42 citations
1
h-index
TOPC · 1 publications · 25 citations
1
h-index
1 publications · 25 citations
1
h-index
1–5