Skip to main content
SpringerLink
Log in

Optimal unbounded search strategies

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1980)

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

Included in the following conference series:

Abstract

We present here strategies for searching the (unique) zero of a real function, or its n-th derivative; we assume no a priori bound on the value x of this zero. The proposed strategy performs logry + llogry+ ... +1 + log*ry evaluations of f to determine x = ɛy with error less than ɛ (here r depends only on n). An argument of slowly converning integrals shows that these strategies are essentially optimal.

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.

References

  • J.L. BENTLEY & A.C. YAO [76]: An almost optimal algorithm for unbounded searching, IPL, vol. 3, no 3 (1976) pp. 82–87.

    Google Scholar 

  • N. BOURBAKI [76]: Théorie des fonctions de variables réelles, ch. V, app. no 8 (1976 3rd ed.), Hermann Paris.

    Google Scholar 

  • S. EILENBERG [74]: Automata, languages, and machines, Vol. A, Academic Press (1974).

    Google Scholar 

  • P. ELIAS [75]: Universal codework sets and representation of the integers, IEEE Trans. on Information theory, IT-21 (1975) pp. 194–203.

    Google Scholar 

  • S. EVEN & M. RODEH [78]: Economical encoding of commas between strings, CACM, Vol. 21, no 4 (1978) pp. 315–317.

    Google Scholar 

  • L. HYAFIL [77]: Optimal search for the zero of the n th derivative, IRIA/LABORIA, Rapport no 247 (1977).

    Google Scholar 

  • R.M. KARP & W.L. MIRANKER [72]: Parallel minimax search for a maximum, J. of Comb. Theory 4 (1972) pp. 19–35.

    Google Scholar 

  • H.P. KATSEFF [78]: Complexity dip in random infinite binary sequences, SIGACT Newsletters (Winter 1978) pp. 22–23.

    Google Scholar 

  • J. KIEFER [53]: Sequential minimax search for a maximum, Proc. Ameri. Soc. 4 (1953) pp. 502–506.

    Google Scholar 

  • D.E. KNUTH [75]: The art of computer programming, Vol. 3, Sorting and searching, Addison-Wesley (1975).

    Google Scholar 

  • D.E. KNUTH [79]: Supernatural numbers. (Dedicated to Martin Gardner).

    Google Scholar 

  • A. KOLMOGOROV [68]: Three approaches for defining the concept of information quantity, Selected Translations in Math. Stat. and Prob., AMS Publication (1968).

    Google Scholar 

  • H.T. KUNG [76]: Synchronized and asynchronous parallel algorithms for multi-processors, in Proc. of a Symp. on Algorithms and Complexity (1976). Edited by J.F. Traub, Academic Press, 1976, pp. 153–200.

    Google Scholar 

  • J. LINN [73]: General methods for parallel searching, Tech. Rep. no 61, Digital Systems Lab., Stanford University (1973).

    Google Scholar 

  • P. MARTIN-LÖF [71]: Complexity oscillations in infinite binary sequences, Z. Wahrsheinlichkeitstheorie Verw. Geb. 19 (1971) pp. 225–230.

    Google Scholar 

  • J.C. RAOULT, J. VUILLEMIN [79]: Optimal unbounded search strategies, Rapport LRI, no 33 (1979).

    Google Scholar 

  • R.L. RIVEST, A.R. MEYER, D.J. KLEITMAN, J. SPENCER, K. WINKLMAN [78]: Coping with errors in binary search procedures, Proc. of the 10th annual ACM Symposium on Theory of Computing, San Diego (1978) pp. 227–232.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire de Recherche en Informatique, Université de Paris-Sud, Bât. 490, 91405, ORSAY, France

    J. C. Raoult & J. Vuillemin

Authors
  1. J. C. Raoult
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Vuillemin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jaco de Bakker Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Raoult, J.C., Vuillemin, J. (1980). Optimal unbounded search strategies. In: de Bakker, J., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 1980. Lecture Notes in Computer Science, vol 85. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10003-2_95

Download citation

  • DOI: https://doi.org/10.1007/3-540-10003-2_95

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10003-4

  • Online ISBN: 978-3-540-39346-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation