Add to ORKGAbstract. We consider the problem of sorting N-element inputs differing from already sorted sequences on t entries. To perform this task we construct a comparator network that is applied periodically. The two constructions for this problem made by previous authors required O(logn+t) iterations of the network. Our construction requires O(logn + (loglogN) 2 (logt) 3) iterations which makes it faster for t ≫ logN
This paper introduces a new sorting network, called the balanced sorting Network, that sorts n items...
Correction networks are comparator networks that sort inputs differing from sorted sequences of len...
Abstract. Correction networks are comparator networks that sort inputs differing from sorted sequenc...
AbstractWe consider the problem of sorting N-element inputs differing from already sorted sequences ...
AbstractWe consider the problem of sorting N-element inputs differing from already sorted sequences ...
A periodic comparator network has depth (or period) k, if for every t ? k, the compare-exchange ope...
We consider comparator networks M which are used repeatedly: while the output produced by M is not s...
AbstractWe survey recent results on periodic algorithms. We focus on the problems of sorting, mergin...
We study the problem of sorting sequences of N-keys that can be obtained from sorted ones by changin...
AbstractWe survey recent results on periodic algorithms. We focus on the problems of sorting, mergin...
We consider the problem of merging two sorted sequences on constant degree networks performing compa...
We consider the problem of merging two sorted sequences on constant degree networks performing compa...
Let and be a partition of f1;:::;ng into two blocks. A merging network is a network of comparators w...
We consider the problem of merging two sorted sequenceson constant degree networks using comparators...
Comparator networks can model many algorithms for internal computer sorting. A comparator network is...
This paper introduces a new sorting network, called the balanced sorting Network, that sorts n items...
Correction networks are comparator networks that sort inputs differing from sorted sequences of len...
Abstract. Correction networks are comparator networks that sort inputs differing from sorted sequenc...
AbstractWe consider the problem of sorting N-element inputs differing from already sorted sequences ...
AbstractWe consider the problem of sorting N-element inputs differing from already sorted sequences ...
A periodic comparator network has depth (or period) k, if for every t ? k, the compare-exchange ope...
We consider comparator networks M which are used repeatedly: while the output produced by M is not s...
AbstractWe survey recent results on periodic algorithms. We focus on the problems of sorting, mergin...
We study the problem of sorting sequences of N-keys that can be obtained from sorted ones by changin...
AbstractWe survey recent results on periodic algorithms. We focus on the problems of sorting, mergin...
We consider the problem of merging two sorted sequences on constant degree networks performing compa...
We consider the problem of merging two sorted sequences on constant degree networks performing compa...
Let and be a partition of f1;:::;ng into two blocks. A merging network is a network of comparators w...
We consider the problem of merging two sorted sequenceson constant degree networks using comparators...
Comparator networks can model many algorithms for internal computer sorting. A comparator network is...
This paper introduces a new sorting network, called the balanced sorting Network, that sorts n items...
Correction networks are comparator networks that sort inputs differing from sorted sequences of len...
Abstract. Correction networks are comparator networks that sort inputs differing from sorted sequenc...