Jin K, Cheng S, Chiu M and Wong M.
(2022). A Generalization of Self-Improving Algorithms. ACM Transactions on Algorithms. 18:3. (1-32). Online publication date: 31-Jul-2022.
Lykouris T and Vassilvitskii S.
(2021). Competitive Caching with Machine Learned Advice. Journal of the ACM. 68:4. (1-25). Online publication date: 1-Aug-2021.
Anand K, Ge R and Panigrahi D. Customizing ML predictions for online algorithms. Proceedings of the 37th International Conference on Machine Learning. (303-313).
Yampolskiy R. Analysis of Types of Self-Improving Software. Proceedings of the 8th International Conference on Artificial General Intelligence - Volume 9205. (384-393).
Ngo H, Nguyen D, Re C and Rudra A. Beyond worst-case analysis for joins with minesweeper. Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. (234-245).
Rudek R.
(2014). Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models. Computers and Operations Research. 46. (91-101). Online publication date: 1-Jun-2014.
Rudek R.
(2013). The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times. Applied Mathematics and Computation. 221:C. (819-832). Online publication date: 15-Sep-2013.
Clarkson K, Mulzer W and Seshadhri C. Self-improving algorithms for coordinate-wise maxima. Proceedings of the twenty-eighth annual symposium on Computational geometry. (277-286).
Buchin K and Mulzer W.
(2011). Delaunay triangulations in O(sort(n)) time and more. Journal of the ACM. 58:2. (1-27). Online publication date: 1-Apr-2011.
Löffler M and Mulzer W. Triangulating the square and squaring the triangle. Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms. (1759-1777).