Mike Paterson
- Artificial Intelligence top 1%
- Geophysics top 2%
- Computational Theory and Mathematics top 0.5%
- Mechanics of Materials top 2%
- Computer Networks and Communications top 2%
- Co-authors
- C. B. RaleighJ. Ian MunroManuela FischerLionel WeissMark N. WegmanLeslie Ann GoldbergFei YaoUri Zwick
- Topics
- Complexity and Algorithms in Graphs (14 papers)Algorithms and Data Compression (12 papers)semigroups and automata theory (11 papers)
- Partner nations
- United KingdomUnited StatesAustralia
In The Last Decade
Mike Paterson
97 papers receiving 3.7k citations
Hit Papers
Peers
Comparison fields: 5 of 137
- Artificial Intelligence 1.3k
- Geophysics 1.2k
- Computational Theory and Mathematics 1.1k
- Mechanics of Materials 691
- Computer Networks and Communications 541
Countries citing papers authored by Mike Paterson
This map shows the geographic impact of Mike Paterson's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Mike Paterson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mike Paterson more than expected).
Fields of papers citing papers by Mike Paterson
This network shows the impact of papers produced by Mike Paterson. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Mike Paterson. The network helps show where Mike Paterson may publish in the future.
Co-authorship network of co-authors of Mike Paterson
This figure shows the co-authorship network connecting the top 25 collaborators of Mike Paterson. A scholar is included among the top collaborators of Mike Paterson based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Mike Paterson. Mike Paterson is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 4 | |
| 2 | 2 | |
| 3 | Combinatorial and computational aspects of multiple weighted voting games | 3 |
| 4 | 44 | |
| 5 | 6 | |
| 6 | 78 | |
| 7 | Layout of the Batcher bitonic sorter | 7 |
| 8 | On permutation communications in all-optical rings. | 2 |
| 9 | 58 | |
| 10 | 28 | |
| 11 | 3 | |
| 12 | Proceedings of the 17th International Colloquium on Automata, Languages and Programming | 176 |
| 13 | 6 | |
| 14 | 203 | |
| 15 | 136 | |
| 16 | An Introduction to Boolean Function Complexity. | 6 |
| 17 | 14 | |
| 18 | 115 | |
| 19 | 130 | |
| 20 | The melting of calcite in the presence of water and carbon dioxide | 15 |
About Mike Paterson
Mike Paterson is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Artificial Intelligence, having authored 102 papers that have together received 4.2k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (14 papers), Algorithms and Data Compression (12 papers) and semigroups and automata theory (11 papers). The work is most often cited by research in Geophysics (1.2k citations), Computational Theory and Mathematics (1.1k citations) and Artificial Intelligence (1.3k citations). Mike Paterson has collaborated with scholars based in United Kingdom, United States and Australia. Frequent co-authors include C. B. Raleigh, J. Ian Munro, Manuela Fischer, Lionel Weiss, Mark N. Wegman, Leslie Ann Goldberg, Fei Yao, Uri Zwick, David Eppstein and D Luckham. Their work appears in journals such as Nature, Journal of Geophysical Research Atmospheres and Journal of Applied Physics.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.