1. Albers S, Favrholdt LM, Giel O (2005) On paging with locality of reference. JCSS 70(2): 145–175
2. Angelopoulos S, Schweitzer P (2009) Paging and list update under bijective analysis. In: Proceedings of the twentieth annual ACM-SIAM symposium on discrete algorithms (SODA 2009), New York, 4–6 Jan 2009, pp 1136–1145
3. Angelopoulos S, Dorrigiv R, López-Ortiz A (2007) On the separation and equivalence of paging strategies. In: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms (SODA 2007), New Orleans, 7–9 Jan 2007, pp 229–237
4. Banderier C, Mehlhorn K, Beier R (2003) Smoothed analysis of three combinatorial problems. In: Proceedings of the 28th international symposium on mathematical foundations of computer science 2003 (MFCS 2003), Bratislava, 25–29 Aug 2003, vol 2747, pp 198–207
5. Becchetti L, Leonardi S, Marchetti-Spaccamela A, Schafer G, Vredeveld T (2003) Average case and smoothed competitive analysis of the multi-level feedback algorithm. In: IEEE (ed) Proceedings of the 44th symposium on foundations of computer science (FOCS 2003), Cambridge, 11–14 Oct 2003, pp 462–471