| 2008 |
|---|
| 83 | EE | Reid Andersen,
Christian Borgs,
Jennifer T. Chayes,
John E. Hopcroft,
Kamal Jain,
Vahab S. Mirrokni,
Shang-Hua Teng:
Robust PageRank and locally computable spam detection features.
AIRWeb 2008: 69-76 |
| 82 | EE | John E. Hopcroft:
Computer Science in the Information Age.
FAW 2008: 2 |
| 81 | EE | Reid Andersen,
Christian Borgs,
Jennifer T. Chayes,
John E. Hopcroft,
Vahab S. Mirrokni,
Shang-Hua Teng:
On the Stability of Web Crawling and Web Search.
ISAAC 2008: 680-691 |
| 2007 |
|---|
| 80 | EE | Anirban Dasgupta,
John E. Hopcroft,
Ravi Kannan,
Pradipta Prometheus Mitra:
Spectral clustering with limited independence.
SODA 2007: 1036-1045 |
| 79 | EE | Reid Andersen,
Christian Borgs,
Jennifer T. Chayes,
John E. Hopcroft,
Vahab S. Mirrokni,
Shang-Hua Teng:
Local Computation of PageRank Contributions.
WAW 2007: 150-165 |
| 78 | EE | John E. Hopcroft,
Daniel Sheldon:
Manipulation-Resistant Reputations Using Hitting Time.
WAW 2007: 68-81 |
| 77 | | André Allavena,
Anirban Dasgupta,
John E. Hopcroft,
Ravi Kumar:
Finding (Short) Paths in Social Networks.
Internet Mathematics 3(2): (2007) |
| 2006 |
|---|
| 76 | EE | Anirban Dasgupta,
John E. Hopcroft,
Ravi Kannan,
Pradipta Prometheus Mitra:
Spectral Clustering by Recursive Partitioning.
ESA 2006: 256-267 |
| 2005 |
|---|
| 75 | EE | Anirban Dasgupta,
John E. Hopcroft,
Jon M. Kleinberg,
Mark Sandler:
On Learning Mixtures of Heavy-Tailed Distributions.
FOCS 2005: 491-500 |
| 74 | EE | Thorsten Joachims,
John E. Hopcroft:
Error bounds for correlation clustering.
ICML 2005: 385-392 |
| 73 | EE | André Allavena,
Alan J. Demers,
John E. Hopcroft:
Correctness of a gossip based membership protocol.
PODC 2005: 292-301 |
| 2004 |
|---|
| 72 | EE | Anirban Dasgupta,
John E. Hopcroft,
Frank McSherry:
Spectral Analysis of Random Graphs with Skewed Degree Distributions.
FOCS 2004: 602-610 |
| 2003 |
|---|
| 71 | EE | John E. Hopcroft,
Omar Khan,
Brian Kulis,
Bart Selman:
Natural communities in large linked networks.
KDD 2003: 541-546 |
| 2000 |
|---|
| 70 | | John E. Hopcroft:
Automata Theory: Its Past and Future.
A Half-Century of Automata Theory 2000: 37-47 |
| 1992 |
|---|
| 69 | | John E. Hopcroft,
Peter J. Kahn:
A Paradigm for Robust Geometric Algorithms.
Algorithmica 7(4): 339-380 (1992) |
| 1989 |
|---|
| 68 | | John E. Hopcroft:
Electronic Prototyping.
IEEE Computer 22(3): 55-57 (1989) |
| 1988 |
|---|
| 67 | EE | Christoph M. Hoffmann,
John E. Hopcroft,
Michael S. Karasick:
Towards Implementing Robust Geometric Computations.
Symposium on Computational Geometry 1988: 106-117 |
| 66 | | Christoph M. Hoffmann,
John E. Hopcroft:
The Geometry of Projective Blending Surfaces.
Artif. Intell. 37(1-3): 357-376 (1988) |
| 65 | EE | Chandrajit L. Bajaj,
Christoph M. Hoffmann,
Robert E. Lynch,
John E. Hopcroft:
Tracing surface intersections.
Computer Aided Geometric Design 5(4): 285-307 (1988) |
| 1987 |
|---|
| 64 | | John E. Hopcroft:
Computer Science: The Emergence of a Discipline.
Commun. ACM 30(3): 198-202 (1987) |
| 1986 |
|---|
| 63 | | John E. Hopcroft:
The Promise of Electronic Prototyping.
MFCS 1986: 128-139 |
| 62 | | John E. Hopcroft:
The Impact of Robotics on Computer Science.
Commun. ACM 29(6): 486-498 (1986) |
| 61 | | John E. Hopcroft,
Gordon T. Wilfong:
Reducing Multiple Object Motion Planning to Graph Searching.
SIAM J. Comput. 15(3): 768-785 (1986) |
| 1985 |
|---|
| 60 | | Allan Borodin,
John E. Hopcroft:
Routing, Merging, and Sorting on Parallel Models of Computation.
J. Comput. Syst. Sci. 30(1): 130-145 (1985) |
| 59 | | 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) |
| 58 | | 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) |
| 57 | | Christoph M. Hoffmann,
John E. Hopcroft:
Automatic surface generation in computer aided design.
The Visual Computer 1(2): 92-100 (1985) |
| 1984 |
|---|
| 56 | | John E. Hopcroft,
Deborah Joseph,
Sue Whitesides:
Movement Problems for 2-Dimensional Linkages.
SIAM J. Comput. 13(3): 610-629 (1984) |
| 1983 |
|---|
| 55 | | Alfred V. Aho,
John E. Hopcroft,
Jeffrey D. Ullman:
Data Structures and Algorithms.
Addison-Wesley 1983 |
| 1982 |
|---|
| 54 | | John E. Hopcroft,
Deborah Joseph,
Sue Whitesides:
On the Movement of Robot Arms in 2-Dimensional Bounded Regions
FOCS 1982: 280-289 |
| 53 | | Allan Borodin,
Joachim von zur Gathen,
John E. Hopcroft:
Fast Parallel Matrix and GCD Computations
FOCS 1982: 65-71 |
| 52 | | Allan Borodin,
John E. Hopcroft:
Routing, Merging and Sorting on Parallel Models of Computation (Extended Abstract)
STOC 1982: 338-344 |
| 51 | | Allan Borodin,
Joachim von zur Gathen,
John E. Hopcroft:
Fast Parallel Matrix and GCD Computations
Information and Control 52(3): 241-256 (1982) |
| 50 | | Richard Cole,
John E. Hopcroft:
On Edge Coloring Bipartite Graphs.
SIAM J. Comput. 11(3): 540-546 (1982) |
| 1981 |
|---|
| 49 | | John E. Hopcroft:
Recent Directions in Algorithmic Research.
Theoretical Computer Science 1981: 123-134 |
| 1980 |
|---|
| 48 | | Merrick L. Furst,
John E. Hopcroft,
Eugene M. Luks:
Polynomial-Time Algorithms for Permutation Groups
FOCS 1980: 36-41 |
| 47 | | Steven Fortune,
John E. Hopcroft,
James Wyllie:
The Directed Subgraph Homeomorphism Problem.
Theor. Comput. Sci. 10: 111-121 (1980) |
| 1979 |
|---|
| 46 | | John E. Hopcroft,
Jeffrey D. Ullman:
Introduction to Automata Theory, Languages and Computation.
Addison-Wesley 1979 |
| 45 | | Steven Fortune,
John E. Hopcroft:
A Note on Rabin's Nearest-Neighbor Algorithm.
Inf. Process. Lett. 8(1): 20-23 (1979) |
| 44 | | John E. Hopcroft,
Jean-Jacques Pansiot:
On the Reachability Problem for 5-Dimensional Vector Addition Systems.
Theor. Comput. Sci. 8: 135-159 (1979) |
| 1978 |
|---|
| 43 | | Steven Fortune,
John E. Hopcroft,
Erik Meineche Schmidt:
The Complexity of Equivalence and Containment for Free Single Variable Program Schemes.
ICALP 1978: 227-240 |
| 1977 |
|---|
| 42 | EE | John E. Hopcroft,
Wolfgang J. Paul,
Leslie G. Valiant:
On Time Versus Space.
J. ACM 24(2): 332-337 (1977) |
| 1976 |
|---|
| 41 | | Alfred V. Aho,
John E. Hopcroft,
Jeffrey D. Ullman:
On Finding Lowest Common Ancestors in Trees.
SIAM J. Comput. 5(1): 115-132 (1976) |
| 1975 |
|---|
| 40 | | John E. Hopcroft,
Wolfgang J. Paul,
Leslie G. Valiant:
On Time versus Space and Related Problems
FOCS 1975: 57-64 |
| 1974 |
|---|
| 39 | | Alfred V. Aho,
John E. Hopcroft,
Jeffrey D. Ullman:
The Design and Analysis of Computer Algorithms.
Addison-Wesley 1974 |
| 38 | | John E. Hopcroft:
Complexity of Computer Computations.
IFIP Congress 1974: 620-626 |
| 37 | | John E. Hopcroft,
J. K. Wong:
Linear Time Algorithm for Isomorphism of Planar Graphs (Preliminary Report)
STOC 1974: 172-184 |
| 36 | EE | John E. Hopcroft,
Robert Endre Tarjan:
Efficient Planarity Testing.
J. ACM 21(4): 549-568 (1974) |
| 1973 |
|---|
| 35 | | Alfred V. Aho,
John E. Hopcroft,
Jeffrey D. Ullman:
On Finding Lowest Common Ancestors in Trees
STOC 1973: 253-265 |
| 34 | | John E. Hopcroft,
J. Musinski:
Duality Applied to the Complexity of Matrix Multiplications and other Bilinear Forms
STOC 1973: 73-87 |
| 33 | | John E. Hopcroft,
Robert Endre Tarjan:
Efficient Algorithms for Graph Manipulation [H] (Algorithm 447).
Commun. ACM 16(6): 372-378 (1973) |
| 32 | | 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) |
| 31 | | John E. Hopcroft,
Robert Endre Tarjan:
Dividing a Graph into Triconnected Components.
SIAM J. Comput. 2(3): 135-158 (1973) |
| 30 | | 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) |
| 29 | | John E. Hopcroft,
Richard M. Karp:
An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs.
SIAM J. Comput. 2(4): 225-231 (1973) |
| 28 | | John E. Hopcroft,
Jeffrey D. Ullman:
Set Merging Algorithms.
SIAM J. Comput. 2(4): 294-303 (1973) |
| 1971 |
|---|
| 27 | | John E. Hopcroft,
Richard M. Karp:
A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs
FOCS 1971: 122-125 |
| 26 | | John E. Hopcroft,
Robert Endre Tarjan:
Planarity Testing in V log V Steps: Extended Abstract.
IFIP Congress (1) 1971: 85-90 |
| 25 | | John E. Hopcroft,
Robert Endre Tarjan:
A V² Algorithm for Determining Isomorphism of Planar Graphs.
Inf. Process. Lett. 1(1): 32-34 (1971) |
| 24 | EE | Juris Hartmanis,
John E. Hopcroft:
An Overview of the Theory of Computational Complexity.
J. ACM 18(2): 444-475 (1971) |
| 23 | | Seymour Ginsburg,
John E. Hopcroft:
Images of AFL under Certain Families of Homomorphisms.
Mathematical Systems Theory 5(3): 216-227 (1971) |
| 1970 |
|---|
| 22 | EE | Seymour Ginsburg,
John E. Hopcroft:
Two-way balloon automata and AFL.
J. ACM 17(1): 3-13 (1970) |
| 21 | | 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) |
| 20 | | Juris Hartmanis,
John E. Hopcroft:
What makes Some Language Theory Problems Undecidable.
J. Comput. Syst. Sci. 4(4): 368-376 (1970) |
| 1969 |
|---|
| 19 | | John E. Hopcroft,
L. R. Kerr:
Some Techniques for Proving Certain Simple Programs Optimal
FOCS 1969: 36-45 |
| 18 | | Allan Borodin,
Robert L. Constable,
John E. Hopcroft:
Dense and Non-Dense Families of Complexity Classes
FOCS 1969: 7-19 |
| 17 | EE | John E. Hopcroft,
Jeffrey D. Ullman:
Some Results on Tape-Bounded Turing Machines.
J. ACM 16(1): 168-177 (1969) |
| 16 | | Sheila A. Greibach,
John E. Hopcroft:
Scattered Context Grammars.
J. Comput. Syst. Sci. 3(3): 233-247 (1969) |
| 15 | | John E. Hopcroft:
On the Equivalence and Containment Problems for Context-Free Languages.
Mathematical Systems Theory 3(2): 119-124 (1969) |
| 14 | | Alfred V. Aho,
John E. Hopcroft,
Jeffrey D. Ullman:
A General Theory of Translation.
Mathematical Systems Theory 3(3): 193-221 (1969) |
| 1968 |
|---|
| 13 | | Seymour Ginsburg,
John E. Hopcroft:
Two-Way Balloon Automata and AFL
FOCS 1968: 292-297 |
| 12 | | Juris Hartmanis,
John E. Hopcroft:
Structure of Undecidable Problems in Automata Theory
FOCS 1968: 327-333 |
| 11 | | Sheila A. Greibach,
John E. Hopcroft:
Scattered context grammars.
IFIP Congress (1) 1968: 260-264 |
| 10 | | John E. Hopcroft,
Jeffrey D. Ullman:
Sets Accepted by One-Way Stack Automata Are Context Sensitive
Information and Control 13(2): 114-133 (1968) |
| 9 | | 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) |
| 8 | EE | John E. Hopcroft,
Jeffrey D. Ullman:
Decidable and Undecidable Questions About Automata.
J. ACM 15(2): 317-324 (1968) |
| 7 | EE | John E. Hopcroft,
Jeffrey D. Ullman:
Relations Between Time and Tape Complexities.
J. ACM 15(3): 414-427 (1968) |
| 6 | | John E. Hopcroft,
Jeffrey D. Ullman:
Deterministic Stack Automata and the Quotient Operator.
J. Comput. Syst. Sci. 2(1): 1-12 (1968) |
| 1967 |
|---|
| 5 | | John E. Hopcroft,
Jeffrey D. Ullman:
An Approach to a Unified Theory of Automata
FOCS 1967: 140-147 |
| 4 | | Peter Weiner,
John E. Hopcroft:
Modular Decomposition of Synchronous Sequential Machines
FOCS 1967: 233-239 |
| 3 | | John E. Hopcroft,
Jeffrey D. Ullman:
Two Results on One-Way Stack Automata
FOCS 1967: 37-44 |
| 2 | | John E. Hopcroft,
Jeffrey D. Ullman:
Nonerasing Stack Automata.
J. Comput. Syst. Sci. 1(2): 166-186 (1967) |
| 1966 |
|---|
| 1 | | A. J. Korenjak,
John E. Hopcroft:
Simple Deterministic Languages
FOCS 1966: 36-46 |
