John Edward Hopcroft is an American theoretical computer scientist. His textbooks on theory of computation, also known as the Cinderella book, and data structures are regarded as standards in their fields. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Connections
Associated With
Source Wikipedia: John Hopcroft
Invented
John Hopcroft co-developed this algorithm for finding maximum cardinality matchings in bipartite graphs with Richard Karp, published in 1973.
Source Wikipedia: John Hopcroft
In the Other Atlases
Sources
1. Wikipedia: John Hopcroft
Wikimedia FoundationLead section
John Edward Hopcroft (born October 7, 1939) is an American theoretical computer scientist. His textbooks on theory of computation (also known as the Cinderella book) and data structures are regarded as standards in their fields.
Infobox, Born
October 7, 1939
Associated With: Robert Tarjan, Career and honor section
In 1986 Hopcroft received the ACM Turing Award (jointly with Robert Tarjan) "for fundamental achievements in the design and analysis of algorithms and data structures."
View the Source John Hopcroft (Wikidata)
Wikidata alias: John E. Hopcroft
John E. Hopcroft
Wikidata P166: Friendship Award
Wikidata P166 (award received): Friendship Award.
Wikidata P166: Harry H. Goode Memorial Award
Wikidata P166 (award received): Harry H. Goode Memorial Award.
Wikidata P166: Turing Award
Wikidata P166 (award received): Turing Award.
Wikidata P166: ACM Fellow
Wikidata P166 (award received): ACM Fellow.
Wikidata P166: Fellow of the Society for Industrial and Applied Mathematics
Wikidata P166 (award received): Fellow of the Society for Industrial and Applied Mathematics.
Wikidata P166: honorary doctor of the Beijing Institute of Technology
Wikidata P166 (award received): honorary doctor of the Beijing Institute of Technology.
Wikidata P166: IEEE John von Neumann Medal
Wikidata P166 (award received): IEEE John von Neumann Medal.
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.