Some comments on the structure of the best known networks sorting 16 elements

10/26/2018
by   Igor S. Sergeev, et al.
0

We propose an explanation of the structure of the best known sorting networks for 16 elements with respect to the complexity and to the depth due to Green and van Voorhis.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/01/2018

Joint Size and Depth Optimization of Sorting Networks

Sorting networks are oblivious sorting algorithms with many interesting ...
research
11/14/2021

Stochastic and Worst-Case Generalized Sorting Revisited

The generalized sorting problem is a restricted version of standard comp...
research
01/02/2020

4-uniform BCT permutations from generalized butterfly structure

As a generalization of Dillon's APN permutation, butterfly structure and...
research
05/09/2021

Differentiable Sorting Networks for Scalable Sorting and Ranking Supervision

Sorting and ranking supervision is a method for training neural networks...
research
10/08/2019

Stack Sorting with Increasing and Decreasing Stacks

We introduce a sorting machine consisting of k+1 stacks in series: the f...
research
07/03/2021

Recombinant Sort: N-Dimensional Cartesian Spaced Algorithm Designed from Synergetic Combination of Hashing, Bucket, Counting and Radix Sort

Sorting is an essential operation which is widely used and is fundamenta...
research
03/03/2018

Histogram Sort with Sampling

To minimize data movement, state-of-the-art parallel sorting algorithms ...

Please sign up or login with your details

Forgot password? Click here to reset