A Lower Bound on the Size of Shellsort Sorting Networks
From MaRDI portal
Publication:4037684
DOI10.1137/0222006zbMath0766.68021OpenAlexW2012511435MaRDI QIDQ4037684
Publication date: 16 May 1993
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0222006
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Parallel algorithms in computer science (68W10)
Related Items
A lower bound for sorting networks based on the shuffle permutation, Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons, A super-logarithmic lower bound for hypercubic sorting networks