Merging almost sorted sequences yields a 24-sorter
详细信息 查看全文
- 作者：Thorsten Ehlers the@informatik.uni-kiel.de" class="auth_mail" title="E-mail the corresponding author
- 关键词：Parallel processing ; Sorting networks ; Theory of computation
- 刊名：Information Processing Letters
- 出版年：2017
- 出版时间：February 2017
- 年：2017
- 卷：118
- 期：Complete
- 页码：17-20
- 全文大小：224 K
文摘
- class="listitem" id="list_ls0010">
- class="label">•
An improved sorting network on 24 channels.
- class="label">•
Combination of automated prefix generation and SAT based approaches.
- class="label">•
Merging of two partially ordered sets.