G. L. Abdulgalimov, S. M. Yevstigneev and L. A. Kugel, "Analysis of the Data for Teaching the Basics of Programming", Proceedings of the X National Russian Conference "IT Education in the Russian Federation", 16-18 May 2012, Moscow, Moscow State University, pp 273-275 (in Russian). http://2012.xn----8sbacgtleg3cfdxy.xn--p1ai/upload/IT-EDUCATION-2012-book.pdf

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).