Periodic comparator networks

DOI10.1016/S0304-3975(99)00281-9zbMath0946.68029MaRDI QIDQ1575741

B. Oesterdiekhoff

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

comparatorsortingshiftswitchpermutation routingmergingcompare-exchange operationperiodic network

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items (1)

Faster merging networks with a small constant period

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved sorting networks with O(log N) depth
• Parallel sorting on Cayley graphs
• Sorting in \(c \log n\) parallel steps
• Periodification scheme
• A Robust Sorting Network
• Tight Bounds on the Complexity of Parallel Sorting
• The periodic balanced sorting network
• On the sizes of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks

This page was built for publication: Periodic comparator networks