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.
This article about a Russian mathematician is a stub.
You can help Wikipedia by expanding it.