Author:
Ehlers Thorsten,Müller Mike
Publisher
Springer International Publishing
Reference11 articles.
1. Baddar, S.W.A., Batcher, K.E.: A 12-step sorting network for 22 elements. Technical report 2008-05, Department of Computer Science, Kent State University (2008)
2. Baddar, S.W.A., Batcher, K.E.: An 11-step sorting network for 18 elements. Parallel Process. Lett. 19(1), 97–103 (2009)
3. Batcher, K.E.: Sorting networks and their applications. In: American Federation of Information Processing Societies: AFIPS Conference Proceedings: 1968 Spring Joint Computer Conference, Atlantic City, NJ, USA, 30 April–2 May 1968, AFIPS Conference Proceedings, vol. 32, pp. 307–314. Thomson Book Company, Washington D.C (1968)
4. Lecture Notes in Computer Science;D Bundala,2014
5. Codish, M., Cruz-Filipe, L., Schneider-Kamp, P.: The quest for optimal sorting networks: efficient generation of two-layer prefixes. CoRR, abs/1404.0948 (2014)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Exact Fused Dot Product Add Operators;2023 IEEE 30th Symposium on Computer Arithmetic (ARITH);2023-09-04
2. Engineering faster sorters for small sets of items;Software: Practice and Experience;2020-11-02
3. Improving performance of sorting small arrays on MIPS CPUs using bitonic sort and SIMD instructions;2019 27th Telecommunications Forum (TELFOR);2019-11
4. Sorting networks: To the end and back again;Journal of Computer and System Sciences;2019-09
5. An Improved Subsumption Testing Algorithm for the Optimal-Size Sorting Network Problem;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2019