We present new parallel sorting networks for 17 to 20 inputs. For 17, 19, and 20 inputs these new networks are faster (i.e., they require less computation steps) than the previously known best networks. Therefore, we improve upon the known upper bounds for minimal depth sorting networks on 17, 19, and 20 channels. The networks were obtained using a combination of hand-crafted first layers and a...

We consider the problem of sorting elements on a series of stacks, introduced by Tarjan and Knuth. We improve the asymptotic lower bound for the number of stacks necessary to sort n elements to 0.561 log 2 n+O(1). This is the first significant improvement since the previous lower bound, 1 2 log 2 n+O(1), was established by Knuth in 1972.

Sorting algorithm is one of the most basic research fields in computer science. Sorting refers to the operation of arranging data in some given order such as increasing or decreasing, with numerical data, or alphabetically, with character data. There are many sorting algorithms. All sorting algorithms are problem specific. The particular Algorithm one chooses depends on the properties of the da...

A novel method of constructing sorting networks.

We show how column sort [LEIG85] and rotate sort [MARB88] can be implemented on the different reconfigurable mesh with buses (RMB) architectures that have been proposed in the literature. On all of these proposed RMB architectures, we are able to sort n numbers on an n × n configuration in O(1) time. For the PARBUS RMB architecture [WANG90ab], our column sort and rotate sort implementations are...

In this work we present an algorithmic transformation, that given two algorithms implementing respectively, sorting and searching, provides a randomized sorting algorithm that with high probability requires less time than the original sorting algorithm. This claim is true for a wide range of the parameters that describe the running time of the procedures for sorting and searching.

The objective behind the “TWIN SORT” technique is to sort the list of unordered data elements efficiently and to allow efficient and simple arrangement of data elements within the data structure with optimization of comparisons and iterations in the sorting method. This sorting technique is effectively terminates the iterations when there is no need of comparison if the elements are all sorted ...

Two new algorithms for improving the speed of the LZ77 compression are proposed. One is based on a new hashing algorithm named two-level hashing that enables fast longest match searching from a sliding dictionary, and the other uses suffix sorting. The former is suitable for small dictionaries and it significantly improves the speed of gzip, which uses a naive hashing algorithm. The latter is s...

Epithelial cell polarity depends on the continuous sorting of plasma membrane proteins. While various sorting signals and pathways have been identified, only recently has a protein been identified that recognizes such sorting determinants and mediates sorting to a specific cell-surface domain.