A lower bound for sorting networks based on the shuffle permutation
From MaRDI portal
Publication:4311642
Recommendations
Cites work
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- scientific article; zbMATH DE number 1256658 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- A Lower Bound on the Size of Shellsort Sorting Networks
- A unified theory of interconnection network structure
- Improved sorting networks with O(log N) depth
- Interpolation between bases and the shuffle exchange network
- Notes on Shuffle/Exchange-Type Switching Networks
- Rearrangeability of multistage shuffle/exchange networks
- Sorting in \(c \log n\) parallel steps
- Theoretical Aspects of VLSI Pin Limitations
Cited in
(7)- scientific article; zbMATH DE number 403954 (Why is no real title available?)
- A super-logarithmic lower bound for hypercubic sorting networks
- A quadratic lower bound for topswops
- Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)
- Optimal parallel selection in sorted matrices
- Deterministic sorting in nearly logarithmic time on the hypercube and related computers
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4311642)