Skip to main content
SpringerLink
Log in

Robust variations of interpolation search: An asymptotic analysis

Robuste Variationen der Interpolationssuche: Eine Asymptotische Analyse

  • Published:
Computing Aims and scope Submit manuscript

Abstract

The Brownian Motion is used as a tool in analysing several variations of Interpolation Search when applied to non-uniform distributions. Asymptotic distributions, mean and variance are obtained for the number of probes before success.

Zusammenfassung

Die Brownsche Bewegung wird als Werkzeug zur Analyse von verschiedenen Variationen der Interpolationssuche benutzt, sofern sie auf nicht einheitliche Verteilungen angewandt wird. Asymptotische Verteilungen, Mittelwert and Varianz erhält man für die Anzahl der Versuche bis zum Erfolg.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Armenakis, A. C., Garey, L. E., Gupta, R. D.: An adaptation of a root finding method to searching ordered disk files, BIT25, 562–568 (1985).

    Article  MathSciNet  Google Scholar 

  2. Billingsley, P.:Convergence of Probability Measures; Wiley (1968).

  3. Brent, R. P.:Algorithms for Minimization without Derivatives; Prentice-Hall, (1973).

  4. Csörgö, M., Revesz, P.:Strong Approximations in Probability and Statistics; Academic Press (1981).

  5. Dowell, M., Jarrat P.: The pegasus method for computing the root of an equation; BIT12 503–508 (1972).

    Article  Google Scholar 

  6. Gonnet, G. H.: Notes on the derivation of asymptotic expansions for summations; Information Processing Letters7 165–169 (1978).

    Article  Google Scholar 

  7. Gonnet, G. H., Rogers, L. D., George, J. A.: An algorithmic and complexity analysis of interpolation search; Acta Inf.13 39–52 (1980).

    Article  Google Scholar 

  8. King, R. F.: An improved pegasus method for root finding; BIT13 423–427 (1973).

    Article  Google Scholar 

  9. Louchard, G.: The Brownian Motion: a neglected tool for the complexity analysis of sorted tables manipulation Rairo Inf. Th.17, 4 365–385 (1983).

    Google Scholar 

  10. Louchard, G.: Brownian motion and algorithm complexity; BIT26 17–34 (1986).

    Article  Google Scholar 

  11. Louchard, G.: Random walks, gaussian processes and list structures. Lecture Notes in Comp. Sc.214, CAAP 86, 211–224 and Theor. Comp. Sc.53 99–124 (1987).

    Google Scholar 

  12. Louchard, G.: Asymptotic analysis of two variations of interpolation search; LIT Technical Report No 169.

  13. Ostrowski, A. M.:Solution of Equations and Systems of Equations; Academic Press (1986).

  14. Santoro, N., Sidney, J. B.: Interpolation-Binary Search, Information Processing Letters20 179–181 (1985).

    Article  Google Scholar 

  15. Willard, D. E.: Searching unindexed and nonuniformly generated files in log logN time; SIAM J. Compt.14, 4, 1013–1029 (1985).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique Théorique, Université Libre de Bruxelles, B-1050, Brussels, Belgium

    G. Louchard

Authors
  1. G. Louchard
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Louchard, G. Robust variations of interpolation search: An asymptotic analysis. Computing 46, 193–222 (1991). https://doi.org/10.1007/BF02238298

Download citation

  • Received:

  • Issue Date:

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

CR categories

AMS

Key words

Search

Navigation