A Bin Packing Algorithm with Complexity O(n log n) and Performance 1 in the Stochastic Limit

Fundamental discrepancies between average-case analyses under discrete and continuous distributions: a bin packing case study

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing

Bounded space on-line bin packing: best is better than first

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms

Markov chains, computer proofs, and average-case analysis of best fit bin packing

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

Online bin packing with lookahead

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms

Single-machine scheduling with periodic maintenance and nonresumable jobs

Computers and Operations Research

A probabilistic analysis of multidimensional bin packing problems

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing

Review of recent development: Probabilistic behaviour of optical bin-packing solutions

Operations Research Letters