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