Einige Bemerkungen zu einer Bin-Packing Aufgabe von W. Knödel

Abstract. W. Kn\"odel 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\"odels 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.

This paper is available in the Tex, Dvi, and PostScript format.
(Back to List of Papers)