1. Adamaszek, A., Czumaj, A., Englert, M., & Räcke, H. (2011). Almost tight bounds for reordering buffer management. In L. Fortnow & S. P. Vadhan (Eds.), STOC (pp. 607–616). San Jose: ACM Press.
2. Albers, S., & Hellwig, M. (2014). Online makespan minimization with parallel schedules. In: Ravi, R., Gørtz, I. L. (eds.) Algorithm theory—SWAT 2014—14th Scandinavian symposium and workshops, Copenhagen, July 2–4. Proceedings, Lecture notes in computer science (Vol. 8503, pp. 13–25). Springer. doi:
10.1007/978-3-319-08404-6_2
.
3. Asahiro, Y., Kawahara, K., & Miyano, E. (2012). Np-hardness of the sorting buffer problem on the uniform metric. Discrete Applied Mathematics, 160(10–11), 1453–1464.
4. Avigdor-Elgrabli, N., & Rabani, Y. (2010). An improved competitive algorithm for reordering buffer management. In M. Charikar (Ed.), SODA (pp. 13–21). Philadelphia: SIAM.
5. Avigdor-Elgrabli, N., & Rabani, Y. (2013). A constant factor approximation algorithm for reordering buffer management. In S. Khanna (Ed.), SODA (pp. 973–984). Philadelphia: SIAM.