1. A. Borodin, and R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, 1998.
2. E. Coffman, “An introduction to combinatorial models of dynamic storage allocation”, SIAM Review, 25, 311–325, 1999.
3. M. Garey and D. Johnson, Computers and Intractability: A Guide to NPcompleteness, W.H. Freeman and Company, 1979.
4. J. Gergov, “Approximation algorithms for dynamic storage allocation”, European Symposium on Algorithms, 52–61, 1996.
5. J. Gergov, “Algorithms for compile-time memory allocation”, ACM/SIAM Symposium on Discrete Algorithms, S907–S908, 1999.