WorldCat Identities

Hopcroft, John E. 1939-

Overview
Works: 114 works in 579 publications in 9 languages and 8,670 library holdings
Genres: Conference papers and proceedings 
Roles: Author, Editor, Other
Publication Timeline
.
Most widely held works by John E Hopcroft
Introduction to automata theory, languages, and computation by John E Hopcroft( Book )

190 editions published between 1979 and 2014 in 7 languages and held by 2,627 WorldCat member libraries worldwide

It has been more than 20 years since this classic book on formal languages, automata theory, and computational complexity was first published. With this long-awaited revision, the authors continue to present the theory in a concise and straightforward manner, now with an eye out for the practical applications. They have revised this book to make it more accessible to today's students, including the addition of more material on writing proofs, more figures and pictures to convey ideas, side-boxes to highlight other interesting material, and a less formal writing style. Exercises at the end of each chapter, including some new, easier exercises, help readers confirm and enhance their understanding of the material
Data structures and algorithms by Alfred V Aho( Book )

51 editions published between 1982 and 2009 in English and held by 1,236 WorldCat member libraries worldwide

Data -- Data Structures
Computing, communication, and the information age by John E Hopcroft( )

3 editions published in 1994 in English and held by 1,102 WorldCat member libraries worldwide

The design and analysis of computer algorithms by Alfred V Aho( Book )

24 editions published between 1974 and 2006 in English and held by 1,092 WorldCat member libraries worldwide

Software -- Programming Techniques
Formal languages and their relation to automata by John E Hopcroft( Book )

23 editions published between 1960 and 1980 in English and held by 670 WorldCat member libraries worldwide

Frontiers in Algorithmics : third international workshop, FAW 2009, Hefei, China, June 20-23, 2009 : proceedings by Xiaotie Deng( )

16 editions published in 2009 in English and Undetermined and held by 486 WorldCat member libraries worldwide

Annotation
Frontiers in algorithmics : 8th International Workshop, FAW 2014, Zhangjiajie, China, June 28-30, 2014 ; proceedings by Jianer Chen( )

9 editions published in 2014 in English and held by 380 WorldCat member libraries worldwide

This book constitutes the refereed proceedings of the 8th International Frontiers of Algorithmics Workshop, FAW 2013, held in Zhangjiajie, China, in June 2014. The 30 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 65 submissions. They provide a focused forum on current trends of research on algorithms, discrete structures, operations research, combinatorial optimization and their applications
Studies in abstract families of languages by Seymour Ginsburg( Book )

14 editions published between 1969 and 1983 in English and held by 246 WorldCat member libraries worldwide

Planning, geometry, and complexity of robot motion( Book )

9 editions published between 1986 and 1987 in English and held by 206 WorldCat member libraries worldwide

Structures de données et algorithmes by Alfred V Aho( Book )

5 editions published between 1987 and 1989 in French and held by 123 WorldCat member libraries worldwide

Estructuras de datos y algoritmos by Alfred V Aho( Book )

15 editions published between 1983 and 1998 in Spanish and Undetermined and held by 69 WorldCat member libraries worldwide

Modeling, mesh generation, and adaptive numerical methods for partial differential equations by Ivo Babuška( )

3 editions published in 1995 in English and held by 55 WorldCat member libraries worldwide

With considerations such as complex-dimensional geometries and nonlinearity, the computational solution of partial differential systems has become so involved that it is important to automate decisions that have been normally left to the individual. This book covers such decisions: 1) mesh generation with links to the software generating the domain geometry, 2) solution accuracy and reliability with mesh selection linked to solution generation. This book is suited for mathematicians, computer scientists and engineers and is intended to encourage interdisciplinary interaction between the diverse groups
Proceedings of the ninth annual ACM symposium on Theory of computing by John E Hopcroft( )

2 editions published in 1977 in English and held by 29 WorldCat member libraries worldwide

Computer science : achievements and opportunities : report by National Science Foundation (U.S.)( Book )

2 editions published in 1989 in English and held by 19 WorldCat member libraries worldwide

A linear algorithm for testing equivalence of finite automata by John E Hopcroft( )

5 editions published in 1971 in English and held by 19 WorldCat member libraries worldwide

