Edsger W. Dijkstra

Dutch computer scientist (1930–2002)

graph search algorithm

variable that is changed (e.g., incremented, decremented, toggled) depending on programmer-defined conditions, used to control access to a common resource by multiple processes in a concurrent system

thumb|right|upright|"GOTO" key on the 1982 ZX Spectrum home computer, implemented with native [[BASIC (one-key command entry).]]

problem used to illustrate synchronization issues and techniques for resolving them

problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized

resource allocation and deadlock avoidance algorithm

the first known correct solution to the mutual exclusion problem in concurrent programming

thumb|upright=1.2|Equivalent paths between A and B in a 2D environment

family of computing problems

research institute

Operating system

interprocess communication/synchronization problem between multiple OS processes, using an analogy of a barbershop, in which the barber wishes to nap when there are no customers, and customers wish to have their hair cut as soon as possible

In computer science, smoothsort is a comparison-based sorting algorithm. A variant of heapsort, it was invented and published by Edsger Dijkstra in 1981. Like heapsort, smoothsort is an in-place algorithm with an upper bound of operations (see big O notation). Like heapsort, smoothsort is not a stable sort. The advantage of smoothsort is that it comes closer to time if the input is already sorted to some degree, whereas heapsort averages regardless of the initial sorted state.

reformulation of Floyd-Hoare logic

phrase used in titles of diatribes and other critical essays

formal language for predicate transformer semantics introduced by by Edsger Dijkstra

programming problem proposed by Edsger Dijkstra