The following pages link to Lower bounds for sorting networks (Q4234092):
Displaying 19 items.
- A pattern theorem for random sorting networks (Q392684) (← 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)
- A sorting network in bounded arithmetic (Q638498) (← 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)
- On probabilistic networks for selection, merging, and sorting (Q1384688) (← links)
- A superlogarithmic lower bound for shuffle-unshuffle sorting networks (Q1579052) (← links)
- Sorting and counting networks of arbitrary width and small depth (Q1601745) (← links)
- Formally proving size optimality of sorting networks (Q1694569) (← links)
- Lower bounds for merging networks (Q1854444) (← links)
- Sorting networks: to the end and back again (Q2424684) (← links)
- New Bounds on Optimal Sorting Networks (Q3195693) (← links)
- The Complexity of Sorting with Networks of Stacks and Queues (Q3541104) (← links)
- Selection Networks (Q3982712) (← links)
- (Q4201938) (← links)
- A super-logarithmic lower bound for hypercubic sorting networks (Q4632461) (← links)
- Arguments for the unsuitability of convolutional neural networks for non-local tasks (Q6079068) (← links)
