@article{Knuth71,
  author    = {Donald E. Knuth},
  title     = {Optimum Binary Search Trees},
  journal   = {Acta Inf.},
  volume    = {1},
  pages     = {14--25},
  year      = {1971},
  url       = {https://doi.org/10.1007/BF00264289},
  doi       = {10.1007/BF00264289},
}

@book{Mehlhorn84,
  author    = {Kurt Mehlhorn},
  title     = {Data Structures and Algorithms 1: Sorting and Searching},
  series    = {{EATCS} Monographs on Theoretical Computer Science},
  volume    = {1},
  publisher = {Springer},
  year      = {1984}
}

@article{Monad_Memo_DP-AFP,
  author  = {Simon Wimmer and Shuwei Hu and Tobias Nipkow},
  title   = {Monadification, Memoization and Dynamic Programming},
  journal = {Archive of Formal Proofs},
  year    = 2018,
  note    = {\url{http://isa-afp.org/entries/Monad_Memo_DP.html},
            Formal proof development},
}

@inproceedings{Yao80,
  author    = {F. Frances Yao},
  title     = {Efficient Dynamic Programming Using Quadrangle Inequalities},
  booktitle = {{STOC}},
  pages     = {429--435},
  publisher = {{ACM}},
  year      = {1980}
}
