John E. Hopcroft

Liaoruo Wang, John E. Hopcroft, Jing He, Hongyu Liang, Supasorn Suwajanakorn: Extracting the Core Structure of Social Networks Using (α, β)-Communities. Internet Mathematics 9(1): 58-81 (2013)

John E. Hopcroft: Making the World a Better Place. Logic and Program Semantics 2012: 328

John E. Hopcroft: Future Directions in Computer Science Research. ISAAC 2012: 1

Bruno D. Abrahao, Sucheta Soundarajan, John E. Hopcroft, Robert Kleinberg: On the separability of structural classes of communities. KDD 2012: 624-632

Liaoruo Wang, Stefano Ermon, John E. Hopcroft: Feature-Enhanced Probabilistic Models for Diffusion Network Inference. ECML/PKDD (2) 2012: 499-514

John E. Hopcroft: On the Impact of Turing Machines. TAMC 2012: 1-2

Sucheta Soundarajan, John E. Hopcroft: Using community information to improve the precision of link prediction methods. WWW (Companion Volume) 2012: 607-608

John E. Hopcroft, Sucheta Soundarajan, Liaoruo Wang: The Future of Computer Science. Int. J. Software and Informatics 5(4): 549-565 (2011)

John E. Hopcroft, Tiancheng Lou, Jie Tang: Who will follow you back?: reciprocal relationship prediction. CIKM 2011: 1137-1146

Liaoruo Wang, Tiancheng Lou, Jie Tang, John E. Hopcroft: Detecting Community Kernels in Large Social Networks. ICDM 2011: 784-793

Jing He, John E. Hopcroft, Hongyu Liang, Supasorn Suwajanakorn, Liaoruo Wang: Detecting the Structure of Social Networks Using (α, β)-Communities. WAW 2011: 26-37

Yookyung Jo, John E. Hopcroft, Carl Lagoze: The web of topics: discovering the topology of topic evolution in a corpus. WWW 2011: 257-266

John E. Hopcroft: New Research Directions in the Information Age. TAMC 2010: 1

Sucheta Soundarajan, John E. Hopcroft: Recovering Social Networks from Contagion Information. TAMC 2010: 419-430

Liaoruo Wang, John E. Hopcroft: Community Structure in Large Complex Networks. TAMC 2010: 455-466

Xiaotie Deng, John E. Hopcroft, Jinyun Xue (Eds.): Frontiers in Algorithmics, Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009. Proceedings. Lecture Notes in Computer Science 5598, Springer 2009, isbn 978-3-642-02269-2

Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng: Local Computation of PageRank Contributions. Internet Mathematics 5(1): 23-45 (2008)

John E. Hopcroft, Daniel Sheldon: Manipulation-Resistant Reputations Using Hitting Time. Internet Mathematics 5(1): 71-90 (2008)

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

John E. Hopcroft: Computer Science in the Information Age. FAW 2008: 2

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

André Allavena, Anirban Dasgupta, John E. Hopcroft, Ravi Kumar: Finding (Short) Paths in Social Networks. Internet Mathematics 3(2): 129-146 (2007)

Anirban Dasgupta, John E. Hopcroft, Ravi Kannan, Pradipta Prometheus Mitra: Spectral clustering with limited independence. SODA 2007: 1036-1045

John E. Hopcroft, Daniel Sheldon: Manipulation-Resistant Reputations Using Hitting Time. WAW 2007: 68-81

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

Anirban Dasgupta, John E. Hopcroft, Ravi Kannan, Pradipta Prometheus Mitra: Spectral Clustering by Recursive Partitioning. ESA 2006: 256-267

Anirban Dasgupta, John E. Hopcroft, Jon M. Kleinberg, Mark Sandler: On Learning Mixtures of Heavy-Tailed Distributions. FOCS 2005: 491-500

Thorsten Joachims, John E. Hopcroft: Error bounds for correlation clustering. ICML 2005: 385-392

André Allavena, Alan J. Demers, John E. Hopcroft: Correctness of a gossip based membership protocol. PODC 2005: 292-301

Anirban Dasgupta, John E. Hopcroft, Frank McSherry: Spectral Analysis of Random Graphs with Skewed Degree Distributions. FOCS 2004: 602-610

John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman: Introduction to automata theory, languages, and computation - international edition (2. ed). Addison-Wesley 2003, isbn 978-0-321-21029-6, pp. I-XIV, 1-521

John E. Hopcroft, Omar Khan, Brian Kulis, Bart Selman: Natural communities in large linked networks. KDD 2003: 541-546

John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman: Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie (2. Aufl.). Pearson Studium 2002, isbn 978-3-8273-7020-4, pp. 1-528

John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman: Introduction to automata theory, languages, and computation - (2. ed.). Addison-Wesley series in computer science, Addison-Wesley-Longman 2001, isbn 978-0-201-44124-6, pp. I-XIV, 1-521

