Robert W. Floyd

Robert W. Floyd
Floyd c. 1970s
Born
Robert Willoughby Floyd

(1936-06-08)June 8, 1936
DiedSeptember 25, 2001(2001-09-25) (aged 65)
EducationUniversity of Chicago (BA, BA)
Known forFloyd–Warshall algorithm
Floyd–Steinberg dithering
Floyd's cycle-finding algorithm
Floyd's triangle
ALGOL
Spouse(s)Jana M. Mason; Christiane Floyd (née Riedl)
Children4
AwardsTuring Award (1978)
Computer Pioneer Award (1991)
Scientific career
FieldsComputer science
InstitutionsIllinois Institute of Technology
Carnegie Mellon University
Stanford University
Doctoral students

Robert W. Floyd[1] (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.

  1. ^ Floyd had his middle name "Willoughby" legally changed to "W" but deemed abbreviating it as "W." valid (Knuth 2003) (DOD form DD 48-1, personal papers, Stanford University Archive catalog SC 625 box 4)