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