| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. John E. Hopcroft John E. Hopcroft, Omar Khan , Brian Kulis , Bart Selman : Natural communities in large linked networks. KDD 2003 : 541-546 John E. Hopcroft: Automata Theory: Its Past and Future. A Half-Century of Automata Theory 2000 : 37-47 John E. Hopcroft, Peter J. Kahn : A Paradigm for Robust Geometric Algorithms. Algorithmica 7 (4): 339-380 (1992) John E. Hopcroft: Electronic Prototyping. IEEE Computer 22 (3): 55-57 (1989) Christoph M. Hoffmann , John E. Hopcroft, M. S. Karasick : Towards Implementing Robust Geometric Computations. Symposium on Computational Geometry 1988 : 106-117 Christoph M. Hoffmann , John E. Hopcroft: The Geometry of Projective Blending Surfaces. Artif. Intell. 37 (1-3): 357-376 (1988) Chandrajit L. Bajaj , Christoph M. Hoffmann , Robert E. Lynch , John E. Hopcroft: Tracing surface intersections. Computer Aided Geometric Design 5 (4): 285-307 (1988) John E. Hopcroft: Computer Science: The Emergence of a Discipline. Commun. ACM 30 (3): 198-202 (1987) John E. Hopcroft: The Promise of Electronic Prototyping. MFCS 1986 : 128-139 John E. Hopcroft: The Impact of Robotics on Computer Science. Commun. ACM 29 (6): 486-498 (1986) John E. Hopcroft, Gordon T. Wilfong : Reducing Multiple Object Motion Planning to Graph Searching. SIAM J. Comput. 15 (3): 768-785 (1986) Allan Borodin , John E. Hopcroft: Routing, Merging, and Sorting on Parallel Models of Computation. J. Comput. Syst. Sci. 30 (1): 130-145 (1985) Allan Borodin , Ronald Fagin , John E. Hopcroft, Martin Tompa : Decreasing the Nesting Depth of Expressions Involving Square Roots. J. Symb. Comput. 1 (2): 169-188 (1985) John E. Hopcroft, Deborah Joseph , Sue Whitesides : On the Movement of Robot Arms in 2-Dimensional Bounded Regions. SIAM J. Comput. 14 (2): 315-333 (1985) Christoph M. Hoffmann , John E. Hopcroft: Automatic surface generation in computer aided design. The Visual Computer 1 (2): 92-100 (1985) John E. Hopcroft, Deborah Joseph , Sue Whitesides : Movement Problems for 2-Dimensional Linkages. SIAM J. Comput. 13 (3): 610-629 (1984) Alfred V. Aho , John E. Hopcroft, Jeffrey D. Ullman : Data Structures and Algorithms. Addison-Wesley 1983 John E. Hopcroft, Deborah Joseph , Sue Whitesides : On the Movement of Robot Arms in 2-Dimensional Bounded Regions FOCS 1982 : 280-289 Allan Borodin , Joachim von zur Gathen , John E. Hopcroft: Fast Parallel Matrix and GCD Computations FOCS 1982 : 65-71 Allan Borodin , John E. Hopcroft: Routing, Merging and Sorting on Parallel Models of Computation (Extended Abstract) STOC 1982 : 338-344 Allan Borodin , Joachim von zur Gathen , John E. Hopcroft: Fast Parallel Matrix and GCD Computations Information and Control 52 (3): 241-256 (1982) Richard Cole , John E. Hopcroft: On Edge Coloring Bipartite Graphs. SIAM J. Comput. 11 (3): 540-546 (1982) John E. Hopcroft: Recent Directions in Algorithmic Research. Theoretical Computer Science 1981 : 123-134 Merrick L. Furst , John E. Hopcroft, Eugene M. Luks : Polynomial-Time Algorithms for Permutation Groups FOCS 1980 : 36-41 Steven Fortune , John E. Hopcroft, James Wyllie : The Directed Subgraph Homeomorphism Problem. Theor. Comput. Sci. 10 : 111-121 (1980) John E. Hopcroft, Jeffrey D. Ullman : Introduction to Automata Theory, Languages and Computation. Addison-Wesley 1979 Steven Fortune , John E. Hopcroft: A Note on Rabin's Nearest-Neighbor Algorithm. Inf. Process. Lett. 8 (1): 20-23 (1979) John E. Hopcroft, Jean-Jacques Pansiot : On the Reachability Problem for 5-Dimensional Vector Addition Systems. Theor. Comput. Sci. 8 : 135-159 (1979) Steven Fortune , John E. Hopcroft, Erik Meineche Schmidt : The Complexity of Equivalence and Containment for Free Single Variable Program Schemes. ICALP 1978 : 227-240 John E. Hopcroft, Wolfgang J. Paul , Leslie G. Valiant : On Time Versus Space. J. ACM 24 (2): 332-337 (1977) Alfred V. Aho , John E. Hopcroft, Jeffrey D. Ullman : On Finding Lowest Common Ancestors in Trees. SIAM J. Comput. 5 (1): 115-132 (1976) John E. Hopcroft, Wolfgang J. Paul , Leslie G. Valiant : On Time versus Space and Related Problems FOCS 1975 : 57-64 Alfred V. Aho , John E. Hopcroft, Jeffrey D. Ullman : The Design and Analysis of Computer Algorithms. Addison-Wesley 1974 John E. Hopcroft: Complexity of Computer Computations. IFIP Congress 1974 : 620-626 John E. Hopcroft, J. K. Wong : Linear Time Algorithm for Isomorphism of Planar Graphs (Preliminary Report) STOC 1974 : 172-184 John E. Hopcroft, Robert Endre Tarjan : Efficient Planarity Testing. J. ACM 21 (4): 549-568 (1974) Alfred V. Aho , John E. Hopcroft, Jeffrey D. Ullman : On Finding Lowest Common Ancestors in Trees STOC 1973 : 253-265 John E. Hopcroft, J. Musinski : Duality Applied to the Complexity of Matrix Multiplications and other Bilinear Forms STOC 1973 : 73-87 John E. Hopcroft, Robert Endre Tarjan : Efficient Algorithms for Graph Manipulation [H] (Algorithm 447). Commun. ACM 16 (6): 372-378 (1973) John E. Hopcroft, Robert Endre Tarjan : A V log V Algorithm for Isomorphism of Triconnected Planar Graphs. J. Comput. Syst. Sci. 7 (3): 323-331 (1973) John E. Hopcroft, Robert Endre Tarjan : Dividing a Graph into Triconnected Components. SIAM J. Comput. 2 (3): 135-158 (1973) John E. Hopcroft, J. Musinski : Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms. SIAM J. Comput. 2 (3): 159-173 (1973) John E. Hopcroft, Richard M. Karp : An n 5/2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM J. Comput. 2 (4): 225-231 (1973) John E. Hopcroft, Jeffrey D. Ullman : Set Merging Algorithms. SIAM J. Comput. 2 (4): 294-303 (1973) John E. Hopcroft, Richard M. Karp : A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs FOCS 1971 : 122-125 John E. Hopcroft, Robert Endre Tarjan : Planarity Testing in V log V Steps: Extended Abstract. IFIP Congress (1) 1971 : 85-90 John E. Hopcroft, Robert Endre Tarjan : A V² Algorithm for Determining Isomorphism of Planar Graphs. Inf. Process. Lett. 1 (1): 32-34 (1971) Juris Hartmanis , John E. Hopcroft: An Overview of the Theory of Computational Complexity. J. ACM 18 (2): 444-475 (1971) Seymour Ginsburg , John E. Hopcroft: Images of AFL under Certain Families of Homomorphisms. Mathematical Systems Theory 5 (3): 216-227 (1971) Seymour Ginsburg , John E. Hopcroft: Two-way balloon automata and AFL. J. ACM 17 (1): 3-13 (1970) Alfred V. Aho , Jeffrey D. Ullman , John E. Hopcroft: On the Computational Power of Pushdown Automata. J. Comput. Syst. Sci. 4 (2): 129-136 (1970) Juris Hartmanis , John E. Hopcroft: What makes Some Language Theory Problems Undecidable. J. Comput. Syst. Sci. 4 (4): 368-376 (1970) John E. Hopcroft, L. R. Kerr : Some Techniques for Proving Certain Simple Programs Optimal FOCS 1969 : 36-45 Allan Borodin , Robert L. Constable , John E. Hopcroft: Dense and Non-Dense Families of Complexity Classes FOCS 1969 : 7-19 John E. Hopcroft, Jeffrey D. Ullman : Some Results on Tape-Bounded Turing Machines. J. ACM 16 (1): 168-177 (1969) Sheila A. Greibach , John E. Hopcroft: Scattered Context Grammars. J. Comput. Syst. Sci. 3 (3): 233-247 (1969) John E. Hopcroft: On the Equivalence and Containment Problems for Context-Free Languages. Mathematical Systems Theory 3 (2): 119-124 (1969) Alfred V. Aho , John E. Hopcroft, Jeffrey D. Ullman : A General Theory of Translation. Mathematical Systems Theory 3 (3): 193-221 (1969) Seymour Ginsburg , John E. Hopcroft: Two-Way Balloon Automata and AFL FOCS 1968 : 292-297 Juris Hartmanis , John E. Hopcroft: Structure of Undecidable Problems in Automata Theory FOCS 1968 : 327-333 Sheila A. Greibach , John E. Hopcroft: Scattered context grammars. IFIP Congress (1) 1968 : 260-264 John E. Hopcroft, Jeffrey D. Ullman : Sets Accepted by One-Way Stack Automata Are Context Sensitive Information and Control 13 (2): 114-133 (1968) Alfred V. Aho , John E. Hopcroft, Jeffrey D. Ullman : Time and Tape Complexity of Pushdown Automaton Languages Information and Control 13 (3): 186-206 (1968) John E. Hopcroft, Jeffrey D. Ullman : Decidable and Undecidable Questions About Automata. J. ACM 15 (2): 317-324 (1968) John E. Hopcroft, Jeffrey D. Ullman : Relations Between Time and Tape Complexities. J. ACM 15 (3): 414-427 (1968) John E. Hopcroft, Jeffrey D. Ullman : Deterministic Stack Automata and the Quotient Operator. J. Comput. Syst. Sci. 2 (1): 1-12 (1968) John E. Hopcroft, Jeffrey D. Ullman : An Approach to a Unified Theory of Automata FOCS 1967 : 140-147 Peter Weiner , John E. Hopcroft: Modular Decomposition of Synchronous Sequential Machines FOCS 1967 : 233-239 John E. Hopcroft, Jeffrey D. Ullman : Two Results on One-Way Stack Automata FOCS 1967 : 37-44 John E. Hopcroft, Jeffrey D. Ullman : Nonerasing Stack Automata. J. Comput. Syst. Sci. 1 (2): 166-186 (1967) A. J. Korenjak , John E. Hopcroft: Simple Deterministic Languages FOCS 1966 : 36-46 1 [ 9 ] [ 14 ] [ 21 ] [ 35 ] [ 39 ] [ 41 ] [ 55 ] 2 [ 65 ] 3 [ 18 ] [ 51 ] [ 52 ] [ 53 ] [ 59 ] [ 60 ] 4 [ 50 ] 5 [ 18 ] 6 [ 59 ] 7 [ 43 ] [ 45 ] [ 47 ] 8 [ 48 ] 9 [ 51 ] [ 53 ] 10 [ 13 ] [ 22 ] [ 23 ] 11 [ 11 ] [ 16 ] 12 [ 12 ] [ 20 ] [ 24 ] 13 [ 57 ] [ 65 ] [ 66 ] [ 67 ] 14 [ 54 ] [ 56 ] [ 58 ] 15 [ 69 ] 16 [ 67 ] 17 [ 27 ] [ 29 ] 18 [ 19 ] 19 [ 71 ] 20 [ 1 ] 21 [ 71 ] 22 [ 48 ] 23 [ 65 ] 24 [ 30 ] [ 34 ] 25 [ 44 ] 26 [ 40 ] [ 42 ] 27 [ 43 ] 28 [ 71 ] 29 [ 25 ] [ 26 ] [ 31 ] [ 32 ] [ 33 ] [ 36 ] 30 [ 59 ] 31 [ 2 ] [ 3 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 14 ] [ 17 ] [ 21 ] [ 28 ] [ 35 ] [ 39 ] [ 41 ] [ 46 ] [ 55 ] 32 [ 40 ] [ 42 ] 33 [ 4 ] 34 [ 54 ] [ 56 ] [ 58 ] 35 [ 61 ] 36 [ 37 ] 37 [ 47 ]  ©2004 Association for Computing Machinery |
