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
Contribution Kind Highest Honour Robert W. Floyd
Filter Results2 entries
FAQs
How did Robert Floyd become a full professor at Stanford so quickly?
He was promoted to full professor in 1970 after only five years as an associate professor.
Floyd joined the faculty of Carnegie Institute of Technology as an associate professor in 1965, moved to Stanford in 1968 and was promoted to full professor in 1970. A memorial resolution written by Donald Knuth for Stanford says he was one of very few people judged to deserve that rank after only five years as an associate professor.
Connections
Credited
Source Floyd-Rivest algorithm (Wikipedia)
Source Floyd-Steinberg dithering (Wikipedia)
Source Wikipedia, Floyd-Warshall algorithm
Source Median of medians (Wikipedia)
Source Floyd-Warshall Algorithm (Wikipedia)
In Field
Source Wikipedia: Robert W. Floyd
Invented
Robert W. Floyd is credited with the tortoise and hare cycle detection algorithm, described in Donald Knuth's The Art of Computer Programming.
Robert W. Floyd published the all-pairs shortest path algorithm in 1962, building on a related result by Stephen Warshall.
Invented By
Source Floyd-Rivest algorithm (Wikipedia)
Source Floyd-Steinberg dithering (Wikipedia)
Source Median of medians (Wikipedia)
In the Other Atlases
Nationality
Also in Geography Atlas: the nationality of this subject.
Sources
1. Wikipedia: Robert W. Floyd
Wikimedia FoundationLead section
Floyd (born Robert Willoughby Floyd; June 8, 1936 - September 25, 2001) was an American computer scientist.
Lead paragraph, contribution kind
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.
Infobox: awards
Turing Award (1978) Computer Pioneer Award (1991)
- In Field: Algorithms and Complexity Theory, Lead paragraph
View the Source 2. Wikidata: Robert W. Floyd
Floyd-Warshall Algorithm (Wikipedia)
Credited: Warshall's Algorithm, LeadQuote, Credited: Warshall's Algorithm, Lead
was published in its currently recognized form by Robert Floyd in 1962
Median of medians (Wikipedia)
Credited: Median of medians, Lead, last paragraph
sometimes called BFPRT after the last names of the authors (Blum, Floyd, Pratt, Rivest, Tarjan)
Invented By: Median of medians, Lead, last paragraph
The algorithm was published in 1973 and is sometimes called BFPRT after the last names of the authors (Blum, Floyd, Pratt, Rivest, Tarjan).
View the SourceFloyd-Steinberg dithering (Wikipedia)
Invented By: Floyd-Steinberg dithering, Lead, first publication
first published in 1976 by Robert W. Floyd and Louis Steinberg
Credited: Floyd-Steinberg dithering, Lead, first publication (credit)
first published in 1976 by Robert W. Floyd and Louis Steinberg
View the SourceFloyd-Rivest algorithm (Wikipedia)
Invented By: Floyd-Rivest algorithm, Lead, co-author
developed by Robert W. Floyd and Ronald L. Rivest
Credited: Floyd-Rivest algorithm, Lead, authors and credit
developed by Robert W. Floyd and Ronald L. Rivest
View the SourceWikipedia, Floyd-Warshall algorithm
Credited: Floyd-Warshall Algorithm, History and namingQuote, Credited: Floyd-Warshall Algorithm, History and naming
was published in its currently recognized form by Robert Floyd in 1962
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.