Yuri Petrovich Ofman

Yuri Petrovich Ofman (Russian: Ю́рий Петро́вич Офман, 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

References

  1. Yuri Petrovich Ofman at the Mathematics Genealogy Project
  2. Ofman, Ju. at the AMS MathSciNet database. Accessed on 2010-01-09.
This article is issued from Wikipedia - version of the 7/21/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.