Robert Willoughby Floyd was an American computer scientist who made foundational contributions across algorithms, compilers and programming language theory despite never completing a doctorate, rising to a full professorship at Stanford University in his early thirties after working at the Armour Research Foundation and Carnegie Mellon University. Floyd devised the Floyd-Warshall algorithm for finding shortest paths between all pairs of vertices in a graph, developed a cycle-detection algorithm for sequences, and introduced the error-diffusion dithering technique for rendering images known as Floyd-Steinberg dithering. His 1967 paper Assigning Meanings to Programs introduced the use of logical assertions to reason about program correctness, work that helped found the field of formal program verification and directly influenced the later development of Hoare logic. Floyd also pioneered operator-precedence parsing for compilers and helped establish programming language semantics as a field of study, and he received the ACM Turing Award in 1978 for his clear influence on methods for creating efficient and reliable software.
Facts
Birth YearSourced to the subject's own account Birth DateSourced to the subject's own account Death DateSourced to the subject's own account Death YearSourced to the subject's own account FieldSourced to the subject's own account Death PlaceSourced to the subject's own accountStanford, California, U.S. 1 NationalitySourced to the subject's own account Notable WorkSourced to the subject's own accountThe Floyd-Warshall shortest-path algorithm and the 1967 paper Assigning Meanings to Programs, a foundation of program verification; received the 1978 Turing Award 1 BirthplaceSourced to the subject's own accountNew York City, New York, U.S. 1 In the Other Atlases
Sources
1. Robert W. Floyd (Wikipedia)
WikipediaLead section, en.wikipedia.org/wiki/Robert_W._FloydQuote, Lead section, en.wikipedia.org/wiki/Robert_W._Floyd
Robert W. Floyd (born Robert Willoughby Floyd; June 8, 1936, September 25, 2001) was an American computer scientist. His contributions include the design of the Floyd-Warshall algorithm (independently of Stephen Warshall), which efficiently finds all shortest paths in a graph and his work on parsing; Floyd's cycle-finding algorithm for detecting cycles in a sequence was attributed to him as well. In one isolated paper he introduced the important concept of error diffusion for rendering images, also called Floyd-Steinberg dithering (though he distinguished dithering from diffusion). He pioneered in the field of program verification using logical assertions with the 1967 paper Assigning Meanings to Programs. This was a contribution to what later became Hoare logic. Floyd received the Turing Award in 1978.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.