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
AwardHarry H. Goode Memorial Award 2 AwardFellow of the Society for Industrial and Applied Mathematics 2 Awardhonorary doctor of the Beijing Institute of Technology 2 AwardIEEE John von Neumann Medal 2 John Hopcroft
Filter Results1 entry
Connections
Associated With
Source Wikipedia: John Hopcroft
Credited
Source Wikipedia: Hopcroft-Karp algorithm
In Field
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
Is Discussed By
Also in Science Atlas: which discusses this subject.
Source Wikipedia: John Hopcrofttier 2
Nationality
Also in Geography Atlas: the nationality of this subject.
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."
- In Field: Theory of Computation, Lead paragraph
View the Source 2. Wikidata: John Hopcroft
Wikipedia: Hopcroft-Karp algorithm
Credited: Hopcroft-Karp Algorithm, Lead paragraphQuote, Credited: Hopcroft-Karp Algorithm, Lead paragraph
The algorithm was discovered by John Hopcroft and Richard Karp (1973) and independently by Alexander Karzanov (1973).
View the Source 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.