E. G. Coffman-jr, M. R. Garey, and D. S. Johnson, Approximation algorithms for binpacking: An updated survey, Algorithm Design for Computer System Design, pp.49-106, 1984.

E. G. Coffman, J. , M. R. Garey, and D. S. Johnson, Approximation algorithms for bin packing: A survey Approximation Algorithms for NP-Hard Problems, PSW publishing, pp.46-93, 1996.

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, issue.5, pp.1555-1566, 1993.
DOI : 10.1109/18.259640

E. G. Coffman, J. , C. A. Courcoubetis, M. R. Garey, D. S. Johnson et al., Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings, SIAM Journal on Discrete Mathematics, vol.13, issue.3, pp.384-402, 2000.
DOI : 10.1137/S0895480197325936

E. G. Coffman-jr, K. So, M. Hofri, and A. C. Yao, A stochastic model of bin-packing, Information and Control, vol.44, issue.2, pp.105-115, 1980.
DOI : 10.1016/S0019-9958(80)90050-9

E. G. Coffman, J. , and G. S. Lueker, Probabilistic Analysis of Packing and Partitioning Algorithms, 1991.

D. K. Friesen and M. A. Langston, Analysis of a Compound Bin Packing Algorithm, SIAM Journal on Discrete Mathematics, vol.4, issue.1, pp.61-79, 1991.
DOI : 10.1137/0404007

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

A. Guntsch, Analysis of the ATDMA/PRMA++ protocol in a mobile satellite system environment, Proceedings of Vehicular Technology Conference, VTC, pp.1225-1234, 1996.
DOI : 10.1109/VETEC.1996.501507

M. Hofri, A probabilistic analysis of the Next-Fit bin packing algorithm, Journal of Algorithms, vol.5, issue.4, pp.547-556, 1984.
DOI : 10.1016/0196-6774(84)90007-5

D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham, Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms, SIAM Journal on Computing, vol.3, issue.4, pp.299-325, 1974.
DOI : 10.1137/0203025

D. S. Johnson, Fast algorithms for bin packing, Journal of Computer and System Sciences, vol.8, issue.3, pp.272-314, 1974.
DOI : 10.1016/S0022-0000(74)80026-7

N. Karmarkar, Probabilistic analysis of some bin packing algorithms, Proc. 23rd IEEE FOCS, pp.107-111, 1982.

N. Karmarkar and R. M. Karp, An efficient approximation scheme for the one-dimensional bin-packing problem, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), pp.312-320, 1982.
DOI : 10.1109/SFCS.1982.61

H. Koraitim and S. Tohme, Performance analysis of multiple access protocols for multimedia satellite networks, IEEE Journal on Selected Areas in Communications, vol.18, issue.9, pp.1751-63, 2000.
DOI : 10.1109/49.872961

C. A. Mandal, P. Chakrabarti, and S. Ghose, Complexity of fragmentable object bin packing and an application, Computers & Mathematics with Applications, vol.35, issue.11, pp.91-98, 1998.
DOI : 10.1016/S0898-1221(98)00087-X

N. Menakerman and R. Rom, Bin packing problems with item fragmentation, 2001.
DOI : 10.1007/3-540-44634-6_29
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.7845

T. Rhee and M. Talagrand, Martingale Inequalities and NP-Complete Problems, Mathematics of Operations Research, vol.12, issue.1, pp.177-181, 1987.
DOI : 10.1287/moor.12.1.177