Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
John E. Hopcroft
2010 – today
- 2013
[j48]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)- 2012
- [c51]
- [c50]
- [c49]Bruno D. Abrahao, Sucheta Soundarajan, John E. Hopcroft, Robert Kleinberg: On the separability of structural classes of communities. KDD 2012: 624-632
- [c48]Liaoruo Wang, Stefano Ermon, John E. Hopcroft: Feature-Enhanced Probabilistic Models for Diffusion Network Inference. ECML/PKDD (2) 2012: 499-514
- [c47]
- [c46]Sucheta Soundarajan, John E. Hopcroft: Using community information to improve the precision of link prediction methods. WWW (Companion Volume) 2012: 607-608
- 2011
- [j47]John E. Hopcroft, Sucheta Soundarajan, Liaoruo Wang: The Future of Computer Science. Int. J. Software and Informatics 5(4): 549-565 (2011)
- [c45]John E. Hopcroft, Tiancheng Lou, Jie Tang: Who will follow you back?: reciprocal relationship prediction. CIKM 2011: 1137-1146
- [c44]Liaoruo Wang, Tiancheng Lou, Jie Tang, John E. Hopcroft: Detecting Community Kernels in Large Social Networks. ICDM 2011: 784-793
- [c43]Jing He, John E. Hopcroft, Hongyu Liang, Supasorn Suwajanakorn, Liaoruo Wang: Detecting the Structure of Social Networks Using (α, β)-Communities. WAW 2011: 26-37
- [c42]Yookyung Jo, John E. Hopcroft, Carl Lagoze: The web of topics: discovering the topology of topic evolution in a corpus. WWW 2011: 257-266
- 2010
- [c41]
- [c40]Sucheta Soundarajan, John E. Hopcroft: Recovering Social Networks from Contagion Information. TAMC 2010: 419-430
- [c39]
2000 – 2009
- 2009
- [e2]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
- 2008
- [j46]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)
- [j45]John E. Hopcroft, Daniel Sheldon: Manipulation-Resistant Reputations Using Hitting Time. Internet Mathematics 5(1): 71-90 (2008)
- [c38]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
- [c37]
- [c36]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
- [j44]André Allavena, Anirban Dasgupta, John E. Hopcroft, Ravi Kumar: Finding (Short) Paths in Social Networks. Internet Mathematics 3(2): 129-146 (2007)
- [c35]Anirban Dasgupta, John E. Hopcroft, Ravi Kannan, Pradipta Prometheus Mitra: Spectral clustering with limited independence. SODA 2007: 1036-1045
- [c34]John E. Hopcroft, Daniel Sheldon: Manipulation-Resistant Reputations Using Hitting Time. WAW 2007: 68-81
- [c33]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
- 2006
- [c32]Anirban Dasgupta, John E. Hopcroft, Ravi Kannan, Pradipta Prometheus Mitra: Spectral Clustering by Recursive Partitioning. ESA 2006: 256-267
- 2005
- [c31]Anirban Dasgupta, John E. Hopcroft, Jon M. Kleinberg, Mark Sandler: On Learning Mixtures of Heavy-Tailed Distributions. FOCS 2005: 491-500
- [c30]
- [c29]André Allavena, Alan J. Demers, John E. Hopcroft: Correctness of a gossip based membership protocol. PODC 2005: 292-301
- 2004
- [c28]Anirban Dasgupta, John E. Hopcroft, Frank McSherry: Spectral Analysis of Random Graphs with Skewed Degree Distributions. FOCS 2004: 602-610
- 2003
- [b10]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
- [c27]John E. Hopcroft, Omar Khan, Brian Kulis, Bart Selman: Natural communities in large linked networks. KDD 2003: 541-546
- 2002
- [b9]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
- 2001
- [b8]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
- [j43]John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman: Introduction to automata theory, languages, and computation, 2nd edition. SIGACT News 32(1): 60-65 (2001)
- 2000
- [b7]John E. Hopcroft, Jeffrey D. Ullman: Introduction to Automata Theory, Languages and Computation, Second Edition. Addison-Wesley 2000
- [c26]John E. Hopcroft: Automata Theory: Its Past and Future. A Half-Century of Automata Theory 2000: 37-47
1990 – 1999
- 1994
- [b6]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
- 1992
- [j42]John E. Hopcroft, Peter J. Kahn: A Paradigm for Robust Geometric Algorithms. Algorithmica 7(4): 339-380 (1992)
- 1990
- [b5]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
1980 – 1989
- 1989
- [b4]John E. Hopcroft, Kenneth W. Kennedy: Computer science - achievements and opportunities. SIAM 1989, ISBN 978-0-87871-236-6, pp. I-VII, 1-78
- [j41]
- 1988
- [j40]Christoph M. Hoffmann, John E. Hopcroft: The Geometry of Projective Blending Surfaces. Artif. Intell. 37(1-3): 357-376 (1988)
- [j39]Chandrajit L. Bajaj, Christoph M. Hoffmann, Robert E. Lynch, John E. Hopcroft: Tracing surface intersections. Computer Aided Geometric Design 5(4): 285-307 (1988)
- [c25]Christoph M. Hoffmann, John E. Hopcroft, Michael S. Karasick: Towards Implementing Robust Geometric Computations. Symposium on Computational Geometry 1988: 106-117
- 1987
- [j38]John E. Hopcroft: Computer Science: The Emergence of a Discipline. Commun. ACM 30(3): 198-202 (1987)
- 1986
- [j37]
- [j36]John E. Hopcroft, Gordon T. Wilfong: Reducing Multiple Object Motion Planning to Graph Searching. SIAM J. Comput. 15(3): 768-785 (1986)
- [c24]
- 1985
- [j35]Allan Borodin, John E. Hopcroft: Routing, Merging, and Sorting on Parallel Models of Computation. J. Comput. Syst. Sci. 30(1): 130-145 (1985)
- [j34]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)
- [j33]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)
- [j32]Christoph M. Hoffmann, John E. Hopcroft: Automatic surface generation in computer aided design. The Visual Computer 1(2): 92-100 (1985)
- 1984
- [j31]John E. Hopcroft, Deborah Joseph, Sue Whitesides: Movement Problems for 2-Dimensional Linkages. SIAM J. Comput. 13(3): 610-629 (1984)
- 1983
- [b3]Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: Data Structures and Algorithms. Addison-Wesley 1983, ISBN 0-201-00023-7
- 1982
- [j30]Allan Borodin, Joachim von zur Gathen, John E. Hopcroft: Fast Parallel Matrix and GCD Computations. Information and Control 52(3): 241-256 (1982)
- [j29]Richard Cole, John E. Hopcroft: On Edge Coloring Bipartite Graphs. SIAM J. Comput. 11(3): 540-546 (1982)
- [c23]Allan Borodin, Joachim von zur Gathen, John E. Hopcroft: Fast Parallel Matrix and GCD Computations. FOCS 1982: 65-71
- [c22]John E. Hopcroft, Deborah Joseph, Sue Whitesides: On the Movement of Robot Arms in 2-Dimensional Bounded Regions. FOCS 1982: 280-289
- [c21]Allan Borodin, John E. Hopcroft: Routing, Merging and Sorting on Parallel Models of Computation (Extended Abstract). STOC 1982: 338-344
- 1981
- [c20]John E. Hopcroft: Recent Directions in Algorithmic Research. Theoretical Computer Science 1981: 123-134
- 1980
- [j28]Steven Fortune, John E. Hopcroft, James Wyllie: The Directed Subgraph Homeomorphism Problem. Theor. Comput. Sci. 10: 111-121 (1980)
- [c19]Merrick L. Furst, John E. Hopcroft, Eugene M. Luks: Polynomial-Time Algorithms for Permutation Groups. FOCS 1980: 36-41
1970 – 1979
- 1979
- [b2]John E. Hopcroft, Jeffrey D. Ullman: Introduction to Automata Theory, Languages and Computation. Addison-Wesley 1979, ISBN 0-201-02988-X
- [j27]Steven Fortune, John E. Hopcroft: A Note on Rabin's Nearest-Neighbor Algorithm. Inf. Process. Lett. 8(1): 20-23 (1979)
- [j26]John E. Hopcroft, Jean-Jacques Pansiot: On the Reachability Problem for 5-Dimensional Vector Addition Systems. Theor. Comput. Sci. 8: 135-159 (1979)
- 1978
- [c18]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
- [j25]John E. Hopcroft, Wolfgang J. Paul, Leslie G. Valiant: On Time Versus Space. J. ACM 24(2): 332-337 (1977)
- [e1]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
- 1976
- [j24]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
- [c17]John E. Hopcroft, Wolfgang J. Paul, Leslie G. Valiant: On Time versus Space and Related Problems. FOCS 1975: 57-64
- 1974
- [b1]Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley 1974, ISBN 0-201-00029-6
- [j23]
- [c16]
- [c15]John E. Hopcroft, J. K. Wong: Linear Time Algorithm for Isomorphism of Planar Graphs (Preliminary Report). STOC 1974: 172-184
- 1973
- [j22]John E. Hopcroft, Robert Endre Tarjan: Efficient Algorithms for Graph Manipulation [H] (Algorithm 447). Commun. ACM 16(6): 372-378 (1973)
- [j21]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)
- [j20]John E. Hopcroft, Robert Endre Tarjan: Dividing a Graph into Triconnected Components. SIAM J. Comput. 2(3): 135-158 (1973)
- [j19]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)
- [j18]John E. Hopcroft, Richard M. Karp: An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM J. Comput. 2(4): 225-231 (1973)
- [j17]
- [c14]John E. Hopcroft, J. Musinski: Duality Applied to the Complexity of Matrix Multiplications and other Bilinear Forms. STOC 1973: 73-87
- [c13]Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: On Finding Lowest Common Ancestors in Trees. STOC 1973: 253-265
- 1972
- [c12]John E. Hopcroft, Robert Endre Tarjan: Isomorphism of Planar Graphs. Complexity of Computer Computations 1972: 131-152
- 1971
- [j16]John E. Hopcroft, Robert Endre Tarjan: A V² Algorithm for Determining Isomorphism of Planar Graphs. Inf. Process. Lett. 1(1): 32-34 (1971)
- [j15]Juris Hartmanis, John E. Hopcroft: An Overview of the Theory of Computational Complexity. J. ACM 18(2): 444-475 (1971)
- [j14]Seymour Ginsburg, John E. Hopcroft: Images of AFL under Certain Families of Homomorphisms. Mathematical Systems Theory 5(3): 216-227 (1971)
- [c11]John E. Hopcroft, Richard M. Karp: A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs. SWAT (FOCS) 1971: 122-125
- [c10]John E. Hopcroft, Robert Endre Tarjan: Planarity Testing in V log V Steps: Extended Abstract. IFIP Congress (1) 1971: 85-90
- 1970
- [j13]
- [j12]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)
- [j11]Juris Hartmanis, John E. Hopcroft: What makes Some Language Theory Problems Undecidable. J. Comput. Syst. Sci. 4(4): 368-376 (1970)
1960 – 1969
- 1969
- [j10]John E. Hopcroft, Jeffrey D. Ullman: Some Results on Tape-Bounded Turing Machines. J. ACM 16(1): 168-177 (1969)
- [j9]Sheila A. Greibach, John E. Hopcroft: Scattered Context Grammars. J. Comput. Syst. Sci. 3(3): 233-247 (1969)
- [j8]John E. Hopcroft: On the Equivalence and Containment Problems for Context-Free Languages. Mathematical Systems Theory 3(2): 119-124 (1969)
- [j7]Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: A General Theory of Translation. Mathematical Systems Theory 3(3): 193-221 (1969)
- [c9]Allan Borodin, Robert L. Constable, John E. Hopcroft: Dense and Non-Dense Families of Complexity Classes. SWAT (FOCS) 1969: 7-19
- [c8]John E. Hopcroft, L. R. Kerr: Some Techniques for Proving Certain Simple Programs Optimal. SWAT (FOCS) 1969: 36-45
- 1968
- [j6]John E. Hopcroft, Jeffrey D. Ullman: Sets Accepted by One-Way Stack Automata Are Context Sensitive. Information and Control 13(2): 114-133 (1968)
- [j5]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)
- [j4]John E. Hopcroft, Jeffrey D. Ullman: Decidable and Undecidable Questions About Automata. J. ACM 15(2): 317-324 (1968)
- [j3]John E. Hopcroft, Jeffrey D. Ullman: Relations Between Time and Tape Complexities. J. ACM 15(3): 414-427 (1968)
- [j2]John E. Hopcroft, Jeffrey D. Ullman: Deterministic Stack Automata and the Quotient Operator. J. Comput. Syst. Sci. 2(1): 1-12 (1968)
- [c7]
- [c6]Juris Hartmanis, John E. Hopcroft: Structure of Undecidable Problems in Automata Theory. SWAT (FOCS) 1968: 327-333
- [c5]
- 1967
- [j1]John E. Hopcroft, Jeffrey D. Ullman: Nonerasing Stack Automata. J. Comput. Syst. Sci. 1(2): 166-186 (1967)
- [c4]
- [c3]John E. Hopcroft, Jeffrey D. Ullman: An Approach to a Unified Theory of Automata. SWAT (FOCS) 1967: 140-147
- [c2]Peter Weiner, John E. Hopcroft: Modular Decomposition of Synchronous Sequential Machines. SWAT (FOCS) 1967: 233-239
- 1966
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-02-07 21:44 CET by the dblp team