Resultado da Busca
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.
- Synthesis of Threshold Logic Networks (1964)
- Richard Mattson
- October 7, 1939 (age 84), Seattle, Washington
John Edward Hopcroft (Seattle, 7 de outubro de 1939) é um professor de ciência da computação estadunidense. Foi condecorado com o Prêmio Turing de 1986, juntamente com Robert Tarjan , pelo projeto e análise de algoritmos e estruturas de dados.
- Estados Unidos
- Estadunidense
John Hopcroft is a pioneer of computer science theory and a co-author of influential textbooks on formal languages and algorithms. He received the Turing Award in 1986 for his work with Robert Tarjan on graph algorithms and data structures.
John E. Hopcroft is a professor emeritus of computer science at Cornell University and a Turing Award winner. He has also served as the dean of engineering, the chair of computer science, and the IBM professor of engineering and applied mathematics.
1 de mai. de 2024 · John Hopcroft (born October 7, 1939, Seattle, Washington, U.S.) is an American computer scientist and cowinner of the 1986 A.M. Turing Award, the highest honour in computer science, for “fundamental achievements in the design and analysis of algorithms and data structures.”
- William L. Hosch
An n log n algorithm for minimizing states in a finite automaton. J Hopcroft. Theory of machines and computations, 189-196. , 1971. 1429. 1971. Dividing a graph into triconnected components. JE Hopcroft, RE Tarjan. SIAM Journal on computing 2 (3), 135-158.
Introdução à teoria de autômatos, linguagens e computação. Capa comum – 18 outubro 2002. Passaram-se mais de trinta anos desde que John Hopcroft e Jeffrey Ullman publicaram a primeira edição deste livro clássico sobre linguagens formais, teoria dos autômatos e complexidade computacional.
