Periodification scheme: constructing sorting networks with constant period

DOI10.1145/355483.355490MaRDI QIDQ2947000zbMATH OpenOpenAlexFDO

Authors Mirosław Kutyłowski, Krzysztof Loryś, B. Oesterdiekhoff, Rolf Wanka

Publication date 19 September 2015

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/355483.355490

Mathematics Subject Classification ID

Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Periodic multisorting comparator networks.
• The periodic balanced sorting network
• Faster merging networks with a small constant period
• scientific article; zbMATH DE number 1397393
• Periodic merging networks

Cited in

(9)

• Periodic comparator networks
• Fun-Sort -- or the chaos of unordered binary search
• A note on constructing binary heaps with periodic networks.
• Fast periodic correction networks
• Faster merging networks with a small constant period
• The periodic balanced sorting network
• scientific article; zbMATH DE number 1397393 (Why is no real title available?)
• Periodic multisorting comparator networks.
• Fast periodic correction networks.

This page was built for publication: Periodification scheme: constructing sorting networks with constant period

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947000)