Yuri Ofman
Jump to navigation
Jump to search
Template:Short description Yuri Petrovich Ofman (Template:Langx, born 1939) is a Russian mathematician who works in computational complexity theory.
He obtained his Doctorate from Moscow State University, where he was advised by Andrey Kolmogorov.[1][2] He did important early work on parallel algorithms for prefix sums and their application in the design of Boolean circuits for addition.
Publications
- Script error: No such module "Citation/CS1".
- Script error: No such module "Citation/CS1". Translated in Script error: No such module "Citation/CS1".
- Anatolii A. Karatsuba and Yu. P. Ofman (1962), "Умножение многозначных чисел на автоматах" ("Multiplication of Many-Digital Numbers by Automatic Computers"), Doklady Akademii Nauk SSSR, vol. 146, pages 293–294. (Published by A. N. Kolmogorov, with two separate results by the two authors.[3])
- Yu. P. Ofman (1965), "A universal automaton". Transactions of the Moscow Mathemathematical Society, volume 14, pages 200–215.
References
<templatestyles src="Reflist/styles.css" />
- ↑ Template:PAGENAMEBASE at the Mathematics Genealogy ProjectTemplate:EditAtWikidata
- ↑ Script error: No such module "citation/CS1".
- ↑ S. A. Gricenko, E. A. Karatsuba, M. A. Korolyov, I. S. Rezvyakova, D. I. Tolev, and M. E. Changa (2012). "Научные достижения Анатолия Алексеевича Карацубы" ("Scientific contributions of A. A. Karatsuba"). Современные проблемы математики, volume 16, issue 0, pages 7-30.
Script error: No such module "Check for unknown parameters".