Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 1995: Algorithms and Computations pp 284–290Cite as

Searching for a monotone function by independent threshold queries

  • Session 8
  • Conference paper
  • First Online:

  • 165 Accesses

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

Abstract

Let us be given an unknown monotone discrete function f with domain and range of size m and n, respectively, where m ≤ n. A threshold query has the form ” f(x) ≥ y?” for a pair (x, y).

we give an optimal EREW PRAM algorithm that finds f in O(log n) time using O(n) threshold queries and arithmetic operations, in such a way that simultaneous queries are independent, i.e. they call mutually different x and y. Our algorithm composes two distributed binary search strategies by accelerated cascading.

The result can be applied to certain segmentation problems, arising e.g. in digital image processing.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.J. Atallah, S.R. Kosaraju: An efficient parallel algorithm for the row minima of a totally monotone matrix, J. of Algorithms 13 (1992), 394–413

    Google Scholar 

  2. P.G.Bradford, R.Fleischer, M.Smid: A polylog-time and O(n√log n)-work parallel algorithm for finding the row minima in totally monotone matrices, 1995, submitted

    Google Scholar 

  3. P.Damaschke: Line segmentation of digital curves in parallel, 12th Symposium on Theoretical Aspects of Computer Science STACS'95, Munich 1995, LNCS 900, Springer 1995, 539–549

    Google Scholar 

  4. P.Damaschke: An optimal parallel algorithm for digital curve segmentation using Hough polygons and monotone function search, 3rd European Symposium on Algorithms ESA '95, Corfu (Greece) 1995

    Google Scholar 

  5. F. Gao, L.J. Guibas, D.G. Kirkpatrick, W.T. Laaser, J. Saxe: Finding extrema with unary predicates, Algorithmica 9 (1993), 591–600

    Google Scholar 

  6. R. Hassin, N. Megiddo: An optimal algorithm for finding all the jumps of a monotone step-function, J. of Algorithms 6 (1985), 265–274

    Google Scholar 

  7. R.Raman, U.Vishkin: Optimal randomized parallel algorithms for computing the row minima of a totally monotone matrix, 5th ACM-SIAM Symposium on Discrete Algorithms SODA '94, 613–621

    Google Scholar 

  8. R.Sarnath, X.He: Efficient parallel algorithms for selection and searching in sorted matrices, 6th Int. Parallel Processing Symposium IPPS'92, IEEE Press 1992, 108–111

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Theoretische Informatik II, FernUniversität, 58084, Hagen, Germany

    Peter Damaschke

Authors
  1. Peter Damaschke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John Staples Peter Eades Naoki Katoh Alistair Moffat

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Damaschke, P. (1995). Searching for a monotone function by independent threshold queries. In: Staples, J., Eades, P., Katoh, N., Moffat, A. (eds) Algorithms and Computations. ISAAC 1995. Lecture Notes in Computer Science, vol 1004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015433

Download citation

  • DOI: https://doi.org/10.1007/BFb0015433

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47766-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation