1. Akin, E., Davis, M.: Bulgarian solitaire. Am. Math. Mon. 92(4), 237–250 (1985)
2. Aldous, D., Diaconis, P.: Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem. Bull. Am. Math. Soc. (N.S.) 36(4), 413–432 (1999)
3. Andrews, M., Bender, M.A., Zhang, L.: New algorithms for the disk scheduling problem. In: 37th Annual Symposium on Foundations of Computer Science (Burlington, VT, 1996), pp. 550–559, IEEE Computer Society Press, Los Alamitos (1996)
4. Aven, O.I., Coffman, E.G. Jr., Kogan, Ya.A.: Stochastic Analysis of Computer Storage. Mathematics and Its Applications, vol. 38. D. Reidel Publishing Co., Dordrecht (1987)
5. Bachmat, E., Elhanan, I.: Analysis of the GSTF disk scheduling algorithm. Perform. Eval. Rev. 41(3), 13–15 (2013)