- Editors:
- Krzysztof R. Apt,
- Tony Hoare
ACM Books
Edsger Wybe Dijkstra (1930–2002) was one of the most influential researchers in the history of computer science, making fundamental contributions to both the theory and practice of computing. Early in his career, he proposed the single-source shortest path algorithm, now commonly referred to as Dijkstra’s algorithm. He wrote (with Jaap Zonneveld) the first ALGOL 60 compiler, and designed and implemented with his colleagues the influential THE operating system. Dijkstra invented the field of concurrent algorithms, with concepts such as mutual exclusion, deadlock detection, and synchronization. A prolific writer and forceful proponent of the concept of structured programming, he convincingly argued against the use of the Go To statement. In 1972 he was awarded the ACM Turing Award for ‘fundamental contributions to programming as a high, intellectual challenge; for eloquent insistence and practical demonstration that programs should be composed correctly, not just debugged into correctness; for illuminating perception of problems at the foundations of program design.’ Subsequently he invented the concept of self-stabilization relevant to fault-tolerant computing. He also devised an elegant language for nondeterministic programming and its weakest precondition semantics, featured in his influential 1976 book A Discipline of Programming in which he advocated the development of programs in concert with their correctness proofs. In the later stages of his life, he devoted much attention to the development and presentation of mathematical proofs, providing further support to his long-held view that the programming process should be viewed as a mathematical activity.
In this unique new book, 31 computer scientists, including five recipients of the Turing Award, present and discuss Dijkstra’s numerous contributions to computing science and assess their impact. Several authors knew Dijkstra as a friend, teacher, lecturer, or colleague. Their biographical essays and tributes provide a fascinating multi-author picture of Dijkstra, from the early days of his career up to the end of his life
Preface
Photo Credits
Cited By
-
Brown Requist K and Momayez M (2024). Minimum Cost Pathfinding Algorithm for the Determination of Optimal Paths under Airflow Constraints, Mining, 10.3390/mining4020025, 4:2, (429-446)
-
Huang X, Ding J, Ben J, Zhou J and Liang Q (2023). Unified Multi-structural Element Modeling Methods Using Icosahedral Discrete Global Grid Systems, Mathematical Geosciences, 10.1007/s11004-023-10082-w, 56:2, (361-386), Online publication date: 1-Feb-2024.
-
Beura C, Wolters J and Tenbohlen S (2024). Application of Pathfinding Algorithms in Partial Discharge Localization in Power Transformers, Sensors, 10.3390/s24020685, 24:2, (685)
-
Gallagher F, Hagendoorn L, Koster G, Fang F, Valk C, Chrysoulakis N, Erbertseder T and Zhang Y (2023). Mapping electrical towers in satellite imagery with smart-tracing Remote Sensing Technologies and Applications in Urban Environments VIII, 10.1117/12.2680200, 9781510666993, (7)
-
Li S, Yang H, Li M, Dai J and Wang P (2023). A Highway On-Ramp Control Approach Integrating Percolation Bottleneck Analysis and Vehicle Source Identification, Sustainability, 10.3390/su151612608, 15:16, (12608)
-
Wang B, Lu B, Wang L and Liu X (2023). A network deception defense mechanism based on virtual topology generation International Conference on Intelligent Systems, Communications, and Computer Networks (ISCCN 2023), 10.1117/12.2679362, 9781510666238, (13)
-
Jones C (2023). Three Early Formal Approaches to the Verification of Concurrent Programs, Minds and Machines, 10.1007/s11023-023-09621-5, 34:S1, (73-92)
-
Kim C and Sull S Grid Graph Reduction for Efficient Shortest Pathfinding, IEEE Access, 10.1109/ACCESS.2023.3293125, 11, (74263-74276)
Index Terms
- Edsger Wybe Dijkstra: His Life,Work, and Legacy
Recommendations
Edsger Wybe Dijkstra (1930–2002): A Portrait of a Genius
Abstract.Edsger Wybe Dijkstra was born in Rotterdam on 11 May 1930. His mother was a mathematician and father a chemist. In 1956 he graduated from the University of Leiden in mathematics and theoretical physics. In 1959 he received his PhD from the ...
Edsger W. Dijkstra: The Man Behind the Prize
It would be understatement to say that news of this year's Dijkstra award came to me as a surprise. In fact, it put me into a rather profound funk, occasioning unsought re ection on my arguably misspent adulthood. It has been some time since I have done ...
An interview with Edsger W. Dijkstra
The computer science luminary, in one of his last interviews before his death in 2002, reflects on a programmer's life.