The maximum of a random walk and its application to rectangle packing

Probability in the Engineering and Informational Sciences

Volumn 12, Issue 3, 1998, Pages 373-386

  Coffman Jr , E G ^a   Flajolet, Philippe ^b   Flatto, Leopold ^a   Hofri, Micha ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b INRIA ROCQUENCOURT   (France)

^c Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RANDOM PROCESSES;

ITS APPLICATIONS; LARGE N; RANDOM WALK; RECTANGLE PACKING; UPPER BOUND;

GEOMETRY;

EID: 0032387784     PISSN: 02699648     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0269964800005258     Document Type: Article

References (7)

1. Abramowitz, M. & Stegun, I.A. (1972). Handbook of mathematical functions. New York: Dover Publications.
2. Coffman, E.G., Jr. & Lagarias, J.C. (1989). A probabilistic analysis of square packing. SIAM Journal of Computing 18: 166-185.
3. Coffman, E.G., Jr. & Shor, P.W. (1993). Packing in two dimensions: Asymptotic average-case analysis of algorithms. Algorithmica 9(3): 253-277.
4. Feller, W. (1971). An introduction to probability theory and its applications, Vol. II, 2nd ed. New York: John Wiley & Sons.
5. Henrici, P. (1977). Applied and computational complex analysis, Vol. II. New York: John Wiley & Sons.
6. Hofri, M. (1995). Analysis of algorithms: Computational methods & mathematical tools. New York: Oxford University Press.
7. Olver, F.W.J. (1974). Asymptotics and special functions. New York: Academic Press.