Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Robert W. Floyd

Also Known As Robert Floyd · Bob Floyd · Robert W Floyd · Robert Willoughby Floyd
Theory of Computation

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
Birth Year
1936 1
Birth Date
1936-06-08 1
Death Year
2001 1
Death Date
2001-09-25 1
Nationality
American 1
Award
Guggenheim Fellowship 2
Award
Turing Award 2
Award
ACM Fellow 2
Award
Computer Pioneer Award 2
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 FoundationIntroduction
Quote, Introduction
Robert W. Floyd (born Robert Willoughby Floyd; June 8, 1936, September 25, 2001) was an American computer scientist.
View the Source
2. Wikidata: Robert W. Floyd
Wikidata Q92641, class allow-list match (w-wdresolver-0926)View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.