The following pages link to Optimal-depth sorting networks (Q340576):
Displaying 16 items.
- Bitonic sorters of minimal depth (Q533870) (← links)
- Improved sorting networks with O(log N) depth (Q582098) (← links)
- Improved layout of the odd-even sorting network (Q839103) (← links)
- Sorting nine inputs requires twenty-five comparisons (Q899586) (← links)
- Sorting and counting networks of arbitrary width and small depth (Q1601745) (← links)
- Formally proving size optimality of sorting networks (Q1694569) (← links)
- Sorting-based selection algorithms for hypercubic networks (Q1969955) (← links)
- Sorting networks: to the end and back again (Q2424684) (← links)
- Optimizing sorting algorithms by using sorting networks (Q2628305) (← links)
- New Bounds on Optimal Sorting Networks (Q3195693) (← links)
- Sorting with Complete Networks of Stacks (Q3597888) (← links)
- (Q3771637) (← links)
- Lower bounds for sorting networks (Q4234092) (← links)
- The Half Cleaner Lemma: Constructing Efficient Interconnection Networks from Sorting Networks (Q5087836) (← links)
- Practical Algorithms for Finding Extremal Sets (Q5266618) (← links)
- Optimal Sorting Networks (Q5404915) (← links)
