Peter J. Looges

Learn More
e One of the fundamental algorithmic problems in computer science involves selecting th -th smallest element in a collection of elements. We propose an algorithm design m k A n ethodology to solve the selection problem on meshes with multiple broadcasting. Our methodology leads to a selection algorithm that runs in O( ) time on a mesh n (log n ) 4 n 3/8 1/4(More)
The sorting problem is of fundamental importance in non-numerical algorithms. Many applications require the ordering of data based the relationship of some set of keys with in the data. Merging is a natural companion of sorting, and is known to yield a very efficient sorting algorithm in sequential processing. Numerous sorting and merging techniques have(More)
  • 1