Author:
Elmasry Amr,Katajainen Jyrki,Stenmark Max
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Biggar, P., Nash, N., Williams, K., Gregg, D.: An Experimental Study of Sorting and Branch Prediction. ACM J. Exp. Algorithmics 12, Article 1.8 (2008)
2. Lecture Notes in Computer Science;G.S. Brodal,2005
3. Lecture Notes in Computer Science;G.S. Brodal,2006
4. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)
5. Lecture Notes in Computer Science;A. Elmasry,2012
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Parallel Multi-Deque Partition Dual-Deque Merge sorting algorithm using OpenMP;Scientific Reports;2023-04-19
2. Improving Quicksort Performance by Optimizing Branch Prediction;2022 IEEE Asia-Pacific Conference on Computer Science and Data Engineering (CSDE);2022-12-18
3. Engineering In-place (Shared-memory) Sorting Algorithms;ACM Transactions on Parallel Computing;2022-01-31
4. Origami;Proceedings of the VLDB Endowment;2021-10
5. Engineering faster sorters for small sets of items;Software: Practice and Experience;2020-11-02