1. S. Albers and M. Mitzenmacher. Average-Case Analysis of First Fit and Random Fit Bin Packing.Proceedings of the Ninth Annual ACM-SIAM Symosium on Discrete Algorithms (1998), pp. 290–299.
2. H. Chen. Fluid Approximations and Stability of Multiclass Queueing Networks: Work-Conserving Disciplines.Annals of Applied Probability, Vol. 5 (1995), pp. 637–665.
3. E. G. Coffman, Jr., A. Feldmann, N. Kahale, and B. Poonen. Computing Call Admission Capacities in Linear Networks. Bell Labs, Lucent Technologies, Murray Hill, NJ 07974 (1997), submitted for publication.
4. E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson. Approximation Algorithms for Bin Packing: A Survey. InApproximation Algorithms for NP-Complete Problems, D. S. Hochbaum (ed.). PWS, Boston, MA (1995), pp. 46–93.
5. E. G. Coffman, Jr., S. Halfin, A. Jean-Marie, and P. Robert. Stochastic Analysis of a Slotted, FIFO Communication Channel.IEEE Transactions on Information Theory, Vol. 39 (1993), pp. 1555–1566.