DOIAbstract
AbstractBuilding on previous works, this paper establishes that the minimal depth of a Bitonic sorter of n keys is 2⌈log(n)⌉−⌊log(n)⌋
AbstractBuilding on previous works, this paper establishes that the minimal depth of a Bitonic sorter of n keys is 2⌈log(n)⌉−⌊log(n)⌋
. We prove that constant depth circuits of size n log O(1) n over the basis AND, OR, PARITY are ...
Almost all computers regularly sort data. Many different sorting algorithms have been proposed. It i...
We establish a lower bound of (1:12 \Gamma o(1)) n log n on the size of any n-input sorting network...
AbstractBuilding on previous works, this paper establishes that the minimal depth of a Bitonic sorte...
We present a new mathematical model for representing comparator networks together with a new algorit...
The grid-area required by a sorting net for input vectors of length N is shown to be at least (N - 1...
Shuffle-unshuffle sorting networks are a class of comparator networks whose structure maps efficient...
[[abstract]]The k-way bitonic sort algorithm, a generalization of K.E. Batcher's bitonic sort algori...
Abstract. We introduce a sorting scheme which is capable of efficiently sorting encrypted data witho...
Ajtai, Komlós, and Szemerédi constructed sorting networks with N wires of depth O(logN). They were n...
We present a complete formalisation of bitonic sort and its correctness proof in constructive type...
Ajtai, Koml'os, and Szemer'edi constructed sorting networks with N wires of depth O(log N...
We present a complete formalisation of bitonic sort and its correctness proof in constructive type ...
Sorting networks are usually bound at a depth of O(log^2 n), since a perfect halver is of at least d...
We prove that constant depth circuits of size $NPOLYLOG$ over the basis AND, OR, PARITY are no more ...
. We prove that constant depth circuits of size n log O(1) n over the basis AND, OR, PARITY are ...
Almost all computers regularly sort data. Many different sorting algorithms have been proposed. It i...
We establish a lower bound of (1:12 \Gamma o(1)) n log n on the size of any n-input sorting network...
AbstractBuilding on previous works, this paper establishes that the minimal depth of a Bitonic sorte...
We present a new mathematical model for representing comparator networks together with a new algorit...
The grid-area required by a sorting net for input vectors of length N is shown to be at least (N - 1...
Shuffle-unshuffle sorting networks are a class of comparator networks whose structure maps efficient...
[[abstract]]The k-way bitonic sort algorithm, a generalization of K.E. Batcher's bitonic sort algori...
Abstract. We introduce a sorting scheme which is capable of efficiently sorting encrypted data witho...
Ajtai, Komlós, and Szemerédi constructed sorting networks with N wires of depth O(logN). They were n...
We present a complete formalisation of bitonic sort and its correctness proof in constructive type...
Ajtai, Koml'os, and Szemer'edi constructed sorting networks with N wires of depth O(log N...
We present a complete formalisation of bitonic sort and its correctness proof in constructive type ...
Sorting networks are usually bound at a depth of O(log^2 n), since a perfect halver is of at least d...
We prove that constant depth circuits of size $NPOLYLOG$ over the basis AND, OR, PARITY are no more ...
. We prove that constant depth circuits of size n log O(1) n over the basis AND, OR, PARITY are ...
Almost all computers regularly sort data. Many different sorting algorithms have been proposed. It i...
We establish a lower bound of (1:12 \Gamma o(1)) n log n on the size of any n-input sorting network...
Add to ORKG