Edsger Wybe Dijkstra was a Dutch computer scientist, programmer, mathematician and essayist whose fingerprints are on more of this atlas than almost anyone's: the shortest path algorithm that carries his name, conceived in 1956, and the structured programming movement he led, for which he won the 1972 Turing Award. His 1968 letter Go To Statement Considered Harmful gave the movement its rallying cry. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
AwardHarry H. Goode Memorial Award 2 AwardFellow of the British Computer Society 2 Edsger W. Dijkstra
Filter Results4 entries
FAQs
Did Dijkstra himself call his letter Go To Statement Considered Harmful?
The typescript was titled A Case against the GO TO Statement; the published title was Go To Statement Considered Harmful.
The archived typescript of Dijkstra's 1968 letter is titled A Case against the GO TO Statement. The version published in Communications of the ACM in March 1968 appeared under the title Go To Statement Considered Harmful. The archive's note adds that the last two paragraphs and the reference list were added by H. Richards and are absent from the typescript Dijkstra furnished. The note does not say who chose the published title.
Connections
Associated With
Dijkstra coined the term and led the movement; his 1972 Turing Award cites this advocacy.
Source Wikipedia: Structured programming
Edsger Dijkstra's 1968 letter Go To Statement Considered Harmful argued against unrestricted goto statements and is the founding document of the structured programming movement.
Source Wikipedia: Edsger W. Dijkstra
Credited
Source Banker's algorithm (Wikipedia)
Source Dijkstra-Scholten algorithm (Wikipedia)
Source Wikipedia, Prim's algorithm
Source Shunting yard algorithm (Wikipedia)
Source Smoothsort (Wikipedia)
Source Uniform Cost Search (Wikipedia)
In Field
Invented
Source Wikipedia: Dijkstra's Algorithm
Edsger W. Dijkstra formulated the dining philosophers problem in 1965 as a student exam exercise on resource contention.
Source Wikipedia, Prim's algorithm
Edsger W. Dijkstra formulated the producer-consumer problem alongside his work on semaphores in the 1960s.
Edsger W. Dijkstra invented the semaphore synchronization primitive in 1965 for the THE multiprogramming system.
Edsger W. Dijkstra described the shunting yard algorithm for parsing mathematical expressions in a 1961 report.
Source Wikipedia: Edsger W. Dijkstra
Source Smoothsort (Wikipedia)
Source Wikipedia: THE multiprogramming system
Source Uniform Cost Search (Wikipedia)
Invented By
Source Banker's algorithm (Wikipedia)
Source Dijkstra-Scholten algorithm (Wikipedia)
In the Other Atlases
Nationality
Also in Geography Atlas: the nationality of this subject.
Sources
1. Wikipedia: Edsger W. Dijkstra
Wikimedia FoundationLead section
Edsger Wybe Dijkstra ( DYKE-strə; Dutch: [ˈɛtsxər ˈʋibə ˈdɛikstraː] ; 11 May 1930 - 6 August 2002) was a Dutch computer scientist, programmer, mathematician, and science essayist.
Introduction
was a Dutch computer scientist, programmer, mathematician, and science essayist
lead sentence, parenthetical birth date
11 May 1930
- Associated With: Structured Programming
View the Source 2. Wikidata: Edsger W. Dijkstra
E.W. Dijkstra Archive, Obituary, University of Texas at Austin
Obituary page, summary of contributions paragraphQuote, Obituary page, summary of contributions paragraph
He is responsible for the idea of building operating systems as explicitly synchronized sequential processes, for the formal development of computer programs, and for the intellectual foundations for the disciplined control of nondeterminacy.
View the Source Wikipedia: Dijkstra's Algorithm
Wikimedia FoundationInvented: Dijkstra's Algorithm, History sectionQuote, Invented: Dijkstra's Algorithm, History section
It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later.
View the Source Wikipedia: Structured programming
WikipediaAssociated With: Structured Programming, History sectionQuote, Associated With: Structured Programming, History section
Edsger W. Dijkstra, who coined the term structured programming
View the Source Shunting yard algorithm (Wikipedia)
Credited: Shunting Yard Algorithm, Lead sectionQuote, Credited: Shunting Yard Algorithm, Lead section
The algorithm was invented by Edsger Dijkstra
View the Source Smoothsort (Wikipedia)
Invented: Smoothsort, Lead section
invented and published by Edsger Dijkstra in 1981
Credited: Smoothsort, Lead
A variant of heapsort, it was invented and published by Edsger Dijkstra in 1981.
View the SourceUniform Cost Search (Wikipedia)
Credited: Uniform Cost Search Algorithm, Lead section
It was conceived by computer scientist Edsger W. Dijkstra in 1956
Invented: Uniform Cost Search Algorithm, Lead section
It was conceived by computer scientist Edsger W. Dijkstra in 1956
View the SourceWikipedia, Prim's algorithm
Invented: Prim's Algorithm, Lead section
The algorithm was developed in 1930 by Czech mathematician Vojtěch Jarník and later rediscovered and republished by Joseph Kruskal in 1956, Robert C. Prim in 1957, and Edsger W. Dijkstra in 1959.
Credited: Prim's Algorithm, Lead paragraph
later rediscovered and republished by Joseph Kruskal in 1956, Robert C. Prim in 1957, and Edsger W. Dijkstra in 1959
View the SourceDijkstra-Scholten algorithm (Wikipedia)
Invented By: Dijkstra-Scholten algorithm, Lead sentence
The Dijkstra-Scholten algorithm (named after Edsger W. Dijkstra and Carel S. Scholten) is an algorithm for detecting termination in a distributed system.
Credited: Dijkstra-Scholten algorithm, Lead sentence
The Dijkstra-Scholten algorithm (named after Edsger W. Dijkstra and Carel S. Scholten) is an algorithm for detecting termination in a distributed system.
View the SourceBanker's algorithm (Wikipedia)
Invented By: Banker's algorithm, Lead [invented]
deadlock avoidance algorithm developed by Edsger Dijkstra
Credited: Banker's algorithm, Lead [invented]
deadlock avoidance algorithm developed by Edsger Dijkstra
View the SourceWikipedia: THE multiprogramming system
Invented: THE multiprogramming system, Lead sentenceQuote, Invented: THE multiprogramming system, Lead sentence
THE multiprogramming system (THE OS) was a computer operating system designed by a team led by Edsger W. Dijkstra, described in monographs in 1965-66 and published in 1968. Dijkstra never named the system; "THE" is simply the abbreviation of "Technische Hogesc
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.