Skip to main content
Springer Nature Link
Log in

Einige Kommentare zu einer bin-packing Aufgabe von W. Knödel

Some comments on a bin-packing problem of W. Knödel

  • Published:
Computing Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

W. Knödel has considered a bin-packing problem which can be seen within the context of random walks. The height of a random walk is a well studied parameter which can also be defined in Knödels model. Its average is computed and shown to be of order\(\sqrt n \). The methods include singularity analysis of generating functions as well as Mellin transforms.

Zusammenfassung

W. Knödel hat einbin-packing Problem betrachtet, das im Kontext der Zufallspfade gesehen werden kann. Die Höhe eines Zufallspfades ist ein eingehend untersuchter Parameter, der auch in Knödels Modell definiert werden kann. Es zeigt sich, daß der Erwartungswert von der Ordnung\(\sqrt n \) ist. Um dies zu zeigen werden u.a. die Singularitäten der erzeugenden Funktionen studiert sowie die Mellintransformation verwendet.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Literatur

  1. Abramowitz, M., Stegun, I. A.: Handbook of mathematical functions. New York: Dover Publications 1970.

    Google Scholar 

  2. De Bruijn, N. G., Knuth, D. E., Rice, S. O.: The average height of planted plane trees. In Read, R. C. (ed.) Graph theory and computing. New York, London: Academic Press, pp. 15–22, 1972.

    Google Scholar 

  3. Flajolet, P., Odlyzko, A. M.: Singularity analysis of generating functions. SIAM J. Disc. Math.3, 216–240 (1990).

    Article  MathSciNet  Google Scholar 

  4. Flajolet, P., Vitter, J. S.: Average-case analysis of algorithms and data structures. In: van Leeuwen J. (ed.) Handbook of theoretical computer science. North-Holland, 1990.

  5. Knödel, W.: Über das mittlere Verhalten von on-line Packungsalgorithmen. EIK19, 427–433 (1983).

    Google Scholar 

  6. Panny, W., Prodinger, H.: The expected height of paths for several notions of height. Stud. Sci. Math. Hung.20, 119–132 (1985).

    MathSciNet  Google Scholar 

  7. Prodinger, H.: Einige Bemerkungen zu einer Arbeit von W. Knödel über das mittlere Verhalten von on-line-Packungsalgorithmen. EIK21, 3–7 (1985).

    MATH  MathSciNet  Google Scholar 

  8. Prodinger, H.: Further results on a problem of Knödel converning the analysis of Bin-Packing. In: Hlawka, E., Tichy, R. F. (eds) Number-theoretic analysis. Lecture Notes in Mathematics1452, 193–198 (1990).

Download references

Author information

Authors and Affiliations

  1. Technische Universität Wien, Wiedner Hauptstraße 8-10, A-1040, Wien, Austria

    H. Prodinger

Authors
  1. H. Prodinger
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

Herrn Professor W. Knödel zum 65. Geburtstag gewidmet

Rights and permissions

Reprints and permissions

About this article

Cite this article

Prodinger, H. Einige Kommentare zu einer bin-packing Aufgabe von W. Knödel. Computing 47, 247–254 (1992). https://doi.org/10.1007/BF02320195

Download citation

  • Received:

  • Issue Date:

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

AMS Subject Classification

Key words