Add to ORKGAbstract Mesh connected computers have become attractive models of computing because of their varied special features. In this paper we consider two variations of the mesh model: 1) a mesh with fixed buses, and 2) a mesh with reconfigurable buses. Both these models have been the subject of extensive previous research. The problem of our interest is selection. Selection is a critical comparison problem with numerous applications. Our algorithms have considerably better time bounds than the best known algorithms for selection.
The mesh with optical reconfigurable buses is one of the strongest interconnection networks one ca...
Abstract. In this paper we present efficient deterministic and randomized algorithms for selection o...
We present a deterministic algorithm for selecting the element of rank k among N = n2 elements, 1 ≤...
Multiselection is the problem of selecting multiple elements at specified ranks from a set of arbitr...
Mesh connected computers have become attractive models of computing because of their varied special ...
In this paper we present efficient deterministic algorithms for selection on the mesh connected comp...
Multiselection is the problem of selecting multiple elements at specified ranks from a set of arbitr...
Abstract Mesh connected computers have become attractive models of com-puting because of their varie...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 1992. Simultaneously published...
ABSTRACT. In this paper we identify techniques that have been employed in the design of sorting and ...
Randomized selection algorithms on k-dimensional mesh-connected computers with multiple broadcasting...
We consider 1-1 sorting and selection problems on an n x n mesh-connected processor arrays. Algorith...
We show that selection on an input of size N = n2 can be performed by a N node mesh-connected proce...
In this paper, we consider the problem of selection on coarse-grained distributed memory parallel co...
On a mesh-connected computer, moving data across the mesh is the most time-consuming operation in ma...
The mesh with optical reconfigurable buses is one of the strongest interconnection networks one ca...
Abstract. In this paper we present efficient deterministic and randomized algorithms for selection o...
We present a deterministic algorithm for selecting the element of rank k among N = n2 elements, 1 ≤...
Multiselection is the problem of selecting multiple elements at specified ranks from a set of arbitr...
Mesh connected computers have become attractive models of computing because of their varied special ...
In this paper we present efficient deterministic algorithms for selection on the mesh connected comp...
Multiselection is the problem of selecting multiple elements at specified ranks from a set of arbitr...
Abstract Mesh connected computers have become attractive models of com-puting because of their varie...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 1992. Simultaneously published...
ABSTRACT. In this paper we identify techniques that have been employed in the design of sorting and ...
Randomized selection algorithms on k-dimensional mesh-connected computers with multiple broadcasting...
We consider 1-1 sorting and selection problems on an n x n mesh-connected processor arrays. Algorith...
We show that selection on an input of size N = n2 can be performed by a N node mesh-connected proce...
In this paper, we consider the problem of selection on coarse-grained distributed memory parallel co...
On a mesh-connected computer, moving data across the mesh is the most time-consuming operation in ma...
The mesh with optical reconfigurable buses is one of the strongest interconnection networks one ca...
Abstract. In this paper we present efficient deterministic and randomized algorithms for selection o...
We present a deterministic algorithm for selecting the element of rank k among N = n2 elements, 1 ≤...