Edsger Wybe Dijkstra (1930–2002): A Portrait of a Genius

@article{Apt2002EdsgerWD,
  title={Edsger Wybe Dijkstra (1930–2002): A Portrait of a Genius},
  author={Krzysztof R. Apt},
  journal={Formal Aspects of Computing},
  year={2002},
  volume={14},
  pages={92-98}
}
  • K. Apt
  • Published 30 September 2002
  • Art
  • Formal Aspects of Computing
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 University of Amsterdam for his thesis entitled ‘Communication with an Automatic Computer’, devoted to a description of the assembly language designed for the first commercial computer developed in the Netherlands, the X1. It also dealt with the… 
Edsger Dijkstra, The Man Who Carried Computer Science on His Shoulders
  • K. Apt
  • Art
    Edsger Wybe Dijkstra
  • 2022
TLDR
This a biographical essay about Edsger Wybe Dijkstra is based on a collection of letters written by the Dutch writer and poet Edsgeir WybeDijkstra in the years leading up to his death in 1993.
Calculating the Shortest Path Using Dijkstra’s Algorithm
TLDR
The process and results of an activity that included route formation among the provinces in the Aegean region using Dijkstra's algorithm are shared and the activity was designed based on a mathematical modeling process.
A Solution to Best Itinerary Problem Based on Strategy Set under Dijkstra Algorithm
TLDR
A Filtering Algorithm based on Lagrange relaxation method and ordinal selection is used to overcome weaknesses in the OLR Dijkstra algorithm and shows a strong stability and reliability facing different probabilities situations.
Semaphores , Are They Really Like Traffic Signals ?
TLDR
This article presents and compares semaphores definitions and implementations, rescuing three types of them and is a warning to teachers on semaphore semantics and implementations.