Periodic comparator networks
From MaRDI portal
Publication:1575741
DOI10.1016/S0304-3975(99)00281-9zbMath0946.68029MaRDI QIDQ1575741
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (1)
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