^ Algorithms on the Hierarchical Memory Model M. C. Loui,* S. Thite University of Illinois
The hierarchical memory model (HMM) of computation is similar to the standard random-access model, except that the memory of the HMM is organized in levels with progressively longer access times. Researchers designed several dynamic programming algorithms for the construction of minimum cost binary search trees on the HMM. The research team also designed an efficient algorithm to construct a binary search tree that is close to the optimum.
