Engineering faster sorters for small sets of items-Reference-Cited by-同舟云学术

Engineering faster sorters for small sets of items

Published:2020-11-02 Issue:5 Volume:51 Page:965-1004
ISSN:0038-0644
Container-title:Software: Practice and Experience
language:en
Short-container-title:Softw Pract Exper

Author:

Bingmann Timo¹^ORCID,Marianczuk Jasper¹,Sanders Peter¹

Affiliation:

1. Institute of Theoretical Informatics Karlsruhe Institute of Technology Karlsruhe Germany

Publisher

Wiley

Subject

Software

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/spe.2922

Reference37 articles.

1. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

2. A sorting problem;Bose RC;J ACM,1962

3. Optimizing sorting algorithms by using sorting networks;Codish M;Formal Aspects Comput,2017

4. SandersP WinkelS. Super scalar sample sort. Paper presented at: Proceedings of the 12th European Symposium on Algorithms (ESA). 3221 of LNCS;2004:784‐796; Springer New York NY.

5. AxtmannM WittS FerizovicD SandersP. In‐Place parallel super scalar samplesort (IPS4o). Paper presented at: Proceedings of the 25th European Symposium on Algorithms (ESA). 87 of LIPIcs;2017:9:1–9:14; Schloss Dagstuhl. preprint arXiv:1705.02257.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Faster sorting algorithms discovered using deep reinforcement learning;Nature;2023-06-07

2. Parallel Multi-Deque Partition Dual-Deque Merge sorting algorithm using OpenMP;Scientific Reports;2023-04-19

3. Vectorized and performance‐portable quicksort;Software: Practice and Experience;2022-08-24

4. Engineering In-place (Shared-memory) Sorting Algorithms;ACM Transactions on Parallel Computing;2022-01-31

5. The Karlsruhe Java Verification Suite;The Logic of Software. A Tasting Menu of Formal Methods;2022