The following pages link to Optimal Sorting Networks (Q5404915):
Displaying 23 items.
- Optimal-depth sorting networks (Q340576) (← links)
- Merging almost sorted sequences yields a 24-sorter (Q344521) (← links)
- On the complexity of min-max sorting networks (Q454886) (← links)
- Improved sorting networks with O(log N) depth (Q582098) (← links)
- Constructing sorting networks from k-sorters (Q582119) (← links)
- Improved layout of the odd-even sorting network (Q839103) (← links)
- Synchronous counting and computational algorithm design (Q896024) (← links)
- Sorting nine inputs requires twenty-five comparisons (Q899586) (← links)
- Optimal conclusive sets for comparator networks (Q1008736) (← links)
- Sorting on PRAMs with reconfigurable buses (Q1198059) (← 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 out single-crossing preferences on networks (Q2341131) (← links)
- Combinatorial search in two and more rounds (Q2420609) (← 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)
- A Robust Sorting Network (Q3219771) (← links)
- Sorting with Complete Networks of Stacks (Q3597888) (← links)
- (Q3771637) (← links)
- The Half Cleaner Lemma: Constructing Efficient Interconnection Networks from Sorting Networks (Q5087836) (← links)
- Applying Sorting Networks to Synthesize Optimized Sorting Libraries (Q5743589) (← links)
