John Hopcroft
John Hopcroft
Verified email at - Homepage
Cited by
Cited by
Introduction to automata theory, languages, and computation
JE Hopcroft, R Motwani, JD Ullman
Acm Sigact News 32 (1), 60-65, 2001
The design and analysis of computer algorithms
AV Aho, JE Hopcroft
Pearson Education India, 1974
An Algorithm for Maximum Matchings in Bipartite Graphs
JE Hopcroft, RM Karp
SIAM Journal on computing 2 (4), 225-231, 1973
Formal languages and their relation to automata
JE Hopcroft, JD Ullman
Addison-Wesley Longman Publishing Co., Inc., 1969
Efficient planarity testing
J Hopcroft, R Tarjan
Journal of the ACM (JACM) 21 (4), 549-568, 1974
An n log n algorithm for minimizing states in a finite automaton
J Hopcroft
Theory of machines and computations, 189-196, 1971
Algorithm 447: efficient algorithms for graph manipulation
J Hopcroft, R Tarjan
Communications of the ACM 16 (6), 372-378, 1973
Dividing a graph into triconnected components
JE Hopcroft, RE Tarjan
SIAM Journal on Computing 2 (3), 135-158, 1973
The directed subgraph homeomorphism problem
S Fortune, J Hopcroft, J Wyllie
Theoretical Computer Science 10 (2), 111-121, 1980
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
Routing, merging, and sorting on parallel models of computation
A Borodin, JE Hopcroft
Journal of computer and system sciences 30 (1), 130-145, 1985
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
Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie
JE Hopcroft, JD Ullman, R Motwani
Pearson Studium, 2002
Are randomly grown graphs really random?
DS Callaway, JE Hopcroft, JM Kleinberg, MEJ Newman, SH Strogatz
Physical Review E 64 (4), 041902, 2001
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
Efficient optimization of a class of relational expressions
AV Aho, Y Sagiv, JD Ullman
ACM Transactions on Database Systems (TODS) 4 (4), 435-454, 1979
Tracking evolving communities in large linked networks
J Hopcroft, O Khan, B Kulis, B Selman
Proceedings of the National Academy of Sciences 101 (suppl 1), 5249-5253, 2004
Triangular factorization and inversion by fast matrix multiplication
JR Bunch, JE Hopcroft
Mathematics of Computation 28 (125), 231-236, 1974
On time versus space
J Hopcroft, W Paul, L Valiant
Journal of the ACM (JACM) 24 (2), 332-337, 1977
Tracing surface intersections
CL Bajaj, CM Hoffmann, RE Lynch, JEH Hopcroft
Computer aided geometric design 5 (4), 285-307, 1988
The system can't perform the operation now. Try again later.
Articles 1–20