1. M. Adler, P. B. Gibbons, and Y. Matias. Scheduling space sharing for internet advertising. Technical report, Bell Labs, Lucent Technologies, Murray Hill, NJ 07974, 1997.
2. S. Albers. Better bounds for on-line scheduling. In Proc. 29th Annual ACM Symp. Theory of Comput., pages 130–139, 1997.
3. R. J. Anderson, E. W. Mayr, and M. K. Warmuth. Parallel approximation algorithms for bin packing. Inf. and Comput., 82: 262–277, 1989.
4. S. F. Assmann Problems in Discrete Applied Mathematics. PhD thesis, Mathematics Department MIT, Cambridge, MA, 1983.
5. S. F. Assmann, D. S. Johnson, D. J. Kleitman, and J. Y.-T. Leung. On a dual version of the one-dimensional bin packing problem. J. Algorithms, 5: 502–525, 1984.