This man formulated a mechanism that checks whether a new state is safe or not when granting requests in the Banker's Algorithm.  That algorithm was subsequently used in an early operating system he developed, known as the "T-H-E  multiprogramming system".  He also formulated a method that uses a stack to convert standard syntax into Reverse Polish Notation, the Shunting Yard Algorithm.  With C. A. R. Hoare this man lends his name to a 1972 text book called Structured Programming that advocated his position against the GOTO statement.  His exte
This man formulated a mechanism that checks whether a new state is safe or not when granting requests in the Banker's Algorithm.  That algorithm was subsequently used in an early operating system he developed, known as the "T-H-E  multiprogramming system".  He also formulated a method that uses a stack to convert standard syntax into Reverse Polish Notation, the Shunting Yard Algorithm.  With C. A. R. Hoare this man lends his name to a 1972 text book called Structured Programming that advocated his position against the GOTO statement.  His extensive correspondences are collectively known as the "EWD" series, and one of his eponymous creations falls apart when graphs have negative edge weights and has a heuristic modification known as A Star.  FTP, identify this computer scientist best known for lending his name to a greedy algorithm that finds the single source shortest path from a node in a graph.
This man formulated a mechanism that checks whether a new state is safe or not when granting requests in the Banker's Algorithm.  
Edsger Wybe Dijkstra