Skip to main content
SpringerLink
Log in

“Balls into Bins” — A Simple and Tight Analysis

  • Conference paper
  • First Online:
Randomization and Approximation Techniques in Computer Science (RANDOM 1998)

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

Abstract

Suppose we sequentially throw m balls into n bins. It is a natural question to ask for the maximum number of balls in any bin. In this paper we shall derive sharp upper and lower bounds which are reached with high probability. We prove bounds for all values of m(n) ≧ n/polylog(n) by using the simple and well-known method of the first and second moment.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Y. Azar, A.Z. Broder, A.R. Karlin, and E. Upfal. On-line load balancing (extended abstract). In 33rd Annual Symposium on Foundations of Computer Science, pages 218–225, Pittsburgh, Pennsylvania, 24–27 October 1992. IEEE.

    Google Scholar 

  2. B. Bollobás. Random graphs. Academic Press, New York-San Francisco-London-San Diego, 1985.

    MATH  Google Scholar 

  3. A. Czumaj and V. Stemann. Randomized allocation processes. In 38th Annual Symposium on Foundations of Computer Science, pages 194–203, 1997.

    Google Scholar 

  4. G.H. Gonnet. Expected length of the longest probe sequence in hash code searching. J. ACM, 28(2):289–304, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  5. N. Johnson and S. Kotz. Urn Models and Their Applications. John Wiley and Sons, 1977.

    Google Scholar 

  6. M.D. Mitzenmacher. The Power of Two Choices in Randomized Load Balancing. PhD thesis, Computer Science Department, University of California at Berkeley, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Technische Universität München, D-80290, München

    Martin Raab & Angelika Steger

Authors
  1. Martin Raab
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Angelika Steger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. International Computer Science Institute, 1947 Center Street, Suite 600, Berkeley, CA, 94704-1198, USA

    Michael Luby

  2. Computer Science Department, University of Geneva, 24, rue Général Dufour, CH-1211, Geneva 4, Switzerland

    José D. P. Rolim

  3. University of Barcelona (UPC), Jordi Girona Salgado 1-3, E-08034, Barcelona, Spain

    Maria Serna

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Raab, M., Steger, A. (1998). “Balls into Bins” — A Simple and Tight Analysis. In: Luby, M., Rolim, J.D.P., Serna, M. (eds) Randomization and Approximation Techniques in Computer Science. RANDOM 1998. Lecture Notes in Computer Science, vol 1518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49543-6_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-49543-6_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65142-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation