AbstractWe survey recent results on periodic algorithms. We focus on the problems of sorting, merging and permuting and concentrate on algorithms that have small constant periods
AbstractThis work studies comparator networks in which several of the outputs are accelerated. That ...
We study the problem of sorting sequences of N-keys that can be obtained from sorted ones by changin...
We consider a class of comparator networks obtained from the omega permutation network by replacing...
AbstractWe survey recent results on periodic algorithms. We focus on the problems of sorting, mergin...
AbstractWe consider the problem of sorting N-element inputs differing from already sorted sequences ...
We consider the problem of merging two sorted sequences on constant degree networks performing compa...
We consider the problem of merging two sorted sequenceson constant degree networks using comparators...
We consider the problem of merging two sorted sequences on constant degree networks performing compa...
We consider comparator networks M which are used repeatedly: while the output produced by M is not s...
A periodic comparator network has depth (or period) k, if for every t ? k, the compare-exchange ope...
Abstract. We consider the problem of sorting N-element inputs differing from already sorted sequence...
Let and be a partition of f1;:::;ng into two blocks. A merging network is a network of comparators w...
AbstractWe consider the problem of sorting N-element inputs differing from already sorted sequences ...
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...
AbstractThis work studies comparator networks in which several of the outputs are accelerated. That ...
We study the problem of sorting sequences of N-keys that can be obtained from sorted ones by changin...
We consider a class of comparator networks obtained from the omega permutation network by replacing...
AbstractWe survey recent results on periodic algorithms. We focus on the problems of sorting, mergin...
AbstractWe consider the problem of sorting N-element inputs differing from already sorted sequences ...
We consider the problem of merging two sorted sequences on constant degree networks performing compa...
We consider the problem of merging two sorted sequenceson constant degree networks using comparators...
We consider the problem of merging two sorted sequences on constant degree networks performing compa...
We consider comparator networks M which are used repeatedly: while the output produced by M is not s...
A periodic comparator network has depth (or period) k, if for every t ? k, the compare-exchange ope...
Abstract. We consider the problem of sorting N-element inputs differing from already sorted sequence...
Let and be a partition of f1;:::;ng into two blocks. A merging network is a network of comparators w...
AbstractWe consider the problem of sorting N-element inputs differing from already sorted sequences ...
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...
AbstractThis work studies comparator networks in which several of the outputs are accelerated. That ...
We study the problem of sorting sequences of N-keys that can be obtained from sorted ones by changin...
We consider a class of comparator networks obtained from the omega permutation network by replacing...
DOI
Add to ORKG