Edsger W. Dijkstra
Who was Edsger W. Dijkstra?
Dutch computer scientist who created fundamental algorithms including Dijkstra's shortest path algorithm and made major contributions to programming language design.
Biographical data adapted from Wikipedia’s article on Edsger W. Dijkstra (CC BY-SA 4.0).
Biography
Edsger Wybe Dijkstra was born on May 11, 1930, in Rotterdam, Netherlands. His father was a chemist, and his mother was talented in mathematics. He went to the Gymnasium Erasmianum in Rotterdam before studying mathematics and physics at Leiden University, eventually focusing more on theoretical physics. His career path changed when Adriaan van Wijngaarden offered him the first computer programmer job in the Netherlands at the Mathematical Centre in Amsterdam. Dijkstra accepted and worked there from 1952 to 1962. At the same time, he pursued a doctorate at the University of Amsterdam, which he completed in 1959. His thesis was about communication with an automatic computer, showing his growing dedication to the theory of computation.
Before Fame
Growing up in Rotterdam during World War II, Dijkstra matured in a Netherlands that was rebuilding in many ways. He showed a strong talent for math and science at the Gymnasium Erasmianum, one of the Netherlands' oldest and most challenging high schools. When he started studying at Leiden University in the early 1950s, computing wasn't yet a formal academic subject. His switch from physics to programming was influenced more by hands-on experience with early computers and guidance from van Wijngaarden than by any structured courses. This self-guided start in a developing field gave Dijkstra a unique basic view of what computing could and should be.
Key Achievements
- Formulated Dijkstra's shortest path algorithm in 1956, now fundamental to network routing and graph theory.
- Co-developed the first compiler for ALGOL 60 with Jaap A. Zonneveld in 1960.
- Designed the THE multiprogramming system, pioneering the use of software-based paged virtual memory and layered system architecture.
- Received the 1972 ACM Turing Award for fundamental contributions to the development of structured programming languages.
- Authored 'Go To Statement Considered Harmful,' a letter that became a cornerstone of the structured programming movement.
Did You Know?
- 01.Dijkstra famously designed his shortest path algorithm in approximately twenty minutes while sitting in a café in Amsterdam in 1956, and published it only in 1959.
- 02.He wrote almost all of his technical reports, known as EWD documents, by hand in a precise, careful script, producing nearly 1,300 numbered manuscripts over his career.
- 03.Dijkstra was strongly opposed to the use of the GOTO statement in programming and his 1968 letter 'Go To Statement Considered Harmful' sparked one of the most debated controversies in the history of software engineering.
- 04.He refused to use a word processor for most of his life, insisting that writing by hand forced greater clarity of thought.
- 05.The Dijkstra Prize, awarded annually for outstanding papers in distributed computing, was renamed in his honor the year after his death in 2002, the same year he had received the original ACM PODC Influential Paper Award.
Family & Personal Life
Awards & Honors
| Award | Year | Details |
|---|---|---|
| Turing Award | 1972 | — |
| ACM Fellow | 1994 | — |
| Dijkstra Prize | 2002 | — |
| Harry H. Goode Memorial Award | 1974 | — |
| Fellow of the British Computer Society | 1971 | — |
| Computer Pioneer Award | 1982 | — |
| C&C Prize | 2002 | — |