Journal ArticleDOI
Parallelism in Comparison Problems
Reads0
Chats0
TLDR
The worst-case time complexity of algorithms for multiprocessor computers with binary comparisons as the basic operations is investigated and the algorithm for finding the maximum is shown to be optimal for all values of k and n.Abstract:
The worst-case time complexity of algorithms for multiprocessor computers with binary comparisons as the basic operations is investigated. It is shown that for the problems of finding the maximum, sorting, and merging a pair of sorted lists, if n, the size of the input set, is not less than k, the number of processors, speedups of at least $O(k/\log \log k)$ can be achieved with respect to comparison operations. The algorithm for finding the maximum is shown to be optimal for all values of k and n.read more
Citations
More filters
Proceedings ArticleDOI
Optimal algorithms for selection on a mesh-connected processor array
Danny Krizanc,L. Narayanan +1 more
TL;DR: The authors present novel algorithms for selecting an elements of specified rank among N=n/sup 2/ elements on an n*n mesh-connected processor array, in a variety of settings.
Journal ArticleDOI
Three-regular path pairable graphs
TL;DR: A graphG with at least 2k vertices isk-path pairable if for anyk pairs of distinct vertices ofG there arek edge disjoint paths between the pairs.
Journal ArticleDOI
The single facility location problem with minimum distance constraints.
Yael Konforty,Arie Tamir +1 more
TL;DR: An O(n log n) algorithm for finding an optimal 1-center model, improving upon the O( n3) complexity bound of the algorithm by Brimberg and Wesolowsky (1995).
Proceedings ArticleDOI
Parallel construction of near optimal binary trees
TL;DR: This work presents parallel algorithms to construct, for given sets of leaf weights, binary trees with almost optimal weighted path length (i.e. approximate Huffman trees) and leads to two sequential algorithms.
Journal ArticleDOI
Approximate parametric searching
TL;DR: A technique for approximately maximizing a class of concave functions whose evaluation is NP complete is presented, based on Megiddo's parametric searching technique.