Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Yefim Dinitz

Also Known As E. A. Dinic · Y. A. Dinitz · Yefim Abramovich Dinitz
Theory of Computation

Yefim Abramovich Dinitz is a Soviet and Israeli computer scientist associated with the Moscow school of polynomial-time algorithms. He invented what is now called Dinic's algorithm for computing maximum flow in a network, and was one of the inventors of the Four Russians' method for multiplying Boolean matrices. He studied under Georgy Adelson-Velsky and later Shimon Even, and has held positions at Moscow State University, the Technion, and Ben-Gurion University.

Yefim Dinitz
Filter Results1 entry
Connections

Credited

Source Dinic's Algorithm (Wikipedia)

In Field

Source Yefim Dinitz (Wikipedia)

Invented

Source Dinic's Algorithm (Wikipedia)
In the Other Atlases

Nationality

Also in Geography Atlas: the nationality of this subject.

Also in Geography Atlas: the nationality of this subject.

Sources
Wikidata: Yefim Dinitz
Wikidata Q124032879, resolved via en.wikipedia pageprops (wave rule R-L)View the Source
Yefim Dinitz (Wikipedia)
  • In Field: Algorithms and Complexity Theory, Lead section
    Yefim Dinitz (Russian: Ефим Абрамович Диниц, Hebrew: יפים דיניץ) is a Soviet and Israeli computer scientist associated with the Moscow school of polynomial-time algorithms.
  • In Field: Algorithms and Complexity Theory, Lead paragraph
View the Source
Dinic's Algorithm (Wikipedia)
  • Invented: Dinic's Algorithm, Lead
    Dinic's algorithm or Dinitz's algorithm is a strongly polynomial algorithm for computing the maximum flow in a flow network, conceived in 1970 by Israeli (formerly Soviet) computer scientist Yefim Dinitz.
  • Credited: Dinic's Algorithm, Lead
    Dinic's algorithm or Dinitz's algorithm is a strongly polynomial algorithm for computing the maximum flow in a flow network, conceived in 1970 by Israeli (formerly Soviet) computer scientist Yefim Dinitz.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.