2008-11-14

(On-line use the name: John Hopcroft , or John Hopcroft)

The computer scientists of USA

The Computer Science department at the Cornell University of USA

As a result of the algorithm and data structure design and analysis of the decisive results achieved in 1986 year and he obtained the Turing Award.

Founded in 1966 the Turing Award that the Turing Award is the computer industry¡¯s most prestigious award, "Nobel Prize of computer industry," said the only computer in the field of international qualifications, the most authoritative and outstanding achievements of scientists will be able to obtain from the United States Computer Society (ACM) presented the award.

Introduce of the Results:

Hopcroft was study focused on the theoretical aspects of computing, especially in algorithm analysis, automata theory, graph theory and the algorithm. Hopcroft is very interested in the subject algorithm. He proposes a "worst-case asymptotic analysis" (Worst-case asymptotic analysis of algorithm), to become algorithm to measure the efficiency and quality of mathematical criteria for the academic was widely recognized and accepted.

Hopcroft and Robert Endre Tarjan solved a map of algorithms and some problems. They put forward a "depth-first search algorithm" (depth-first search algorithm). This algorithm for graph search greater efficiency. They create the depth-first algorithm was extended to information retrieval, the international chess tournament procedures, expert systems, such as conflict resolution strategies in many ways. They also put forward a new data structure called the "double-stack stack" (pile of twins tacks), this new data structure will be depth-first search algorithm developed more advantages.

Hopcroft in the data structure and algorithm to create a series of other aspects. For example, B tree (B-tree) is used in the index of well-known organizations, data structure, with high-performance features.