Edsger Dijkstra

11 May 1930 – 6 August 2002

Edsger Wybe Dijkstra was a Dutch computer scientist and pioneer of structured programming. He is known for Dijkstra's shortest-path algorithm, foundational work on concurrent programming and semaphores, and his advocacy of programming as a rigorous mathematical discipline.

Comparing
Compare

Lived at the same time

Well-documented people whose lives overlapped with Edsger Dijkstra.

Life events

Born in Rotterdam, Netherlands
11 May 1930

Edsger Dijkstra was born in Rotterdam, Netherlands.

Source: en.wikipedia.org
Birth ✓
Studied at Leiden University
1948

Dijkstra studied mathematics and theoretical physics at the University of Leiden.

Source: en.wikipedia.org
Education ✓
Conceived his shortest-path algorithm
1956

Dijkstra devised the algorithm for finding shortest paths in a graph.

Source: en.wikipedia.org
Achievement ✓
Became professor at Eindhoven University of Technology
1962

Dijkstra joined the mathematics department at Eindhoven.

Source: en.wikipedia.org
Career ✓
Published Go To Statement Considered Harmful
1968

Dijkstra's letter advocating structured programming became highly influential.

Source: en.wikipedia.org
Achievement ✓
Received the Turing Award
1972

Dijkstra won the ACM Turing Award for contributions to programming languages.

Source: en.wikipedia.org
Achievement ✓
Joined the University of Texas at Austin
1984

Dijkstra held the Schlumberger Centennial Chair in Computer Sciences at UT Austin.

Source: en.wikipedia.org
Career ✓
Died in Nuenen, Netherlands
6 August 2002

Dijkstra died of cancer in Nuenen, Netherlands.

Source: en.wikipedia.org
Death ✓