Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Gashkov S. B., Grinchuk M. I., Sergeev I. S., “O postroenii skhem summatorov maloi glubiny”, Diskret. analiz i issled. operatsii. Ser. 1, 14:1 (2007), 27–44 | MR
[2] Lupanov O. B., Asimptoticheskie otsenki slozhnosti upravlyayuschikh sistem, Izd-vo MGU, M., 1984
[3] Redkin N. P., “O minimalnoi realizatsii dvoichnogo summatora”, Problemy kibernetiki, Vyp. 38, Nauka, M., 1981, 181–216 | MR
[4] Khrapchenko V. M., “Ob asimptoticheskoi otsenke vremeni slozheniya parallelnogo summatora”, Problemy kibernetiki, Vyp. 19, Nauka, M., 1967, 107–122
[5] Khrapchenko V. M., “Ob odnoi iz vozmozhnostei utochneniya otsenok dlya zaderzhki parallelnogo summatora”, Diskret. analiz i issled. operatsii. Ser. 1, 14:1 (2007), 87–93 | MR
[6] Gashkov S. B., Andreev A. E., Lu A., Optimization of comparator architecture, United States patent 6691283. 10.2.2004
[7] Gashkov S. B., Andreev A. E., Lu A., Optimization of adder based circuit architecture, United States patent 6934733. 23.8.2005
[8] Grinchuk M. I., Low depth circuit design, United States patent application, 2008
[9] Grinchuk M. I., Bolotov A. A., Process for designing comparators and adders of small depth, United States patent 7020865. 28.3.2006
[10] Savage J. E., The complexity of computing, Wiley-Interscience, New York etc., 1976 | MR | Zbl