Pages that link to "Item:Q582098"

The following pages link to Improved sorting networks with O(log N) depth (Q582098):

Displaying 25 items.

• On the complexity of min-max sorting networks (Q454886) (← links)
• Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons (Q476439) (← links)
• Picture-hanging puzzles (Q489745) (← links)
• A sorting network in bounded arithmetic (Q638498) (← links)
• Smallest compact formulation for the permutahedron (Q745678) (← 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)
• Parameterized complexity classes defined by threshold circuits: using sorting networks to show collapses with W-hierarchy classes (Q2150563) (← links)
• Expander construction in \(\mathrm{VNC}^1\) (Q2187260) (← links)
• Combinatorial search in two and more rounds (Q2420609) (← links)
• Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments (Q2922881) (← links)
• A lower bound for sorting networks based on the shuffle permutation (Q4311642) (← links)
• A super-logarithmic lower bound for hypercubic sorting networks (Q4632461) (← links)
• Expander Construction in VNC1 (Q4638081) (← links)
• Fragile complexity of comparison-based algorithms (Q5075734) (← links)
• Sorting Short Keys in Circuits of Size ${o(n \log n)}$ (Q5080485) (← links)
• On (Valiant’s) Polynomial-Size Monotone Formula for Majority (Q5098767) (← links)
• (Q5743386) (← links)
• Fragile complexity of adaptive algorithms (Q5918676) (← links)
• Fragile complexity of adaptive algorithms (Q5925676) (← links)
• Improved fault-tolerance sorting algorithm in hypercubes (Q5941735) (← links)