1. Aleeva, V.N.: Analysis of parallel numerical algorithms: Preprint No. 590. Novosibirsk, Computing Center of the Siberian Branch of the Academy of Sciences of the USSR (1985)
2. Ignatyev, S.V.: Definition of parallelism resource of algorithms on the base of the concept of $$Q$$-determinant. In: Scientific Service on the Internet: Supercomputer Centers and Tasks: Proceedings of the International Supercomputer Conference, Novorossijsk, Russia, September 20–25, 2010, pp. 590–595. Publishing of the Moscow State University, Moscow (2010)
3. Svirihin, D.I.: Definition of parallelism resource of algorithm and its effective use for of a finite number of processors. In: Scientific Service on the Internet: the Search for New Solutions: Proceedings of the International Supercomputer Conference, Novorossijsk, Russia, September 17–22, 2012, pp. 257–260. Publishing of the Moscow State University, Moscow (2012)
4. Svirihin, D.I., Aleeva, V.N.: Definition the maximum effective realization of algorithm on the base of the conception of $$Q$$-determinant. In: Parallel Computational Technologies (PCT’2013): Proceedings of the International Scientific Conference, Chelyabinsk, Russia, April 1–5, 2013, p. 617. Publishing of the South Ural State University, Chelyabinsk (2013)
5. Aleeva, V.N.: The parallelization of algorithms on the base of the conception of $$Q$$-determinant. In: Groups and Graphs, Algorithms and Automata, 2015: Abstracts of the International Conference and PhD Summer School of the 80th Birthday of Professor Vyacheslav A. Belonogov and of the 70th Birthday of Professor Vitaly A. Baransky (Yekaterinburg, Russia, August 9–15, 2015), p. 33. UrFU Publishing house, Yekaterinburg (2015)