Sorting can exponentially speed up pure dynamic programming

Stasys Jukna, Hannes Seiwert. Sorting can exponentially speed up pure dynamic programming. Inf. Process. Lett., 159-160:105962, 2020. [doi]

@article{JuknaS20-0,
  title = {Sorting can exponentially speed up pure dynamic programming},
  author = {Stasys Jukna and Hannes Seiwert},
  year = {2020},
  doi = {10.1016/j.ipl.2020.105962},
  url = {https://doi.org/10.1016/j.ipl.2020.105962},
  researchr = {https://researchr.org/publication/JuknaS20-0},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {159-160},
  pages = {105962},
}