1. Lecture Notes in Computer Science;A. Aggarwal,1987
2. Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.: Cache-oblivious algorithms. In: FOCS Proceedings, pp. 285–297. IEEE Computer Society Press, Los Alamitos (1999)
3. Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202–208 (1985)
4. Munro, I., Spira, P.: Sorting and searching in multisets. SIAM Journal on Computing 5, 1–8 (1976)
5. Arge, L., Knudsen, M., Larsen, K.: A general lower bound on the I/O-complexity of comparison-based algorithms. In: Proceedings of WADS. Springer, Heidelberg (1993)