T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, "Introduction to Algorithms", 3rd Edition, MIT Press, Cambridge, MA, 2009.
has been cited by the following article:
TITLE: Reduction in Complexity of the Algorithm by Increasing the Used Memory - An Example
AUTHORS: Leonid Kugel, Victor A. Gotlib
KEYWORDS: Algorithm; Complexity Reduction; Memory Usage
JOURNAL NAME: American Journal of Computational Mathematics, Vol.3 No.3B, October 25, 2013
ABSTRACT: An algorithm complexity, or its efficiency, meaning its time of evaluation is the focus of primary care in algorithmic problems solving. Raising the used memory may reduce the complexity of algorithm drastically. We present an example of two algorithms on finite set, where change the approach to the same problem and introduction a memory array allows decrease the complexity of the algorithm from the order O(n2) up to the order O(n).