Finding extrema with unary predicates | SpringerLink
Skip to main content
Springer Nature Link
Log in

Finding extrema with unary predicates

  • Conference paper
  • First Online:
Algorithms (SIGAL 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 450))

Included in the following conference series:

Abstract

We consider the problem of determining the maximum and minimum elements of a set X=x 1,...,x n of integers, drawn from the some universe U, 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 extrema of a set of integers held by distinct processors.

Supported in part by Natural Sciences and Engineering Research Council Grant A3583 and a BCASI Fellowship.

Supported in part by Natural Sciences and Engineering Research Council Grant A0482

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aho, A.V., Hopcroft, J.E. and Ullman, J.D., The Design and Analysis of Computer Algorithms, Addison-Wesley, 1975.

    Google Scholar 

  2. Babai, L., Nisan, N. and Szegedy, M., Multiparty protocols and logspace-hard pseudorandom sequences, Proc. 21st ACM STOC (1989), 1–11.

    Google Scholar 

  3. Chandra, A., Furst, M. and Lipton, R., Multiparty protocols, Proc. 15th ACM STOC (1983), 94–99.

    Google Scholar 

  4. Knuth, D.E., The Art of Computer Preogramming, Vol.3, Addison-Wesley, 1973.

    Google Scholar 

  5. Rivest, R. and Vuillemin, J., On recognizing graph properties from adjacency matrices, Theoretical Computer Science 3 (1978), 371–384.

    Article  Google Scholar 

  6. Yao, A.C., Some complexity questions related to distributed computing, Proc. 11th ACM STOC (1979), 209–213.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of British Columbia, UK

    David G. Kirkpatrick & Feng Gao

Authors
  1. David G. Kirkpatrick
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Feng Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tetsuo Asano Toshihide Ibaraki Hiroshi Imai Takao Nishizeki

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kirkpatrick, D.G., Gao, F. (1990). Finding extrema with unary predicates. In: Asano, T., Ibaraki, T., Imai, H., Nishizeki, T. (eds) Algorithms. SIGAL 1990. Lecture Notes in Computer Science, vol 450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52921-7_65

Download citation

  • DOI: https://doi.org/10.1007/3-540-52921-7_65

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52921-7

  • Online ISBN: 978-3-540-47177-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation