Add to ORKGCorrection networks are comparator networks that sort inputs differing from sorted sequences of length N in a small number of positions. The main application of such networks is producing fault-tolerant sorting networks. We show the lower bound 1.44log 2 N on the depth of correction networks settling an open problem from [7]. This bound is tight since the upper bound 1.44log 2 N is known
Comparator networks can model many algorithms for internal computer sorting. A comparator network is...
AbstractA lower bound theorem is established for the number of comparators in a merging network. Let...
AbstractWe study the size of the smallest test set to decide if a network is a sorting network (sort...
Abstract. Correction networks are comparator networks that sort inputs differing from sorted sequenc...
We establish a lower bound of (1:12 \Gamma o(1)) n log n on the size of any n-input sorting network...
We present a new mathematical model for representing comparator networks together with a new algorit...
We present a general technique for enhanc-ing the reliability of sorting networks, and other compara...
AbstractWe consider the problem of sorting N-element inputs differing from already sorted sequences ...
Shuffle-unshuffle sorting networks are a class of comparator networks whose structure maps efficient...
We study the problem of sorting sequences of N-keys that can be obtained from sorted ones by changin...
We present the fist construction for sorting and count-ing networks of arbitrary width that uses bot...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1994.Includes bibliogr...
AbstractWe consider the problem of sorting N-element inputs differing from already sorted sequences ...
This paper describes a computer-assisted non-existence proof of 9-input sorting networks consisting ...
Abstract. We present new parallel sorting networks for 17 to 20 inputs. For 17, 19, and 20 inputs th...
Comparator networks can model many algorithms for internal computer sorting. A comparator network is...
AbstractA lower bound theorem is established for the number of comparators in a merging network. Let...
AbstractWe study the size of the smallest test set to decide if a network is a sorting network (sort...
Abstract. Correction networks are comparator networks that sort inputs differing from sorted sequenc...
We establish a lower bound of (1:12 \Gamma o(1)) n log n on the size of any n-input sorting network...
We present a new mathematical model for representing comparator networks together with a new algorit...
We present a general technique for enhanc-ing the reliability of sorting networks, and other compara...
AbstractWe consider the problem of sorting N-element inputs differing from already sorted sequences ...
Shuffle-unshuffle sorting networks are a class of comparator networks whose structure maps efficient...
We study the problem of sorting sequences of N-keys that can be obtained from sorted ones by changin...
We present the fist construction for sorting and count-ing networks of arbitrary width that uses bot...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1994.Includes bibliogr...
AbstractWe consider the problem of sorting N-element inputs differing from already sorted sequences ...
This paper describes a computer-assisted non-existence proof of 9-input sorting networks consisting ...
Abstract. We present new parallel sorting networks for 17 to 20 inputs. For 17, 19, and 20 inputs th...
Comparator networks can model many algorithms for internal computer sorting. A comparator network is...
AbstractA lower bound theorem is established for the number of comparators in a merging network. Let...
AbstractWe study the size of the smallest test set to decide if a network is a sorting network (sort...