2026 John E. Hopcroft: Mathematics Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	82	923	892	501	482	247	75297
Mathematics	73	225	192	126	102	186	69423

Research.com Recognitions

2010 - IEEE John von Neumann Medal “For laying the foundations for the fields of automata and language theory and many seminal contributions to theoretical computer science.”
2009 - SIAM Fellow For advances in the design and analysis of algorithms.
2009 - Member of the National Academy of Sciences
2008 - ACM Karl V. Karlstrom Outstanding Educator Award For his vision of and impact on computer science, including co- authoring field-defining texts on theory and algorithms, which continue to influence students 40 years later, advising PhD students who themselves are now contributing greatly to computer science, and providing influential leadership in computer science research and education at the national and international level.
1994 - ACM Fellow For fundamental achievements in the design and analysis of algorithms and data structures.
1989 - Member of the National Academy of Engineering For fundamental contributions to computer algorithms and for authorship of outstanding computer science textbooks.
1987 - Fellow of the American Academy of Arts and Sciences
1987 - Fellow of the American Association for the Advancement of Science (AAAS)
1987 - IEEE Fellow For contributions to the field of computing.
1986 - A. M. Turing Award For fundamental achievements in the design and analysis of algorithms and data structures.
Foreign Member, Chinese Academy of Sciences
Foreign Member, Chinese Academy of Sciences
Foreign Member, Chinese Academy of Sciences
Foreign Member, Chinese Academy of Sciences
Foreign Member, Chinese Academy of Sciences
Foreign Member, Chinese Academy of Sciences

Overview

John E. Hopcroft is affiliated with Cornell University in the United States and has a research portfolio covering various aspects of computer science and physics. Their work spans 69 publications in computer science and 16 in physics and astronomy, with a particular focus on artificial intelligence, computer vision and pattern recognition, statistical and nonlinear physics, transportation, and computational theory and mathematics.

Hopcroft's notable topics of work include:

Complex Network Analysis Techniques
Machine Learning and Algorithms
Human Mobility and Location-Based Analysis
Algorithms and Data Compression
Anomaly Detection Techniques and Applications
Advanced Neural Network Applications
Advanced Clustering Algorithms Research

Frequent co-authors in Hopcroft's collaborations include Avrim Blum, Ravindran Kannan, Kun He, and Meng Wang.

Hopcroft has contributed extensively to various publication venues. The most frequent of these are:

arXiv (Cornell University)
ACM Transactions on Knowledge Discovery from Data
2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)
Knowledge-Based Systems
IEEE Transactions on Information Forensics and Security

Representative recent papers authored or co-authored by Hopcroft include:

"Stochastic Variance Reduced Ensemble Adversarial Attack for Boosting the Adversarial Transferability," 2022, 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)
"HoSIM: Higher-order Structural Importance based method for multiple local community detection," 2022, Knowledge-Based Systems
"Stochastic Variance Reduced Ensemble Adversarial Attack for Boosting the Adversarial Transferability," 2021, arXiv (Cornell University)
"Why Robust Generalization in Deep Learning is Difficult: Perspective of Expressive Power," 2022, arXiv (Cornell University)
"Integrating Large Circular Kernels into CNNs through Neural Architecture Search," 2021, arXiv (Cornell University)

Hopcroft has also authored the book Foundations of Data Science, published by Cambridge University Press in 2020, which has been cited extensively.

The scientist has received multiple honors and awards throughout their career, including:

IEEE John von Neumann Medal (2010) for contributions to automata and language theory and theoretical computer science
SIAM Fellow (2009) for advances in algorithm design and analysis
Member of the National Academy of Sciences (2009)
ACM Karl V. Karlstrom Outstanding Educator Award (2008) for impact on computer science education and research leadership
ACM Fellow (1994) for achievements in algorithms and data structures
Member of the National Academy of Engineering (1989) for contributions to computer algorithms and textbooks
IEEE Fellow (1987) for contributions to computing
Fellow of the American Association for the Advancement of Science (1987)
Fellow of the American Academy of Arts and Sciences (1987)
A. M. Turing Award (1986) for achievements in algorithm and data structure design and analysis
Foreign Member of the Chinese Academy of Sciences

