Pages that link to "Item:Q582098"
From MaRDI portal
The following pages link to Improved sorting networks with O(log N) depth (Q582098):
Displayed 10 items.
- On the complexity of min-max sorting networks (Q454886) (← links)
- A sorting network in bounded arithmetic (Q638498) (← links)
- Sorting networks of logarithmic depth, further simplified (Q1024784) (← links)
- Boolean circuit programming: A new paradigm to design parallel algorithms (Q1026240) (← links)
- Real-time emulations of bounded-degree networks (Q1128816) (← links)
- Braking the \(\Theta(n\log^ 2 n)\) barrier for sorting with faults (Q1356885) (← links)
- Periodic comparator networks (Q1575741) (← links)
- Construction of halvers (Q1606915) (← links)
- A lower bound for sorting networks based on the shuffle permutation (Q4311642) (← links)
- Improved fault-tolerance sorting algorithm in hypercubes (Q5941735) (← links)