Introduction to Automata Theory, Languages, and Computation JE Hopcroft
Addison-Wesley, 2001
23730 2001 The design and analysis of computer algorithms AV Aho, JE Hopcroft
Pearson Education India, 1974
15835 1974 Data structures and algorithms JE Hopcroft, JD Ullman, AV Aho
Addison-wesley, 1983
5172 1983 An JE Hopcroft, RM Karp
SIAM Journal on computing 2 (4), 225-231, 1973
4056 1973 Formal languages and their relation to automata JE Hopcroft, JD Ullman
Addison-Wesley Longman Publishing Co., Inc., 1969
2720 1969 Efficient planarity testing J Hopcroft, R Tarjan
Journal of the ACM (JACM) 21 (4), 549-568, 1974
1811 1974 Algorithm 447: efficient algorithms for graph manipulation J Hopcroft, R Tarjan
Communications of the ACM 16 (6), 372-378, 1973
1603 1973 An n log n algorithm for minimizing states in a finite automaton J Hopcroft
Theory of machines and computations, 189-196, 1971
1481 1971 Dividing a graph into triconnected components JE Hopcroft, RE Tarjan
SIAM Journal on computing 2 (3), 135-158, 1973
1190 1973 Построение и анализ вычислительных алгоритмов А Ахо
Рипол Классик, 1979
1180 1979 Snapshot ensembles: Train 1, get m for free G Huang, Y Li, G Pleiss, Z Liu, JE Hopcroft, KQ Weinberger
arXiv preprint arXiv:1704.00109, 2017
1145 2017 The directed subgraph homeomorphism problem S Fortune, J Hopcroft, J Wyllie
Theoretical Computer Science 10 (2), 111-121, 1980
995 1980 Stacked generative adversarial networks X Huang, Y Li, O Poursaeed, J Hopcroft, S Belongie
Proceedings of the IEEE conference on computer vision and pattern …, 2017
744 2017 Linear time algorithm for isomorphism of planar graphs (preliminary report) JE Hopcroft, JK Wong
Proceedings of the sixth annual ACM symposium on Theory of computing, 172-184, 1974
722 1974 Routing, merging and sorting on parallel models of computation A Borodin, JE Hopcroft
Proceedings of the fourteenth annual ACM symposium on Theory of computing …, 1982
664 1982 Nesterov accelerated gradient and scale invariance for adversarial attacks J Lin, C Song, K He, L Wang, JE Hopcroft
arXiv preprint arXiv:1908.06281, 2019
630 2019 On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE-Hardness of the" Warehouseman's Problem" JE Hopcroft, JT Schwartz, M Sharir
The international journal of robotics research 3 (4), 76-88, 1984
611 1984 Are randomly grown graphs really random? DS Callaway, JE Hopcroft, JM Kleinberg, MEJ Newman, SH Strogatz
Physical Review E 64 (4), 041902, 2001
532 2001 Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie JE Hopcroft, JD Ullman, R Motwani
Pearson Studium, 2002
512 2002 Triangular factorization and inversion by fast matrix multiplication JR Bunch, JE Hopcroft
Mathematics of Computation 28 (125), 231-236, 1974
476 1974 
Jeffrey UllmanProfessor of Computer Science, Stanford UniversityПотвърден имейл адрес: stanford.edu