Best Publications

Introduction to Automata Theory, Languages, and Computation

John E. Hopcroft;Rajeev Motwani;Rotwani;Jeffrey D. Ullman

21902
Citations
The Design and Analysis of Computer Algorithms

Alfred V. Aho;John E. Hopcroft

14813
Citations
Data Structures and Algorithms

Alfred V. Aho;John E. Hopcroft;Jeffrey Ullman

4834
Citations
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

John E. Hopcroft;Richard M. Karp

4257
Citations
Formal Languages and Their Relation to Automata

John E. Hopcroft;Jeffrey D. Ullman

2540
Citations
Efficient Planarity Testing

John Hopcroft;Robert Tarjan

1734
Citations
Algorithm 447: efficient algorithms for graph manipulation

John Hopcroft;Robert Tarjan

1476
Citations
Introduction To Automata Theory, Languages And Computation, 3Rd Edition

John E. Hopcroft;Rajeev Motwani;Jeffrey D. Ullman

1406
Citations
An n log n algorithm for minimizing states in a finite automaton

John E. Hopcroft

1379
Citations
Dividing a Graph into Triconnected Components

John E. Hopcroft;Robert Endre Tarjan

1150
Citations
The Directed Subgraph Homeomorphism Problem

Steven Fortune;John E. Hopcroft;James C. Wyllie

960
Citations
Routing, merging, and sorting on parallel models of computation

A. Borodin;J. E. Hopcroft

816
Citations
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)

J. E. Hopcroft;J. K. Wong

700
Citations
Snapshot Ensembles: Train 1, Get M for Free

Gao Huang;Yixuan Li;Geoff Pleiss;Zhuang Liu

669
Citations
On the Complexity of Motion Planning for Multiple Independent Objects; Pspace Hardness of the Warehouseman's Problem

J.E. Hopcroft;J.T. Schwartz;M. Sharir

600
Citations
Are Randomly Grown Graphs Really Random

D. S. Callaway;J. E. Hopcroft;J. M. Kleinberg;M. E. J. Newman

586
Citations
Stacked Generative Adversarial Networks

Xun Huang;Yixuan Li;Omid Poursaeed;John Hopcroft

462
Citations
Tracking evolving communities in large linked networks

John Hopcroft;Omar Khan;Brian Kulis;Bart Selman

454
Citations
Triangular Factorization and Inversion by Fast Matrix Multiplication

James R. Bunch;John E. Hopcroft

445
Citations
Tracing surface intersections

C. L. Bajaj;C. M. Hoffman;R. E. Lynch;J. E. H. Hopcroft

394
Citations

Frequent Co-Authors

Jeffrey D. Ullman Stanford University

Robert E. Tarjan Princeton University

Christoph M. Hoffmann Purdue University West Lafayette

Alfred V. Aho Columbia University

Allan Borodin University of Toronto

Juris Hartmanis Cornell University

Liwei Wang Peking University

Ravi Kannan Microsoft (United States)

Richard M. Karp University of California, Berkeley

Sue Whitesides University of Victoria

External Links

Wikipedia of John E. Hopcroft Personal website of John E. Hopcroft Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

For students interested in expanding their expertise beyond Mathematics, pursuing related online degrees can open diverse career opportunities. For those inclined toward business leadership, the shortest online MBA programs offer a fast and flexible pathway to develop management skills without interrupting your current commitments.

Finance professionals with a strong quantitative background often benefit from earning a master of finance online. This degree enhances financial modeling and analytical skills, complementing mathematical proficiency with practical applications in the financial sector.

For those aiming for executive-level roles in business strategy, the cheapest DBA online programs provide an affordable route to doctorate-level education focused on advanced leadership and research skills.

Marketing professionals with a penchant for data-driven decision making can explore a master's degree in marketing online. This program combines creativity with analytics, aligning well with a mathematical mindset and opening doors to high-earning careers in digital marketing and market research.