Robert W. Floyd was an American computer scientist who became a full professor at Stanford University despite never earning a doctorate. He designed the Floyd Warshall algorithm for finding shortest paths between every pair of points in a graph, devised Floyd Steinberg dithering, a widely used technique for rendering images with a limited color palette, and, in his 1967 paper Assigning Meanings to Programs, pioneered the use of logical assertions to prove that a program behaves correctly, work that helped found what became known as Hoare logic. He received the 1978 Turing Award for these and related contributions across parsing theory, programming language semantics and the analysis of algorithms.
Facts
Connections
Invented
Robert W. Floyd is credited with the tortoise and hare cycle detection algorithm, described in Donald Knuth's The Art of Computer Programming.
Invented By
Robert W. Floyd published the all-pairs shortest path algorithm in 1962, building on a related result by Stephen Warshall.
In the Other Atlases
Sources
1. Wikipedia: Robert W. Floyd
Wikimedia FoundationIntroductionQuote, Introduction
Robert W. Floyd (born Robert Willoughby Floyd; June 8, 1936, September 25, 2001) was an American computer scientist.
View the Source Robert W. Floyd (Wikidata)
Wikidata alias: Robert Floyd
Robert Floyd
Wikidata P166: Guggenheim Fellowship
Wikidata P166 (award received): Guggenheim Fellowship.
Wikidata P166: Turing Award
Wikidata P166 (award received): Turing Award.
Wikidata P166: ACM Fellow
Wikidata P166 (award received): ACM Fellow.
Wikidata P166: Computer Pioneer Award
Wikidata P166 (award received): Computer Pioneer Award.
Wikidata alias: Bob Floyd
Bob Floyd
Wikidata alias: Robert W Floyd
Robert W Floyd
Wikidata alias: Robert Willoughby Floyd
Robert Willoughby Floyd
View the SourceReader 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.