A lower bound for sorting networks based on the shuffle permutation
From MaRDI portal
Publication:4311642
DOI10.1007/BF01184936zbMath0812.68069OpenAlexW4250527476MaRDI QIDQ4311642
Publication date: 30 October 1994
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01184936
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
A super-logarithmic lower bound for hypercubic sorting networks ⋮ Optimal parallel selection in sorted matrices ⋮ Deterministic sorting in nearly logarithmic time on the hypercube and related computers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved sorting networks with O(log N) depth
- Sorting in \(c \log n\) parallel steps
- A unified theory of interconnection network structure
- Interpolation between bases and the shuffle exchange network
- Rearrangeability of multistage shuffle/exchange networks
- Notes on Shuffle/Exchange-Type Switching Networks
- Theoretical Aspects of VLSI Pin Limitations
- A Lower Bound on the Size of Shellsort Sorting Networks
This page was built for publication: A lower bound for sorting networks based on the shuffle permutation