John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman: Introduction to automata theory, languages, and computation, 2nd edition. SIGACT News 32(1): 60-65 (2001)

John E. Hopcroft, Jeffrey D. Ullman: Introduction to Automata Theory, Languages and Computation, Second Edition. Addison-Wesley 2000

John E. Hopcroft: Automata Theory: Its Past and Future. A Half-Century of Automata Theory 2000: 37-47

John E. Hopcroft, Jeffrey D. Ullman: Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie (3. Aufl.). Internationale Computer-Bibliothek, Addison-Wesley 1994, isbn 978-3-89319-744-6, pp. I-IX, 1-461

John E. Hopcroft, Peter J. Kahn: A Paradigm for Robust Geometric Algorithms. Algorithmica 7(4): 339-380 (1992)

John E. Hopcroft, Jeffrey D. Ullman: Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie (2. Aufl.). Internationale Computer-Bibliothek, Addison-Wesley 1990, isbn 978-3-89319-181-9, pp. I-IX, 1-461

John E. Hopcroft, Kenneth W. Kennedy: Computer science - achievements and opportunities. SIAM 1989, isbn 978-0-87871-236-6, pp. I-VII, 1-78

John E. Hopcroft: Electronic Prototyping. IEEE Computer 22(3): 55-57 (1989)

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)

Christoph M. Hoffmann, John E. Hopcroft, Michael S. Karasick: Towards Implementing Robust Geometric Computations. Symposium on Computational Geometry 1988: 106-117

John E. Hopcroft: Computer Science: The Emergence of a Discipline. Commun. ACM 30(3): 198-202 (1987)

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)

John E. Hopcroft: The Promise of Electronic Prototyping. MFCS 1986: 128-139

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, isbn 0-201-00023-7

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)

Allan Borodin, Joachim von zur Gathen, John E. Hopcroft: Fast Parallel Matrix and GCD Computations. FOCS 1982: 65-71

John E. Hopcroft, Deborah Joseph, Sue Whitesides: On the Movement of Robot Arms in 2-Dimensional Bounded Regions. FOCS 1982: 280-289

Allan Borodin, John E. Hopcroft: Routing, Merging and Sorting on Parallel Models of Computation (Extended Abstract). STOC 1982: 338-344

John E. Hopcroft: Recent Directions in Algorithmic Research. Theoretical Computer Science 1981: 123-134

Steven Fortune, John E. Hopcroft, James Wyllie: The Directed Subgraph Homeomorphism Problem. Theor. Comput. Sci. 10: 111-121 (1980)

Merrick L. Furst, John E. Hopcroft, Eugene M. Luks: Polynomial-Time Algorithms for Permutation Groups. FOCS 1980: 36-41

John E. Hopcroft, Jeffrey D. Ullman: Introduction to Automata Theory, Languages and Computation. Addison-Wesley 1979, isbn 0-201-02988-X

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)

John E. Hopcroft, Emily P. Friedman, Michael A. Harrison (Eds.): Proceedings of the 9th Annual ACM Symposium on Theory of Computing, May 4-6, 1977, Boulder, Colorado, USA. ACM 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, isbn 0-201-00029-6

John E. Hopcroft, Robert Endre Tarjan: Efficient Planarity Testing. J. ACM 21(4): 549-568 (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 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, J. Musinski: Duality Applied to the Complexity of Matrix Multiplications and other Bilinear Forms. STOC 1973: 73-87

Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: On Finding Lowest Common Ancestors in Trees. STOC 1973: 253-265

John E. Hopcroft, Robert Endre Tarjan: Isomorphism of Planar Graphs. Complexity of Computer Computations 1972: 131-152

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)

John E. Hopcroft, Richard M. Karp: A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs. SWAT (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

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, 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)

Allan Borodin, Robert L. Constable, John E. Hopcroft: Dense and Non-Dense Families of Complexity Classes. SWAT (FOCS) 1969: 7-19

John E. Hopcroft, L. R. Kerr: Some Techniques for Proving Certain Simple Programs Optimal. SWAT (FOCS) 1969: 36-45

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)

Seymour Ginsburg, John E. Hopcroft: Two-Way Balloon Automata and AFL. SWAT (FOCS) 1968: 292-297

Juris Hartmanis, John E. Hopcroft: Structure of Undecidable Problems in Automata Theory. SWAT (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: Nonerasing Stack Automata. J. Comput. Syst. Sci. 1(2): 166-186 (1967)

John E. Hopcroft, Jeffrey D. Ullman: Two Results on One-Way Stack Automata. SWAT (FOCS) 1967: 37-44

John E. Hopcroft, Jeffrey D. Ullman: An Approach to a Unified Theory of Automata. SWAT (FOCS) 1967: 140-147

Peter Weiner, John E. Hopcroft: Modular Decomposition of Synchronous Sequential Machines. SWAT (FOCS) 1967: 233-239

A. J. Korenjak, John E. Hopcroft: Simple Deterministic Languages. SWAT (FOCS) 1966: 36-46