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

  • "О приближенной реализации непрерывных функций на автоматах" [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.
  • Yu. P. Ofman (1965), A universal automaton. Transactions of the Moscow Mathemathematical Society, vol. 14, pp. 200–215.

References

  1. ↑ Yuri Petrovich Ofman at the Mathematics Genealogy Project
  2. ↑ "Ofman, Ju". MathSciNet. Retrieved 2018-01-20. (Subscription required (help)).



This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.