Yuri Petrovich Ofman

From Wikipedia, the free encyclopedia
Jump to: navigation, search

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.


  • "О приближенной реализации непрерывных функций на автоматах" [On the approximate realization of continuous functions on automata]. Doklady Akademii Nauk SSSR. 152 (4): 823–826. 1963. 
  • "Об алгоритмической сложности дискретных функций" [On the algorithmic complexity of discrete functions]. Doklady Akademii Nauk SSSR. 145 (1): 48–51. 1962.  Translated in Soviet Physics Doklady. 7: 589.  Missing or empty |title= (help)
  • Yu. P. Ofman (1965), A universal automaton. Transactions of the Moscow Mathemathematical Society, vol. 14, pp. 200–215.


  1. ^ Yuri Petrovich Ofman at the Mathematics Genealogy Project
  2. ^ Ofman, Ju.[permanent dead link] at the AMS MathSciNet database. Accessed on 2010-01-09.