Finding extrema with unary predicates

@article{Gao1993FindingEW,
  title={Finding extrema with unary predicates},
  author={Feng Gao and Leonidas J. Guibas and David G. Kirkpatrick and William T. Laaser and James B. Saxe},
  journal={Algorithmica},
  year={1993},
  volume={9},
  pages={591-600}
}
We consider the problem of determining the maximum and minimum elements of a setX={x1...,x n }, drawn from some finite universeU of real numbers, using only unary predicates of the inputs. It is shown that θ(n+ log¦U¦) unary predicate evaluations are necessary and sufficient, in the worst case. Results are applied to (i) the problem of determining approximate extrema of a set of real numbers, in the same model, and (ii) the multiparty broadcast communication complexity of determining the… CONTINUE READING
2 Citations
3 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Finding extrema with unary predicates , Proe

  • F. Gao
  • 1980

Multiparty protocols , Proe

  • R. Lipton
  • The Desi 9 n and Analysis of Computer Algorithms
  • 1975

Similar Papers

Loading similar papers…