## Abstract

Suppose we have n elements from a totally ordered domain, and we are allowed to perform p parallel comparisons in each time unit (=round). In this paper we determine, up to a constant factor, the time complexity of several approximation problems in the common parallel comparison tree model of Valiant, for all admissible values of n, p and e{open}, where e{open} is an accuracy parameter determining the quality of the required approximation. The problems considered include the approximate maximum problem, approximate sorting and approximate merging. Our results imply as special cases, all the known results about the time complexity for parallel sorting, parallel merging and parallel selection of the maximum (in the comparison model), up to a constant factor. We mention one very special but representative result concerning the approximate maximum problem; suppose we wish to find, among the given n elements, one which belongs to the biggest n/2, where in each round we are allowed to ask n binary comparisons. We show that log^{*}n+O(1) rounds are both necessary and sufficient in the best algorithm for this problem.

Original language | English (US) |
---|---|

Pages (from-to) | 97-122 |

Number of pages | 26 |

Journal | Combinatorica |

Volume | 11 |

Issue number | 2 |

DOIs | |

State | Published - Jun 1991 |

## All Science Journal Classification (ASJC) codes

- Discrete Mathematics and Combinatorics
- Computational Mathematics

## Keywords

- AMS subject classification (1980): 68E05