Add to ORKGSorting on interconnection networks has been solved `optimally'. However, the `lower-order' terms are so large that they dominate the overall time-consumption for many practical problem sizes. Particularly for deterministic algorithms, this is a serious problem. In this paper a refined deterministic sampling strategy is presented, by which the additional term of the presented deterministic sorting algorithm is hardly larger than the one of the best randomized algorithm
In this paper we show the power of sampling techniques in designing efficient distributed algorithms...
The mesh with optical reconfigurable buses is one of the strongest interconnection networks one ca...
The recently discovered Shear-sort algorithm requires log2<SUB>n</SUB> iterations of row and column ...
Sorting on interconnection networks has been solved `optimally'. However, the `lower-order' terms ar...
AbstractIn this paper, a refined deterministic sampling strategy is presented. It allows to improve ...
This paper provides an overview of lower and upper bounds for mesh-connected processor networks. Mos...
Optimal randomized and deterministic algorithms have been given for k-k routing on two-dimensional n...
ABSTRACT. In this paper we identify techniques that have been employed in the design of sorting and ...
Abstract. In this paper we present efficient deterministic and randomized algorithms for selection o...
We show that sorting an input of size N = n superscript 2 can be performed by an n X n mesh-connect...
In all recent near-optimal sorting algorithms for meshes, the packets are sorted with respect to som...
We show that sorting an input of size N = 0 2 can be performed by an 0 X 0 mesh-connected processor ...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 1992. Simultaneously published...
We introduce a new deterministic parallel sorting algorithm for distributed memory machines based on...
We demonstrate that parallel deterministic sample sort for many-core GPUs (GPU BUCKET SORT) is not o...
In this paper we show the power of sampling techniques in designing efficient distributed algorithms...
The mesh with optical reconfigurable buses is one of the strongest interconnection networks one ca...
The recently discovered Shear-sort algorithm requires log2<SUB>n</SUB> iterations of row and column ...
Sorting on interconnection networks has been solved `optimally'. However, the `lower-order' terms ar...
AbstractIn this paper, a refined deterministic sampling strategy is presented. It allows to improve ...
This paper provides an overview of lower and upper bounds for mesh-connected processor networks. Mos...
Optimal randomized and deterministic algorithms have been given for k-k routing on two-dimensional n...
ABSTRACT. In this paper we identify techniques that have been employed in the design of sorting and ...
Abstract. In this paper we present efficient deterministic and randomized algorithms for selection o...
We show that sorting an input of size N = n superscript 2 can be performed by an n X n mesh-connect...
In all recent near-optimal sorting algorithms for meshes, the packets are sorted with respect to som...
We show that sorting an input of size N = 0 2 can be performed by an 0 X 0 mesh-connected processor ...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 1992. Simultaneously published...
We introduce a new deterministic parallel sorting algorithm for distributed memory machines based on...
We demonstrate that parallel deterministic sample sort for many-core GPUs (GPU BUCKET SORT) is not o...
In this paper we show the power of sampling techniques in designing efficient distributed algorithms...
The mesh with optical reconfigurable buses is one of the strongest interconnection networks one ca...
The recently discovered Shear-sort algorithm requires log2<SUB>n</SUB> iterations of row and column ...