Improved sorting networks with O(log N) depth
From MaRDI portal
Publication:582098
DOI10.1007/BF01840378zbMath0689.68066WikidataQ56337888 ScholiaQ56337888MaRDI QIDQ582098
Publication date: 1990
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01840378
Related Items
A lower bound for sorting networks based on the shuffle permutation, A super-logarithmic lower bound for hypercubic sorting networks, Expander Construction in VNC1, Sorting Short Keys in Circuits of Size ${o(n \log n)}$, On (Valiant’s) Polynomial-Size Monotone Formula for Majority, Fragile complexity of comparison-based algorithms, Unnamed Item, Improved fault-tolerance sorting algorithm in hypercubes, Fragile complexity of adaptive algorithms, Fragile complexity of adaptive algorithms, On the complexity of min-max sorting networks, Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons, Picture-hanging puzzles, A sorting network in bounded arithmetic, Smallest compact formulation for the permutahedron, Sorting networks of logarithmic depth, further simplified, Boolean circuit programming: A new paradigm to design parallel algorithms, Real-time emulations of bounded-degree networks, Braking the \(\Theta(n\log^ 2 n)\) barrier for sorting with faults, Periodic comparator networks, Construction of halvers, Parameterized complexity classes defined by threshold circuits: using sorting networks to show collapses with W-hierarchy classes, Expander construction in \(\mathrm{VNC}^1\), Combinatorial search in two and more rounds, Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
Cites Work
