596 citations · 3k across the 50 of their papers we have counts for
1 paper · 1 filter
Marek Chrobak, Mordecai Golin, J. Ian Munro +1
In 1971, Knuth gave an O(n2)-time algorithm for the classic problem of finding an optimal binary search tree. Knuth's algorithm works only for search trees based on 3-way compar…