Edsger W. Dijkstra

Edsger W. Dijkstra (1930–2002) was a Dutch computer scientist whose work shaped algorithms, programming languages, concurrency, and formal verification. He received the 1972 Turing Award.

Structured programming: A programming approach built from clear control structures and modular procedures rather than unrestricted jumps. Dijkstra’s critique of the GOTO statement helped make structured programming a central programming discipline.
Dijkstra's algorithm: A graph-search algorithm that finds shortest paths from one source when edge weights are nonnegative. This algorithm is his best-known contribution to graph theory and remains widely used.
Mathematisch Centrum: A Dutch research institute in Amsterdam, now known as CWI, that conducts research in mathematics and computer science. Dijkstra worked there for much of his career and developed ideas amid its early computing research.
Jacobus van der Corput: A Dutch mathematician known for work in analytic number theory and a leading figure in Dutch mathematics. As Dijkstra’s father-in-law, he connected Dijkstra to the Dutch mathematical community.
GOTO statement: A control-flow instruction that transfers execution directly to a labeled point in a program. His 1968 letter argued that unrestricted jumps obstruct clear reasoning about program correctness.
Semaphore (programming): A synchronization variable that controls access to shared resources through atomic operations. Dijkstra introduced semaphores to coordinate processes competing for shared resources.
Electrologica X1: A Dutch computer designed in the 1950s and built by Electrologica. Dijkstra helped design its software, an experience that shaped his early work on programming.
Carel S. Scholten: A Dutch computer scientist and mathematician who worked on early computer systems and programming languages. Scholten collaborated with Dijkstra on the ALGOL 60 compiler and early computing projects.
Formal verification: The use of mathematical methods to establish that a system satisfies specified properties. Dijkstra developed program proofs as a practical route to dependable software.
Dining philosophers problem: A concurrency problem in which philosophers alternately think and compete for shared forks to eat. Dijkstra formulated this problem to expose deadlock and resource-allocation challenges.

Linked from 9 pages