Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
  • 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.

    https://doi.org/10.1145/3531227

  • 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.

    https://doi.org/10.1145/3447579

  • Anand K, Ge R and Panigrahi D. Customizing ML predictions for online algorithms. Proceedings of the 37th International Conference on Machine Learning. (303-313).

    /doi/10.5555/3524938.3524967

  • Cheng S, Jin K and Yan L. (2020). Extensions of Self-Improving Sorters. Algorithmica. 82:1. (88-106). Online publication date: 1-Jan-2020.

    https://doi.org/10.1007/s00453-019-00604-6

  • Afshani P, Barbay J and Chan T. (2017). Instance-Optimal Geometric Algorithms. Journal of the ACM. 64:1. (1-38). Online publication date: 28-Feb-2017.

    https://doi.org/10.1145/3046673

  • Yampolskiy R. Analysis of Types of Self-Improving Software. Proceedings of the 8th International Conference on Artificial General Intelligence - Volume 9205. (384-393).

    https://doi.org/10.1007/978-3-319-21365-1_39

  • 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).

    https://doi.org/10.1145/2594538.2594547

  • 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.

    https://doi.org/10.1016/j.cor.2014.01.008

  • 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.

    /doi/10.5555/2745046.2745189

  • Löffler M and Mulzer W. Unions of onions. Proceedings of the 13th international conference on Algorithms and Data Structures. (487-498).

    https://doi.org/10.1007/978-3-642-40104-6_42

  • 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).

    https://doi.org/10.1145/2261250.2261291

  • 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.

    https://doi.org/10.1145/1944345.1944347

  • 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).

    /doi/10.5555/2133036.2133171