2026 Mike Paterson: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	50	5475	5321	328	324	173	20465

Research.com Recognitions

2001 - Fellow of the Royal Society, United Kingdom
1991 - Member of Academia Europaea

Overview

Mike Paterson is affiliated with the University of Warwick in the United Kingdom. Their research spans multiple disciplines, including Computer Science, Mathematics, and Physics and Astronomy, reflecting a diverse academic scope.

The scientist's main fields of study include:

Computer Science
Mathematics
Physics and Astronomy

Within these broader fields, Mike Paterson focuses on specific subfields such as:

Computational Theory and Mathematics
Discrete Mathematics and Combinatorics
Statistical and Nonlinear Physics
Atomic and Molecular Physics, and Optics
Electrical and Electronic Engineering

The primary topics tackled in their work include:

Computability, Logic, AI Algorithms
Limits and Structures in Graph Theory
Advanced Combinatorial Mathematics
Graph theory and CDMA systems
Opinion Dynamics and Social Influence
Complex Network Analysis Techniques
Quantum many-body systems

Recent notable publications by Mike Paterson include:

"Convergence of Opinion Diffusion is PSPACE-Complete," 2020, Proceedings of the AAAI Conference on Artificial Intelligence
"Globe-hopping," 2020, Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences
"More about Exact Slow $k$-Nim," 2021, arXiv (Cornell University)
"Combinatorial Communication in the Locker Room," 2020, arXiv (Cornell University)
"Haystack hunting hints and locker room communication," 2022, Random Structures and Algorithms

Mike Paterson frequently collaborates with several researchers, including:

Dmitry Chistikov
Artur Czumaj
George Kontogeorgiou
Grzegorz Lisowski
Paolo Turrini

The majority of Paterson's publications appear in respected venues such as:

arXiv (Cornell University)
Proceedings of the AAAI Conference on Artificial Intelligence
Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences
Random Structures and Algorithms
American Mathematical Monthly

Mike Paterson has received recognition for their work including:

Fellow of the Royal Society, United Kingdom, 2001
Member of Academia Europaea, 1991

Best Publications

Impossibility of distributed consensus with one faulty process

Michael J. Fischer;Nancy A. Lynch;Michael S. Paterson

6600
Citations
Word processing in groups

David B. A. Epstein;M. S. Paterson;J. W. Cannon;D. F. Holt

1732
Citations
Optimal packing and covering in the plane are NP-complete☆

Robert J. Fowler;Michael S. Paterson;Steven L. Tanimoto

932
Citations
A faster algorithm computing string edit distances

William J. Masek;Michael S. Paterson

926
Citations
Linear unification

M. S. Paterson;M. N. Wegman

813
Citations
Selection and sorting with limited storage

J.I. Munro;M.S. Paterson

677
Citations
The complexity of mean payoff games on graphs

Uri Zwick;Mike Paterson

657
Citations
STRING-MATCHING AND OTHER PRODUCTS

M. J. Fischer;M. S. Paterson

634
Citations
A Deterministic Subexponential Algorithm for Solving Parity Games

Marcin Jurdziński;Mike Paterson;Uri Zwick

474
Citations
On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials

Michael S. Paterson;Larry J. Stockmeyer

382
Citations
Comparative schematology

Michael S. Paterson;Carl E. Hewitt

331
Citations
On formalised computer programs

D. C. Luckham;D. M. R. Park;M. S. Paterson

330
Citations
Efficient binary space partitions for hidden-surface removal and solid modeling

Michael S. Paterson;F. Frances Yao

287
Citations
On Nearest-Neighbor Graphs

D. Eppstein;M. S. Paterson;F. F. Yao

280
Citations
On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)

Richa Agarwala;Vineet Bafna;Martin Farach;Mike Paterson

251
Citations
On the approximability of numerical taxonomy (fitting distances by tree metrics)

Richa Agarwala;Vineet Bafna;Martin Farach;Babu Narayanan

223
Citations
Improved Sorting Networks with O(log n) Depth

M. S. Paterson

206
Citations
Longest Common Subsequences

Mike Paterson;Vlado Dancík

194
Citations
Finding the Median

A. Schonhage;M. S. Paterson;N. Pippenger

189
Citations
Proceedings of the 17th International Colloquium on Automata, Languages and Programming

Mike Paterson

50
Citations
On Nearest-Neighbor Graphs

Mike Paterson;F. Frances Yao

34
Citations

Frequent Co-Authors

Leslie Ann Goldberg University of Oxford

Michael J. Fischer Yale University

Uri Zwick Tel Aviv University

Haris Aziz University of New South Wales

Frances F. Yao City University of Hong Kong

Martin Dyer University of Leeds

Mikkel Thorup University of Copenhagen

Albert R. Meyer MIT

Kazuo Iwama Kyoto University

Subbaratnam Muthukrishnan Kansas State University

External Links

Wikipedia of Mike Paterson Personal website of Mike Paterson Google Scholar page

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

Related Online Degrees & Career Pathways

Expanding your skill set in computer science can open doors to various dynamic career fields. With the flexibility of online education, it’s easier than ever to advance your studies or shift your career focus without pausing your current job or relocating.

Data-driven careers continue to be in high demand. If you are interested in roles like data analyst or data scientist, pursuing one of the best data science masters can provide you with advanced technical and analytical skills.

Tech skills are also essential in fields like construction and project management. An online construction management bachelor degree can help you blend technology with management, preparing you for supervisory roles in this growing sector.

For those looking to move into leadership positions, earning an online MBA is a strong option. There are plenty of cheapest mba online programs that deliver high-quality business education at an affordable cost.

If you prefer a fast-tracked approach, you might consider the best one year masters programs online, letting you earn a graduate credential quickly and efficiently.