1. Aerts, J., Korst, J., Verhaegh, W.: Complexity of Retrieval Problems. Technical Report NL-MS-20.899, Philips Research Laboratories (2000)
2. Ahuja, R.K., Magnanti, R.L., Orlin, J.B.: Network Flows. Prentice Hall, Englewood Cliffs (1993)
3. Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation Schemes for Scheduling. In: SODA, pp. 493–500 (1997)
4. Computer Architecture News;G.A. Alvarez,1997
5. Andrews, M., Bender, M.A., Zhang, L.: New Algorithms for the Disk Scheduling Problem. In: IEEE (ed.) 37th Annual Symposium on Foundations of Computer Science, pp. 550–559. IEEE Computer Society Press, Los Alamitos (1996)