Pages that link to "Item:Q3195693"
From MaRDI portal
The following pages link to New Bounds on Optimal Sorting Networks (Q3195693):
Displaying 22 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)
- Improved layout of the odd-even sorting network (Q839103) (← links)
- Sorting nine inputs requires twenty-five comparisons (Q899586) (← links)
- Bounds on the size of test sets for sorting and related networks (Q910215) (← links)
- A generalization of the 0-1 principle for sorting (Q1041721) (← links)
- Formally proving size optimality of sorting networks (Q1694569) (← links)
- New results in minimum-comparison sorting (Q1882531) (← 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)
- A theoretical look at \textsc{Electre Tri}-nB and related sorting models (Q2688878) (← links)
- The Complexity of Sorting with Networks of Stacks and Queues (Q3541104) (← links)
- (Q3771637) (← links)
- Lower bounds for sorting networks (Q4234092) (← links)
- A super-logarithmic lower bound for hypercubic sorting networks (Q4632461) (← links)
- The Half Cleaner Lemma: Constructing Efficient Interconnection Networks from Sorting Networks (Q5087836) (← links)
- Optimal Sorting Networks (Q5404915) (← links)
- Applying Sorting Networks to Synthesize Optimized Sorting Libraries (Q5743589) (← links)
- An 11-step sorting network for 18 elements (Q6483523) (← links)
