Optimal Sorting Networks
From MaRDI portal
Publication:5404915
DOI10.1007/978-3-319-04921-2_19zbMath1408.68042arXiv1310.6271OpenAlexW2147229907WikidataQ56337898 ScholiaQ56337898MaRDI QIDQ5404915
Publication date: 31 March 2014
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.6271
Related Items
Optimizing sorting algorithms by using sorting networks, Optimal-depth sorting networks, Merging almost sorted sequences yields a 24-sorter, New Bounds on Optimal Sorting Networks, The Half Cleaner Lemma: Constructing Efficient Interconnection Networks from Sorting Networks, Combinatorial search in two and more rounds, Synchronous counting and computational algorithm design, Sorting networks: to the end and back again, Formally proving size optimality of sorting networks, Sorting nine inputs requires twenty-five comparisons, Applying Sorting Networks to Synthesize Optimized Sorting Libraries
