Robert W. Floyd
American computer scientist (1936–2001) / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Robert W. Floyd?
Summarize this article for a 10 year old
Robert W Floyd[1] (June 8, 1936 – September 25, 2001) was a 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.
Robert W. Floyd | |
---|---|
Born | (1936-06-08)June 8, 1936 |
Died | September 25, 2001(2001-09-25) (aged 65) Stanford, California, United States |
Citizenship | United States |
Education | University of Chicago (B.A., 1953, 1958) |
Known for | Floyd–Warshall algorithm Floyd–Steinberg dithering Floyd's cycle-finding algorithm Floyd's triangle ALGOL |
Spouse(s) | Jana M. Mason; Christiane Floyd (née Riedl) |
Children | 4 |
Awards | Turing Award (1978) Computer Pioneer Award (1991) |
Scientific career | |
Fields | Computer science |
Institutions | Illinois Institute of Technology Carnegie Mellon University Stanford University |
Doctoral students | |