John Hopcroft

Q: What Schools Are Affiliated With John Hopcroft

John Hopcroft is affiliated with the following schools: Seattle University, Stanford University, Cornell University

John Hopcroft's AcademicInfluence.com Rankings

John Hopcroft

Computer Science

#65

World Rank

#67

Historical Rank

#39

USA Rank

Database

#52

World Rank

#54

Historical Rank

#29

USA Rank

computer-science Degrees

Download Badge

Computer Science

John Hopcroft's Degrees

PhD Electrical Engineering Stanford University
Masters Electrical Engineering Stanford University
Bachelors Electrical Engineering Seattle University

Why Is John Hopcroft Influential?

(Suggest an Edit or Addition)

According to Wikipedia, John Edward Hopcroft is an American theoretical computer scientist. His textbooks on theory of computation and data structures are regarded as standards in their fields. He is the IBM Professor of Engineering and Applied Mathematics in Computer Science at Cornell University, Co-Director of the Center on Frontiers of Computing Studies at Peking University, and the Director of the John Hopcroft Center for Computer Science at Shanghai Jiao Tong University.

(See a Problem?)

John Hopcroft's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Introduction to Automata Theory, Languages and Computation (1979) (14194)
The Design and Analysis of Computer Algorithms (1974) (9467)
A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs (1971) (2845)
Data Structures and Algorithms (1983) (1948)
Formal languages and their relation to automata (1969) (1627)
Introduction to automata theory, languages, and computation, 2nd edition (2001) (1355)
Efficient Planarity Testing (1974) (1152)
Algorithm 447: efficient algorithms for graph manipulation (1973) (945)
An n log n algorithm for minimizing states in a finite automaton (1971) (939)
Dividing a Graph into Triconnected Components (1973) (878)
The Directed Subgraph Homeomorphism Problem (1978) (730)
Snapshot Ensembles: Train 1, get M for free (2017) (661)
Stacked Generative Adversarial Networks (2016) (421)
Are randomly grown graphs really random? (2001) (379)
Efficient algorithms for graph manipulation (1971) (362)
Linear time algorithm for isomorphism of planar graphs (Preliminary Report) (1974) (354)
Tracking evolving communities in large linked networks (2004) (332)
Triangular Factorization and Inversion by Fast Matrix Multiplication (1974) (310)
Polynomial-time algorithms for permutation groups (1980) (284)
Complexity of Computer Computations (1974) (283)
Fast parallel matrix and GCD computations (1982) (265)
On Time Versus Space (1977) (265)
Tracing surface intersections (1988) (265)
On the Reachability Problem for 5-Dimensional Vector Addition Systems (1976) (263)
Routing, Merging, and Sorting on Parallel Models of Computation (1985) (262)
Planning, geometry, and complexity of robot motion (1986) (253)
Routing, merging and sorting on parallel models of computation (1982) (248)
Convergent Learning: Do different neural networks learn the same representations? (2015) (245)
On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem" (1984) (240)
Foundations of Data Science (2020) (237)
Simple Deterministic Languages (1966) (213)
Nesterov Accelerated Gradient and Scale Invariance for Adversarial Attacks (2019) (200)
On finding lowest common ancestors in trees (1973) (181)
Set Merging Algorithms (1973) (174)
Who will follow you back?: reciprocal relationship prediction (2011) (173)
Local Computation of PageRank Contributions (2007) (163)
Natural communities in large linked networks (2003) (163)
On Minimizing the Number of Multiplications Necessary for Matrix Multiplication (1969) (162)
Isomorphism of Planar Graphs (1972) (148)
Scattered Context Grammars (1969) (139)
Correctness of a gossip based membership protocol (2005) (138)
Robust set operations on polyhedral solids (1987) (136)
Movement Problems for 2-Dimensional Linkages (1984) (133)
The Potential Method for Blending Surfaces and Corners (1985) (130)
An Overview of the Theory of Computational Complexity (1971) (128)
A Linear Algorithm for Testing Equivalence of Finite Automata. (1971) (124)
Uncovering the Small Community Structure in Large Networks: A Local Spectral Approach (2015) (121)
Towards implementing robust geometric computations (1988) (115)
Adversarially Robust Generalization Just Requires More Unlabeled Data (2019) (115)
On the movement of robot arms in 2-dimensional bounded regions (1982) (114)
Using community information to improve the precision of link prediction methods (2012) (110)
Learning to predict reciprocity and triadic closure in social networks (2013) (107)
On Edge Coloring Bipartite Graphs (1980) (106)
Proceedings of the fifth annual ACM symposium on Theory of computing (1977) (103)
Quadratic blending surfaces (1985) (100)
Improving the Generalization of Adversarial Training with Domain Adaptation (2018) (99)
Some Results on Tape-Bounded Turing Machines (1969) (95)
Time and Tape Complexity of Pushdown Automaton Languages (1968) (94)
The Complexity of Equivalence and Containment for Free Single Variable Program Schemes (1978) (93)
Hidden Community Detection in Social Networks (2017) (92)
Studies In Abstract Families Of Languages (1969) (89)
Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms (1973) (88)
Towards Understanding Learning Representations: To What Extent Do Different Neural Networks Learn the Same Representation (2018) (86)
Modeling, mesh generation, and adaptive numerical methods for partial differential equations (1995) (85)
The design and analysis of algorithms (1974) (83)
On time versus space and related problems (1975) (81)
A V log V Algorithm for Isomorphism of Triconnected Planar Graphs (1973) (80)
An Approach to a Unified Theory of Automata (1967) (80)
The web of topics: discovering the topology of topic evolution in a corpus (2011) (79)
Introduction to automata theory, languages, and computation - international edition, 2nd Edition (2003) (78)
A Case Study of Flexible Object Manipulation (1991) (78)
Motion of Objects in Contact (1984) (78)
Detecting Community Kernels in Large Social Networks (2011) (77)
Simulation of physical systems from geometric models (1987) (76)
A Powerful Generative Model Using Random Weights for the Deep Image Representation (2016) (75)
Efficient Detection of Intersections among Spheres (1983) (75)
The Lifecycle and Cascade of WeChat Social Messaging Groups (2015) (71)
A V² Algorithm for Determining Isomorphism of Planar Graphs (1971) (69)
On the Harmonious Coloring of Graphs (1983) (69)
Detecting Overlapping Communities from Local Spectral Subspaces (2015) (67)
Independence results in computer science (1976) (65)
Local Spectral Clustering for Overlapping Community Detection (2018) (65)
Single Image Reflection Removal Through Cascaded Refinement (2019) (61)
Deep Manifold Traversal: Changing Labels with Convolutional Features (2015) (58)
On learning mixtures of heavy-tailed distributions (2005) (57)
Feature-Enhanced Probabilistic Models for Diffusion Network Inference (2012) (57)
Spectral analysis of random graphs with skewed degree distributions (2004) (56)
Manipulation-Resistant Reputations Using Hitting Time (2007) (56)
On the separability of structural classes of communities (2012) (54)
Sign Cauchy Projections and Chi-Square Kernel (2013) (53)
Reducing Multiple Object Motion Planning to Graph Searching (1984) (52)
A general theory of translation (1969) (51)
Robust Local Features for Improving the Generalization of Adversarial Training (2019) (50)
Nonerasing Stack Automata (1967) (50)
Automatic surface generation in computer aided design (2005) (48)
In a World That Counts: Clustering and Detecting Fake Social Engagement at Scale (2015) (46)
What makes Some Language Theory Problems Undecidable (1970) (46)
Synthesis of Minimal Threshold Logic Networks (1965) (45)
Spectral Clustering by Recursive Partitioning (2006) (43)
, “Introduction to Automata Theory, Languages and Computations”, second Edition, Pearson Education, 2007 (2015) (38)
Reasoning about Xml Schema Languages Using Formal Language Theory (2000) (37)
Duality applied to the complexity of matrix multiplications and other bilinear forms (1973) (36)
Decreasing the Nesting Depth of Expressions Involving Square Roots (1985) (35)
A paradigm for robust geometric algorithms (1989) (35)
Relations Between Time and Tape Complexities (1968) (34)
Robust PageRank and locally computable spam detection features (2008) (34)
Computer science: the emergence of a discipline (1987) (33)
Best Conditioned Parametric Identification of Transfer Function Models in the Frequency Domain (1995) (32)
Error bounds for correlation clustering (2005) (32)
Finding the Triconnected Components of a Graph (1972) (30)
A Note on Rabin's Nearest-Neighbor Algorithm (1978) (30)
Use of Local Group Information to Identify Communities in Networks (2015) (30)
Recent Directions in Algorithmic Research (1981) (29)
The impact of robotics on computer science (1986) (26)
“Introduction to Automata Theory, Languages and Computations”, Second Edition, Pearson Education, 2008. (UNIT 1,2,3) 2 (2015) (24)
Some Techniques for Proving Certain Simple Programs Optimal (1969) (24)
AT-GAN: A Generative Attack Model for Adversarial Transferring on Generative Adversarial Nets (2019) (24)
The Geometry of Projective Blending Surfaces (1988) (24)
Krylov Subspace Approximation for Local Community Detection in Large Networks (2017) (23)
A separability framework for analyzing community structure (2014) (23)
Geometric ambiguities in boundary representations (1986) (22)
Local Lanczos Spectral Approximation for Community Detection (2017) (22)
Modular Decomposition of Synchronous Sequential Machines (1967) (21)
Planarity Testing in V log V Steps: Extended Abstract (1971) (20)
Robust Iterators in ET++ (1992) (20)
Encoding of analog signals for binary symmetric channels (1966) (20)
On the equivalence and containment problems for context-free languages (1969) (20)
Dense and Non-Dense Families of Complexity Classes (1969) (20)
AT-GAN: An Adversarial Generator Model for Non-constrained Adversarial Examples (2019) (19)
Revealing Multiple Layers of Hidden Community Structure in Networks (2015) (19)
Detecting the Structure of Social Networks Using (α, β)-Communities (2011) (19)
Sets Accepted by One-Way Stack Automata Are Context Sensitive (1968) (18)
Affine invariants for model-based recognition (1992) (18)
Two-way balloon automata and AFL (1968) (17)
Deterministic Stack Automata and the Quotient Operator (1968) (17)
Spectral clustering with limited independence (2007) (16)
Acm Sigcomm –101– Computer Communication Review 8 Related Work Acm Sigcomm –100– Computer Communication Review 7 Hierarchical Multicast Routing 6 Link-state Multicast Routing 5.4 Reverse Path Multicasting (rpm) (1982) (16)
Bounded fan-in, bounded fan-out uniform decompositions of synchronous sequential machines (1968) (16)
Locally-biased spectral approximation for community detection (2019) (15)
Model generation and modification for dynamic systems from geometric data (1988) (15)
Stochastic Variance Reduced Ensemble Adversarial Attack for Boosting the Adversarial Transferability (2021) (14)
Network Reputation Games (2008) (13)
Extracting the Core Structure of Social Networks Using (α, β)-Communities (2013) (13)
Electronic prototyping (1988) (13)
Decidable and Undecidable Questions About Automata (1968) (12)
An n log n algorithm for isomorphism of planar triply connected graphs (1971) (12)
Making the World a Better Place (2012) (12)
Learning Latent Topics from the Word Co-occurrence Network (2017) (11)
Overlapping Community Detection via Local Spectral Clustering (2015) (11)
Structure of Undecidable Problems in Automata Theory (1968) (11)
Community Structure in Large Complex Networks (2010) (10)
Nesterov Accelerated Gradient and Scale Invariance for Improving Transferability of Adversarial Examples (2019) (10)
Curvature-based Comparison of Two Neural Networks (2018) (10)
Finite-state Modulation Codes for Data Storage, Ieee Sliding-block Coding for Input-restricted Channels, Ieee (9)
A Note on Cryptography and NP$\cap$ CoNP-P (1978) (9)
A Linear Time Algorithm for the Generalized Consecutive Retrieval Problem (1979) (9)
Error correction for formal languages (1966) (9)
On the Computational Power of Pushdown Automata (1970) (8)
A Note on Cryptography and NPnCoNP-P, (1978) (8)
Merging on Parallel Models of Computation (1981) (7)
Two Results on One-Way Stack Automata (1967) (6)
Recovering Social Networks from Contagion Information (2010) (6)
A Class of Finite Memory Interpolation Filters (1968) (6)
Understanding Deep Representations through Random Weights (2017) (6)
Sign Stable Projections, Sign Cauchy Projections and Chi-Square Kernels (2013) (6)
Determining Points of a Circular Region Reachable by Joints of a Robot Arm (1982) (6)
A Linear List Merging Algorithm (2008) (5)
Adaptive Wavelet Clustering for Highly Noisy Data (2018) (5)
Deep Compression on Convolutional Neural Network for Artistic Style Transfer (2017) (5)
Integrating Large Circular Kernels into CNNs through Neural Architecture Search (2021) (5)
Use of Supervised Learning to Predict Directionality of Links in a Network (2012) (5)
Special Issue for FAW 2014 (2016) (4)
Colloquium Tracking evolving communities in large linked networks (2004) (4)
A new anchor word selection method for the separable topic discovery (2019) (4)
INDEPENDENCE OF AFL OPERATION. (1967) (4)
Algebraic structure theory of sequential machines: by J. Hartmanis and R. E. Stearns. 211 pages, diagrams, 6 × 9 in. Englewood Cliffs, New Jersey, Prentice-Hall, Inc., 1966. Price, $12.00 (1967) (3)
Deep Neural Networks and the Tree of Life (2016) (3)
Neighbourhood-preserving dimension reduction via localised multidimensional scaling (2017) (3)
Toward better computer science: Dependent on software, the United States needs a national policy on computer-science research: The scientists need more time and money for research, teaching, and leadership (1987) (3)
Current research in robotics and automation-electronic prototyping (1989) (3)
Why Robust Generalization in Deep Learning is Difficult: Perspective of Expressive Power (2022) (3)
Toward better computer science (1987) (3)
Krylov Subspace Approximation for Local Community Detection (2017) (3)
On Planar Point Matching under Affine Transformation (1989) (3)
The Lifecycle and Cascade of Social Messaging Groups (2015) (2)
Integrating Circle Kernels into Convolutional Neural Networks (2021) (2)
Hidden Community Detection on Two-layer Stochastic Models: a Theoretical Prospective (2020) (2)
Automata Theory: Its Past and Future (2001) (2)
The Local Dimension of Deep Manifold (2017) (2)
Routing in Networks (1981) (1)
Computer science - achievements and opportunities (1989) (1)
HoSIM: Higher-order Structural Importance based Method for Multiple Local Community Detection (2022) (1)
Detecting the Structure of Social Networks using (\alpha, \beta)-Communities (2011) (1)
Images of AFL under certain families of homomorphisms (1971) (1)
Best-Fit Subspaces and Singular Value Decomposition (SVD) (2020) (1)
Information, Data, Security in a Networked Future (2012) (1)
IV / FAST PARALLEL MATRIX AND GCD COMPUTATIONS (1)
On the Stability of Web Crawling and Web Search (2008) (1)
Computer Science the Past and the Future (1990) (1)
Random Walks and Markov Chains (2020) (1)
On the Impact of Turing Machines (2012) (1)
TRANSACTIONS ON COMPUTERS , MAY 1970 Reviews of Papers in the Computer Field (2006) (1)
Quantifying knowledge from the perspective of information structurization (2023) (1)
The Future of Computer Science (2011) (1)
Algorithms, analysis of (2003) (1)
Future Directions in Computer Science Research (2012) (1)
Reviews of Books and Papers in the Computer Field (1967) (1)
Hierarchical Hidden Community Detection for Protein Complex Prediction (2019) (1)
ProHiCo: A Probabilistic Framework to Hide Communities in Large Networks (2021) (1)
Frontiers in Algorithmics (2015) (1)
On the structure of communities in networks (2012) (0)
Inference Rules (2022) (0)
Patent Number : 45 ) Date of Patent : 5 , 123 , 045 Jun . 16 , 1992 54 : COMPREHENSIVE SOFTWARE (0)
Class-aware Information for Logit-based Knowledge Distillation (2022) (0)
7 Conclusions, Open Questions and Further Research (1995) (0)
Phase transitions and other phenomena in graphs grown with preferential attachment (2006) (0)
Hybrid Network Learning (2020) (0)
PIAT: Parameter Interpolation based Adversarial Training for Image Classification (2023) (0)
TO STUDIES AMONG THE SEDENTARY INDIANS OF NEW MEXICO REPORT ON THE RUINS OF THE PUEBLO (2014) (0)
Reflections on Computer Science (1990) (0)
A Conversation with John E. Hopcroft (2015) (0)
The Natural Communities Algorithm for Tracking the Evolution of Large Networks (2004) (0)
Algorithmic Problems in Modeling and Electronic Prototyping (1987) (0)
Lower Bounds for Constant Depth Circuits for Preex Problems, in Proc. of 10th International 5. Conclusion and Open Problems (1992) (0)
LOWER BOUNDS FOR GEOMETRICAL AND PHYSICALPROBLEMSJ URGEN SELLEN (1996) (0)
On the Complexity of Bayesian Generalization (2022) (0)
Proceedings of the 3d International Workshop on Frontiers in Algorithmics (2009) (0)
Refinement of Hierarchies of Time Bounded Computations (1968) (0)
Benchmark Prog. Size (1997) (0)
Learning Using Spectral Methods (2006) (0)
Computer Science in the Information Age (2008) (0)
The structure and dynamics of large social networks (2013) (0)
CS 381 Instructor : Professor (2006) (0)
The mathematical work of Jon Kleinberg (2007) (0)
A Comment on "Improving a Nonenumerative Method to Estimate Path Delay Fault Coverage" (1999) (0)
Nonlinear Dimension Reduction by Local Multidimensional Scaling (2016) (0)
Structure Amplification on Multi-layer Stochastic Block Models (2021) (0)
Jv J Jej) Algorithm for Finding Maxi- Perfect Matching under Translation 7 Perfect Matching under Translation (0)
Using Computer Design and Simulation to Improve Manufacturing Productivity. Report Period 1, 2 & 3 (1989) (0)
Binary encoding of analog signals for noisy channels (1965) (0)
5. Conclusion and Open Problems Step 4.3 for Each Internal Node Build Tablem , 1 for Array M in M , Level of the Tree Number of Children per Node (0)
Algorithms for Massive Data Problems: Streaming, Sketching, and Sampling (2020) (0)
TheMathematicalWork of Jon Kleinberg (2007) (0)
Randomness in Deconvolutional Networks for Visual Representation (2017) (0)
Robotics: A Long Range Plan to Maximize National Capabilities (1990) (0)
Adaptive Wavelet Clustering for High Noise Data (2018) (0)
Local Magnification for Data and Feature Augmentation (2022) (0)
PRE-AFL (ABSTRACT FAMILY OF LANGUAGES). (1967) (0)
Representation, manipulation, and reasoning about physical objects (1985) (0)
A Program of Continuing Research on Representing, Manipulating, and Reasoning about Physical Objects (1991) (0)
Special Issue for FAW 2014 (2016) (0)
New Research Directions in the Information Age (2010) (0)
Uncovering the Local Hidden Community Structure in Social Networks (2021) (0)
Elementary complexity theory November 17 , 2018 1 Languages , automata (2018) (0)
R70-2 Nested Stack Automata (1970) (0)
Problem 1 Is It True That for for K 2 Ldtc(k; 1) (1992) (0)
Formal languages II (1973) (0)
Parallel Algorithms for Shared-memory Machines. a Standard Wasteful Implementation (1996) (0)
Finding (Short) Paths in Social Networks (2006) (0)
A recognition algorithm for pushdown store systems (1968) (0)
Elementary complexity theory (2019) (0)
The Promise of Electronic Prototyping (1986) (0)
Lecture 16: Small World Graphs (2008) (0)
Week 14 : Wednesday , Nov 25 A regression puzzle (2009) (0)
The work of Jon Kleinberg (2007) (0)
Savage Enhanced with Recognition and Reporting of Hierarchical Structure of Errors INSIDE (2003) (0)
0.1. Minimizing Finite State Machines 1 0.1 Minimizing Finite State Machines (0)
Examining behavioral effects of player sex in two large-scale MMOs (2012) (0)
Name Fundamental Mechanism References (0)
Annual Cumulative Subject Index (1965) (0)
5.2 Dynamic Matching 5.1 Parallel Static Dictionary Matching 3.2 Compressed Tries 4 Trie Based Dictionary Matching Algorithm 4.1 a Separator Decomposition Tree 3.1 Denition and Construction (2007) (0)
Frontiers in Algorithmics, Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009. Proceedings (2009) (0)

This paper list is powered by the following services:

Other Resources About John Hopcroft

What Schools Are Affiliated With John Hopcroft?

John Hopcroft is affiliated with the following schools:

John Hopcroft's Academic­Influence.com Rankings