An algorithm is given for determining if two finite automata with start states are equivalent. The asymptotic running time of the algorithm is bounded by a constant times the product of the number of states of the larger automation with the size of the input alphabet. (Author)
The International series of monographs on computer science( )

in English and held by 16 WorldCat member libraries worldwide

Postroenie i analiz vyčislitel'nych algoritmov by Alfred V Aho( Book )

4 editions published in 1979 in Russian and held by 12 WorldCat member libraries worldwide

Frontiers in Algorithmics : Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009 : Proceedings by International Frontiers of Algorithmics Workshop( )

2 editions published in 2009 in English and held by 10 WorldCat member libraries worldwide

This book constitutes the refereed proceedings of the Third International Frontiers of Algorithmics Workshop, FAW 2009, held in Hefei, Anhui, China, in June 2009. The 33 revised full papers presented together with the abstracts of 3 invited talks were carefully reviewed and selected from 87 submissions. The papers are organized in topical sections on graph algorithms; game theory with applications; graph theory, computational geometry; machine learning; parameterized algorithms, heuristics and analysis; approximation algorithms; as well as pattern recognition algorithms, large scale data mining
Introduction to Automata Theory by John E Hopcroft( )

2 editions published between 2008 and 2013 in English and held by 8 WorldCat member libraries worldwide

Formal languages and automata theory is the study of abstract machines and how these can be used for solving problems. The book has a simplistic approach to topics like automata theory, formal languages and theory of computation and explains them exhaustively. The difficult topics are described in a step-wise manner, which makes it easy for the students to comprehend them. These descriptions are followed by numerous relevant examples related to the topic. A brief introductory chapter on compilers explaining its relation to theory of computation is also given
A paradigm for robust geometric algorithms by John E Hopcroft( Book )

4 editions published in 1989 in English and held by 7 WorldCat member libraries worldwide

Geometrical algorithms in use in computer aided design systems today often fail for numerical reasons. The cause of these failures usually can be traced to logical decisions such as branch on zero that depend on the results of numerical calculations. Numerical inaccuracies, introduced either in the initial data or in the finite-precision arithmetic that is used, may result in a set of logical decisions that are inconsistent. This loss of logical consistency usually proves fatal to the algorithm. Our interest is in geometric algorithms that are robust in the sense that they are provably immune to such potential problems. This paper explores a paradigm that should have wide applicability for producing robust algorithms, and it applies the paradigm to the task of intersecting two convex polyhedral objects. The paradigm was previously used in an implementation of an algorithm for intersecting polyhedral objects that was substantially more robust than algorithms implemented earlier. This paper is a first step in developing a mathematical framework that justifies the underlying ideas in this implementation. In particular, an important tool in this work is a method of manipulating embedded polyhedra in ways consistent with their topology. (kr)
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.51 (from 0.01 for Computing, ... to 0.94 for Postroenie ...)

Data structures and algorithms
Covers
Data structures and algorithmsThe design and analysis of computer algorithmsFrontiers in Algorithmics : third international workshop, FAW 2009, Hefei, China, June 20-23, 2009 : proceedingsPlanning, geometry, and complexity of robot motion
Alternative Names
Chopkroft, Dž 1939-

Con Edvard Hopkroft

Hopcroft, J. E.

Hopcroft, J. E. 1939-

Hopcroft, J. E. (John E.), 1939-

Hopcroft, John

Hopcroft, John 1939-

Hopcroft, John E.

Hopcroft, John Edward 1939-

Hopkroft, Dž.

John E. Hopcroft amerikanischer Informatiker

John Hopcroft Amerikaans informaticus

John Hopcroft amerikansk datavetare

John Hopcroft amerikansk informatikar

John Hopcroft amerikansk informatiker

John Hopcroft informaticien américain

John Hopcroft informatico statunitense

Джон Гопкрофт

Хопкрофт Дж.

Хопкрофт Джон

Хопкрофт, Джон Э 1939-

Џон Хопкрофт

ג'ון הופקרופט

جان هاپکرافت دانشمند علوم کامپیوتر آمریکایی

جون هوبكروفت

জন এডওয়ার্ড হপক্রফট

ジョン・ホップクロフト American computer scientist

ホップクロフト, J

ホップクロフト, J. E.

霍普克罗夫特, J. E.

約翰·霍普克洛夫特

Languages