Skip to main content
SpringerLink
Log in
Book cover

Mathematics and Computer Science III pp 147–148Cite as

Birkhäuser

On the Stationary Search Cost for the Move-to-Root Rule with Random Weights

  • Conference paper

  • 593 Accesses

Part of the book series: Trends in Mathematics ((TM))

Abstract

Considerabinary search tree containing n items updated according to the move-to-root rule as defined first by Allen and Munro [1]. Assumethat requestprobabilities are themselves random. Formula fortheexpectation is derived from classicalresult and iscomparedto the case of alistupdatedaccordingtothemove-to-frontrule[2].The case ofGamma requestis then studied.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. B. Allen and I. Munro. Self-organizing binary search trees.J. Assoc. Comput. Mach.25:526–535, 1978.

    Article  MathSciNet  MATH  Google Scholar 

  2. J. Barrera and C. Paroissin. On the distribution of the stationary search cost for the move-to-front with random weights.J. Appl. Prob.41(1): 250–262, 2004.

    Article  MathSciNet  MATH  Google Scholar 

  3. R.P. Dobrow and J.A. Fill. On the Markov chain for the move-to-root rule for binary search trees.Ann. Appl. Probab., 5(1):1–19, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  4. J.F.C. Kingman. Random discrete distributions.J. R. Statist. Soc.B37:1–22, 1975.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CMM, Univ. de Chile, Casilla 170-3, Correo 7, Santiago, Chile

    Javiera Barrera

  2. MODAL’X, Univ, Paris X, 200 av. de la République, Nanterre Cedex, 92001, France

    Christian Paroissin

Authors
  1. Javiera Barrera
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christian Paroissin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Discrete Mathematics and Geometry, Vienna University of Technology, Wiedner Hauptstrasse 8-10, Wien, 1040, Austria

    Michael Drmota  & Bernhard Gittenberger  & 

  2. INRIA Rocquencourt, Le Chesnay, 78153, France

    Philippe Flajolet

  3. PRISM, Université de Versailles-St-Quentin, Bâtiment Descartes 45 avenue des Etats-Unis, Versailles Cedex, 78035, France

    Danièle Gardy

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer Basel AG

About this paper

Cite this paper

Barrera, J., Paroissin, C. (2004). On the Stationary Search Cost for the Move-to-Root Rule with Random Weights. In: Drmota, M., Flajolet, P., Gardy, D., Gittenberger, B. (eds) Mathematics and Computer Science III. Trends in Mathematics. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-7915-6_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-7915-6_14

  • Publisher Name: Birkhäuser, Basel

  • Print ISBN: 978-3-0348-9620-7

  • Online ISBN: 978-3-0348-7915-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation