John Hopcroft | Academic Influence

Why Is John Hopcroft Influential?

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, and the Director of the John Hopcroft Center for Computer Science at Shanghai Jiao Tong University.

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 Papers

Introduction to Automata Theory, Languages and Computation (14018)
The Design and Analysis of Computer Algorithms (9427)
An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs (2540)
Data Structures and Algorithms (2098)
Formal languages and their relation to automata (1596)
A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs (1317)
Efficient Planarity Testing (1156)
Introduction to automata theory, languages, and computation, 2nd edition (1004)
An n log n algorithm for minimizing states in a finite automaton (907)
Algorithm 447: efficient algorithms for graph manipulation (875)
Dividing a Graph into Triconnected Components (871)
The Directed Subgraph Homeomorphism Problem (731)
Snapshot Ensembles: Train 1, get M for free (476)
Stacked Generative Adversarial Networks (369)
Are randomly grown graphs really random? (363)
Efficient algorithms for graph manipulation (355)
Linear time algorithm for isomorphism of planar graphs (Preliminary Report) (343)
Tracking evolving communities in large linked networks (318)
Routing, Merging, and Sorting on Parallel Models of Computation (301)
Triangular Factorization and Inversion by Fast Matrix Multiplication (295)
Polynomial-time algorithms for permutation groups (288)
On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem" (273)
On Time Versus Space (271)
On the Reachability Problem for 5-Dimensional Vector Addition Systems (261)
Tracing surface intersections (260)
Complexity of Computer Computations (259)
Planning, geometry, and complexity of robot motion (255)
Routing, merging and sorting on parallel models of computation (227)
Simple Deterministic Languages (222)
Convergent Learning: Do different neural networks learn the same representations? (190)
Fast parallel matrix and GCD computations (176)
Set Merging Algorithms (173)
Foundations of Data Science (167)
Who will follow you back?: reciprocal relationship prediction (163)
Natural communities in large linked networks (159)
Isomorphism of Planar Graphs (152)
On Minimizing the Number of Multiplications Necessary for Matrix Multiplication (150)
Scattered Context Grammars (141)
Fast parallel matrix and GCD computations (140)
Correctness of a gossip based membership protocol (136)
Robust set operations on polyhedral solids (134)
Movement Problems for 2-Dimensional Linkages (134)
An Overview of the Theory of Computational Complexity (132)
The Potential Method for Blending Surfaces and Corners (129)
On Edge Coloring Bipartite Graphs (126)
Local Computation of PageRank Contributions (123)
Towards implementing robust geometric computations (117)
The design and analysis of algorithms (114)
A Linear Algorithm for Testing Equivalence of Finite Automata. (113)
Uncovering the Small Community Structure in Large Networks: A Local Spectral Approach (111)
Some Results on Tape-Bounded Turing Machines (103)
On the movement of robot arms in 2-dimensional bounded regions (100)
Quadratic blending surfaces (99)
On finding lowest common ancestors in trees (96)
Learning to predict reciprocity and triadic closure in social networks (95)
Time and Tape Complexity of Pushdown Automaton Languages (94)
The Complexity of Equivalence and Containment for Free Single Variable Program Schemes (94)
Using community information to improve the precision of link prediction methods (92)
On Finding Lowest Common Ancestors in Trees (90)
On time versus space and related problems (86)
Studies In Abstract Families Of Languages (86)
A V log V Algorithm for Isomorphism of Triconnected Planar Graphs (82)
Motion of Objects in Contact (81)
Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms (81)
Improving the Generalization of Adversarial Training with Domain Adaptation (79)
Modeling, mesh generation, and adaptive numerical methods for partial differential equations (78)
Adversarially Robust Generalization Just Requires More Unlabeled Data (78)
Simulation of physical systems from geometric models (78)
The web of topics: discovering the topology of topic evolution in a corpus (77)
Efficient Detection of Intersections among Spheres (76)
Hidden Community Detection in Social Networks (75)
Nesterov Accelerated Gradient and Scale Invariance for Adversarial Attacks (74)
Detecting Community Kernels in Large Social Networks (73)
Independence results in computer science (71)
A Case Study of Flexible Object Manipulation (70)
Introduction to automata theory, languages, and computation - international edition, 2nd Edition (70)
On the Harmonious Coloring of Graphs (69)
A V² Algorithm for Determining Isomorphism of Planar Graphs (69)
A Powerful Generative Model Using Random Weights for the Deep Image Representation (68)
An approach to a unified theory of automata (62)
The Lifecycle and Cascade of WeChat Social Messaging Groups (61)
On learning mixtures of heavy-tailed distributions (57)
Detecting Overlapping Communities from Local Spectral Subspaces (57)
Towards Understanding Learning Representations: To What Extent Do Different Neural Networks Learn the Same Representation (56)
Deep Manifold Traversal: Changing Labels with Convolutional Features (56)
Feature-Enhanced Probabilistic Models for Diffusion Network Inference (55)
Spectral analysis of random graphs with skewed degree distributions (54)
Reducing Multiple Object Motion Planning to Graph Searching (54)
Nonerasing Stack Automata (52)
Automatic surface generation in computer aided design (51)
On the separability of structural classes of communities (50)
A general theory of translation (47)
Sign Cauchy Projections and Chi-Square Kernel (46)
Automatic Discovery of Logical Document Structure (46)
Synthesis of Minimal Threshold Logic Networks (45)
Local Spectral Clustering for Overlapping Community Detection (45)
What makes Some Language Theory Problems Undecidable (44)
Spectral Clustering by Recursive Partitioning (43)
An Approach to a Unified Theory of Automata (43)
Duality applied to the complexity of matrix multiplications and other bilinear forms (42)
, “Introduction to Automata Theory, Languages and Computations”, second Edition, Pearson Education, 2007 (39)
Relations Between Time and Tape Complexities (38)
Decreasing the Nesting Depth of Expressions Involving Square Roots (38)
Reasoning about Xml Schema Languages Using Formal Language Theory (38)
In a World That Counts: Clustering and Detecting Fake Social Engagement at Scale (37)
Local Computation of PageRank Contributions (35)
A paradigm for robust geometric algorithms (34)
A Note on Rabin's Nearest-Neighbor Algorithm (32)
Computer science: the emergence of a discipline (31)
Manipulation-Resistant Reputations Using Hitting Time (30)
Robust PageRank and locally computable spam detection features (30)
Robust Local Features for Improving the Generalization of Adversarial Training (29)
Recent Directions in Algorithmic Research (29)
Manipulation-Resistant Reputations Using Hitting Time (29)
Proceedings of the fifth annual ACM symposium on Theory of computing (28)
Use of Local Group Information to Identify Communities in Networks (28)
Finding the Triconnected Components of a Graph (28)
Single Image Reflection Removal Through Cascaded Refinement (27)
Error bounds for correlation clustering (27)
The Geometry of Projective Blending Surfaces (26)
The impact of robotics on computer science (25)
Geometric ambiguities in boundary representations (24)
A Subexponential Algorithm for Trivalent Graph Isomorphism (24)
Computational sustainability (24)
Some Techniques for Proving Certain Simple Programs Optimal (23)
A separability framework for analyzing community structure (23)
On the movement of robot arms in 2-dimensional bounded regions (22)
Modular Decomposition of Synchronous Sequential Machines (22)
On the equivalence and containment problems for context-free languages (22)
Local Lanczos Spectral Approximation for Community Detection (21)
Best Conditioned Parametric Identification of Transfer Function Models in the Frequency Domain (21)
Dense and Non-Dense Families of Complexity Classes (20)
“Introduction to Automata Theory, Languages and Computations”, Second Edition, Pearson Education, 2008. (UNIT 1,2,3) 2 (20)
Planarity Testing in V log V Steps: Extended Abstract (20)
Affine invariants for model-based recognition (19)
Detecting the Structure of Social Networks Using (α, β)-Communities (18)
Encoding of analog signals for binary symmetric channels (18)
Robust Iterators in ET++ (18)
Sets Accepted by One-Way Stack Automata Are Context Sensitive (18)
Revealing Multiple Layers of Hidden Community Structure in Networks (17)
Model generation and modification for dynamic systems from geometric data (17)
Deterministic Stack Automata and the Quotient Operator (17)
Two-way balloon automata and AFL (17)
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) (17)
Bounded fan-in, bounded fan-out uniform decompositions of synchronous sequential machines (16)
Spectral clustering with limited independence (16)
Krylov Subspace Approximation for Local Community Detection in Large Networks (15)
Extracting the Core Structure of Social Networks Using (α, β)-Communities (13)
Network Reputation Games (12)
An n log n algorithm for isomorphism of planar triply connected graphs (12)
Electronic prototyping (12)
AT-GAN: An Adversarial Generator Model for Non-constrained Adversarial Examples (12)
Learning Latent Topics from the Word Co-occurrence Network (11)
Decidable and Undecidable Questions About Automata (11)
Structure of Undecidable Problems in Automata Theory (10)
A Note on Cryptography and NP$\cap$ CoNP-P (10)
Community Structure in Large Complex Networks (10)
Overlapping Community Detection via Local Spectral Clustering (10)
Locally-biased spectral approximation for community detection (9)
Error correction for formal languages (9)
Making the World a Better Place (8)
Finite-state Modulation Codes for Data Storage, Ieee Sliding-block Coding for Input-restricted Channels, Ieee (8)
Curvature-based Comparison of Two Neural Networks (8)
Merging on Parallel Models of Computation (8)
A Linear Time Algorithm for the Generalized Consecutive Retrieval Problem (8)
Colloquium Tracking evolving communities in large linked networks (7)
On the Computational Power of Pushdown Automata (7)
Determining Points of a Circular Region Reachable by Joints of a Robot Arm (7)
A Class of Finite Memory Interpolation Filters (6)
Two Results on One-Way Stack Automata (6)
Understanding Deep Representations through Random Weights (6)
Sign Stable Projections, Sign Cauchy Projections and Chi-Square Kernels (6)
A Note on Cryptography and NPnCoNP-P, (6)
A Linear List Merging Algorithm (5)
Use of Supervised Learning to Predict Directionality of Links in a Network (5)
Special Issue for FAW 2014 (4)
Deep Compression on Convolutional Neural Network for Artistic Style Transfer (4)
Recovering Social Networks from Contagion Information (4)
INDEPENDENCE OF AFL OPERATION. (4)
On Planar Point Matching under Affine Transformation (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 (3)
Current research in robotics and automation-electronic prototyping (3)
Krylov Subspace Approximation for Local Community Detection (3)
A new anchor word selection method for the separable topic discovery (3)
Toward better computer science (3)
On the Movement of Robot Arms in 2-Dimensional Bounded Regions (2)
Two-Way Balloon Automata and AFL (2)
The Local Dimension of Deep Manifold (2)
Adaptive Wavelet Clustering for Highly Noisy Data (2)
Hidden Community Detection on Two-layer Stochastic Models: a Theoretical Prospective (2)
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 (2)
Computer science: the emergence of a discipline (2)
Automata Theory: Its Past and Future (2)
The Lifecycle and Cascade of Social Messaging Groups (2)
Routing in Networks (1)
Computer science - achievements and opportunities (1)
Information, Data, Security in a Networked Future (1)
Images of AFL under certain families of homomorphisms (1)
Frontiers in Algorithmics (1)
IV / FAST PARALLEL MATRIX AND GCD COMPUTATIONS (1)
TRANSACTIONS ON COMPUTERS , MAY 1970 Reviews of Papers in the Computer Field (1)
On the Stability of Web Crawling and Web Search (1)
Best-Fit Subspaces and Singular Value Decomposition (SVD) (1)
Algorithms, analysis of (1)
Random Walks and Markov Chains (1)
Detecting the Structure of Social Networks using (\alpha, \beta)-Communities (1)
The Future of Computer Science (1)
Computer Science the Past and the Future (1)
Neighbourhood-preserving dimension reduction via localised multidimensional scaling (1)
Frontiers of Algorithmics (1)
On the Impact of Turing Machines (1)
Reviews of Books and Papers in the Computer Field (1)
The Promise of Electronic Prototyping (0)
Lecture 16: Small World Graphs (0)
Adaptive Wavelet Clustering for High Noise Data (0)
Fast Parallel Matrix and GCD Computations (0)
New Research Directions in the Information Age (0)
Benchmark Prog. Size (0)
Binary encoding of analog signals for noisy channels (0)
TO STUDIES AMONG THE SEDENTARY INDIANS OF NEW MEXICO REPORT ON THE RUINS OF THE PUEBLO (0)
PRE-AFL (ABSTRACT FAMILY OF LANGUAGES). (0)
Proceedings of the 3d International Workshop on Frontiers in Algorithmics (0)
On the structure of communities in networks (0)
Learning using spectral methods (0)
Phase transitions and other phenomena in graphs grown with preferential attachment (0)
Algorithmic Problems in Modeling and Electronic Prototyping (0)
Elementary complexity theory November 17 , 2018 1 Languages , automata (0)
The structure and dynamics of large social networks (0)
Computer Science in the Information Age (0)
Refinement of Hierarchies of Time Bounded Computations (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 (0)
7 Conclusions, Open Questions and Further Research (0)
Problem 1 Is It True That for for K 2 Ldtc(k; 1) (0)
Hybrid Network Learning (0)
The mathematical work of Jon Kleinberg (0)
LOWER BOUNDS FOR GEOMETRICAL AND PHYSICALPROBLEMSJ URGEN SELLEN (0)
Using Computer Design and Simulation to Improve Manufacturing Productivity. Report Period 1, 2 & 3 (0)
A Conversation with John E. Hopcroft (0)
Elementary complexity theory (0)
0.1. Minimizing Finite State Machines 1 0.1 Minimizing Finite State Machines (0)
A Comment on "Improving a Nonenumerative Method to Estimate Path Delay Fault Coverage" (0)
Formal languages II (0)
Deep Neural Networks and the Tree of Life (0)
The work of Jon Kleinberg (0)
Integrating Circle Kernels into Convolutional Neural Networks (0)
Patent Number : 45 ) Date of Patent : 5 , 123 , 045 Jun . 16 , 1992 54 : COMPREHENSIVE SOFTWARE (0)
Reflections on Computer Science (0)
Audio System for Technical Readings All Rights Reserved Audio System for Technical Readings Biographical Sketch List of Tables List of Figures (0)
Savage Enhanced with Recognition and Reporting of Hierarchical Structure of Errors INSIDE (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)
ProHiCo: A Probabilistic Framework to Hide Communities in Large Networks (0)
Week 14 : Wednesday , Nov 25 A regression puzzle (0)
Uncovering the Local Hidden Community Structure in Social Networks (0)
Parallel Algorithms for Shared-memory Machines. a Standard Wasteful Implementation (0)
A Program of Continuing Research on Representing, Manipulating, and Reasoning about Physical Objects (0)
Hierarchical Hidden Community Detection for Protein Complex Prediction (0)
Finding (Short) Paths in Social Networks (0)
Lower Bounds for Constant Depth Circuits for Preex Problems, in Proc. of 10th International 5. Conclusion and Open Problems (0)
Structure Amplification on Multi-layer Stochastic Block Models (0)
Integrating Large Circular Kernels into CNNs through Neural Architecture Search (0)
Algorithms for Massive Data Problems: Streaming, Sketching, and Sampling (0)
Robotics: A Long Range Plan to Maximize National Capabilities (0)
Frontiers in Algorithmics, Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009. Proceedings (0)
Stochastic Variance Reduced Ensemble Adversarial Attack for Boosting the Adversarial Transferability (0)
A recognition algorithm for pushdown store systems (0)
Examining behavioral effects of player sex in two large-scale MMOs (0)
Name Fundamental Mechanism References (0)
Inference Rules (0)
R70-2 Nested Stack Automata (0)
Randomness in Deconvolutional Networks for Visual Representation (0)
Nonlinear Dimension Reduction by Local Multidimensional Scaling (0)
CS 381 Instructor : Professor (0)
Future Directions in Computer Science Research (0)
Annual Cumulative Subject Index (0)
TheMathematicalWork of Jon Kleinberg (0)
Representation, manipulation, and reasoning about physical objects (0)
Jv J Jej) Algorithm for Finding Maxi- Perfect Matching under Translation 7 Perfect Matching under Translation (0)
The Natural Communities Algorithm for Tracking the Evolution of Large Networks (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 AcademicInfluence.com Rankings

Computer Science