1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman, Data structures and algorithms, Addison-Wesley, 1983.
2. M. Chrobak, M. Slusarek, On some packing problem related to dynamic storage allocation, RAIRO Informatique Theorique et Applications
22 (1988), pp. 487–499.
3. D. Detlefs, A. Dosser, and B. Zorn, Memory allocation costs in large C and C++ programs, Software: Practice and Experience, 24 (6), 1994, pp. 527–542.
4. M.R. Garey and D.S. Johnson, Computers and Intractability—A Guide to the Theory of NP-Completeness, Freeman, (1979).
5. H.A. Kierstead and W.T. Trotter, An extremal problem in recursive combinatorics, Congr. Numerantium
33 (1981), pp. 143–153.