Add to ORKGWe consider 1-1 sorting and selection problems on an n x n mesh-connected processor arrays. Algorithms are developed which are fast with respect to the average-time performance. We show that selection can be accomplished in the average time 2-n + o(n), and sorting in the average time 2 . n+o(n). Matching lower bounds are also proved
This paper provides an overview of lower and upper bounds for mesh-connected processor networks. Mos...
In this paper we present efficient deterministic algorithms for selection on the mesh connected comp...
. We present sorting algorithms on the recently introduced multi-mesh, a network consisting of n 2 ...
. We present algorithms for sorting and routing on two-dimensional mesh-connected parallel architect...
Abstract. We present algorithms for sorting and routing on two-dimen-sional mesh-connected parallel ...
We show that sorting an input of size N = n superscript 2 can be performed by an n X n mesh-connect...
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 present a deterministic algorithm for selecting the element of rank k among N = n2 elements, 1 ≤...
We show that selection on an input of size N = n2 can be performed by a N node mesh-connected proce...
Multiselection is the problem of selecting multiple elements at specified ranks from a set of arbitr...
The recently discovered Shear-sort algorithm requires log2<SUB>n</SUB> iterations of row and column ...
Sorting is a fundamental problem with applications in all areas of computer science and engineering....
Multiselection is the problem of selecting multiple elements at specified ranks from a set of arbitr...
AbstractA processor is balanced in carrying out a computation if its computing time equals its I/O t...
This paper provides an overview of lower and upper bounds for mesh-connected processor networks. Mos...
In this paper we present efficient deterministic algorithms for selection on the mesh connected comp...
. We present sorting algorithms on the recently introduced multi-mesh, a network consisting of n 2 ...
. We present algorithms for sorting and routing on two-dimensional mesh-connected parallel architect...
Abstract. We present algorithms for sorting and routing on two-dimen-sional mesh-connected parallel ...
We show that sorting an input of size N = n superscript 2 can be performed by an n X n mesh-connect...
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 present a deterministic algorithm for selecting the element of rank k among N = n2 elements, 1 ≤...
We show that selection on an input of size N = n2 can be performed by a N node mesh-connected proce...
Multiselection is the problem of selecting multiple elements at specified ranks from a set of arbitr...
The recently discovered Shear-sort algorithm requires log2<SUB>n</SUB> iterations of row and column ...
Sorting is a fundamental problem with applications in all areas of computer science and engineering....
Multiselection is the problem of selecting multiple elements at specified ranks from a set of arbitr...
AbstractA processor is balanced in carrying out a computation if its computing time equals its I/O t...
This paper provides an overview of lower and upper bounds for mesh-connected processor networks. Mos...
In this paper we present efficient deterministic algorithms for selection on the mesh connected comp...
. We present sorting algorithms on the recently introduced multi-mesh, a network consisting of n 2 ...