Skip to content
Trackfame
Join
Edsger W. Dijkstra
Science Technology

Edsger W. Dijkstra

Dutch computer scientist famous for the shortest-path algorithm and structured programming

11 May 1930 – 6 August 2002 Netherlands Verified by our editors
Follow 0 followers Correction Cite
Lived
72 yrs
1930 – 2002
Works listed
3
Paper, Letter
Honours
3
Most recent 2002
Profile views
4
0 followers

Edsger Dijkstra was a Dutch computer scientist whose shortest-path algorithm is used in maps and network routing today. He championed structured programming, invented semaphores for concurrent programs and received the Turing Award in 1972.

Biography

Netherlands’ first programmer

Dijkstra studied theoretical physics at Leiden and in 1952 began programming at the Mathematical Centre in Amsterdam, describing himself as the first professional programmer in the Netherlands.

Shortest paths

In 1956, while thinking in a café, he designed an algorithm to find the shortest route between two points in a network. Published in 1959, Dijkstra’s algorithm remains one of the most widely taught algorithms and is used in navigation and internet routing.

Structured programming and concurrency

He wrote one of the first ALGOL 60 compilers and the THE multiprogramming system. He introduced the semaphore and the “dining philosophers” problem for reasoning about programs that run at the same time. His 1968 letter “Go To Statement Considered Harmful” started the movement towards structured programming.

Teacher and writer

Dijkstra taught at Eindhoven and from 1984 at the University of Texas at Austin. He wrote more than 1,300 essays, known as EWDs, many by hand with a fountain pen. He died in Nuenen in 2002; a prize in distributed computing was renamed after him that year.

Timeline

  1. 1930

    Born in Rotterdam, Netherlands

  2. 1952

    Starts programming at the Mathematical Centre, Amsterdam

  3. 1959

    Publishes his shortest-path algorithm

  4. 1960

    Completes an early ALGOL 60 compiler

  5. 1968

    “Go To Statement Considered Harmful”

  6. 1972

    Receives the Turing Award

  7. 1984

    Joins the University of Texas at Austin

  8. 2002

    Dies in Nuenen, Netherlands

  9. 2002

    Died, aged 72

Notable works

  • 1959

    A Note on Two Problems in Connexion with Graphs Paper

    Introduced Dijkstra’s algorithm.

  • 1968

    Go To Statement Considered Harmful Letter

    Communications of the ACM.

  • 1976

    A Discipline of Programming Book

Awards and honours

  • Turing Award

    1972

  • Computer Pioneer Award

    1982

  • Dijkstra Prize

    2002 · The prize was renamed in his honour.

Did you know?

  1. 1

    He said he designed the shortest-path algorithm in about twenty minutes, without pencil and paper.

  2. 2

    His famous quote: “Computer science is no more about computers than astronomy is about telescopes” is often attributed to him.

  3. 3

    His handwritten EWD manuscripts are archived online by the University of Texas.

Frequently asked

Who is Edsger W. Dijkstra?

Edsger Dijkstra was a Dutch computer scientist whose shortest-path algorithm is used in maps and network routing today. He championed structured programming, invented semaphores for concurrent programs and received the Turing Award in 1972.

When did Edsger W. Dijkstra die?

Edsger W. Dijkstra died on 6 August 2002 at the age of 72.

Where is Edsger W. Dijkstra from?

Edsger W. Dijkstra was born in Rotterdam, Netherlands.

What is Edsger W. Dijkstra known for?

Edsger W. Dijkstra is best known for Dijkstra’s algorithm; structured programming; semaphores; “Go To Statement Considered Harmful”; Turing Award 1972.

What awards has Edsger W. Dijkstra received?

Notable honours include Turing Award (1972), Computer Pioneer Award (1982), Dijkstra Prize (2002).

References

  1. Edsger W. Dijkstra — Wikipedia. Wikipedia. Retrieved 4 November 2026.
  2. Edsger W. Dijkstra — Britannica. Encyclopaedia Britannica. Retrieved 4 November 2026.
  3. Edsger W. Dijkstra — Goodreads author page. Goodreads. Retrieved 4 November 2026.
  4. Edsger W. Dijkstra (Q8556) — structured data. Wikidata. Retrieved 4 November 2026.

Includes material from the Wikipedia article “Edsger W. Dijkstra”, licensed under CC BY-SA 4.0. That text is available under the same licence. Learn more

External links

Wikipedia
Filed under AlgorithmsStructured programmingTuring Award Computer ScientistProfessor

About this profile

Cite this page

“Edsger W. Dijkstra.” TrackFame, last updated 5 November 2026. https://trackfame.com/person/edsger-dijkstra

Discussion 0

Sign in or create an account to join the discussion.

No comments yet — be the first.

More in Science

See all
Marvin Minsky Science

Marvin Minsky

Co-founder of MIT’s artificial intelligence laboratory and a founding father of AI

1927 – 2016

Margaret Hamilton Science

Margaret Hamilton

MIT engineer who led the software for the Apollo Moon landings and coined “software engineering”

1936 – 2026

Yann LeCun Science

Yann LeCun

French-American AI pioneer who invented convolutional neural networks

Born 1959

Nikola Tesla Science

Nikola Tesla

Serbian-American inventor of the alternating-current induction motor

1856 – 1943

Michael Faraday Science

Michael Faraday

Self-taught scientist who discovered electromagnetic induction

1791 – 1867

M. Visvesvaraya Science

M. Visvesvaraya

Engineer and statesman, whose birthday is India’s Engineers’ Day

1860 – 1962