1. Fekete, S.P., Kamphans, T., Schweer, N., Tessars, C., van der Veen, J.C., Angermeier, J., Koch, D., Teich, J.: No-break dynamic defragmentation of reconfigurable devices. In: Proc. Internat. Conf. Field Program. Logic Appl. (FPL 2008) (2008)
2. Knuth, D.E.: The Art of Computer Programming: Fundamental Algorithms, 3rd edn., vol. 1. Addison-Wesley, Reading (1997)
3. Luby, M.G., Naor, J., Orda, A.: Tight bounds for dynamic storage allocation. SIAM Journal on Discrete Math. 9, 155–166 (1996)
4. Naor, J., Orda, A., Petruschka, Y.: Dynamic storage allocation with known durations. Discrete Applied Mathematics 3, 203–213 (2000)
5. Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: A survey. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 46–93. PWS Publishing Company, Boston (1996)