Michael E. O’Sullivan

927 citations
40 papers · 454 · h-index 12

Impact in

Papers in

Michael E. O’Sullivan

38 papers receiving 426 citations

Peers

Michael E. O’Sullivan
Comparison fields: 5 of 40
  • Discrete Mathematics and Combinatorics 34
  • Artificial Intelligence 328
  • Computational Theory and Mathematics 136
  • Computer Networks and Communications 162
  • Electrical and Electronic Engineering 268
Replace Satyanarayana V. Lokam with:
Satyanarayana V. Lokam United States
Dingyi Pei China
Shudi Yang China
G.L. Feng United States
Xiaoni Du China
M. Alekhnovich United States
Daniel Augot France
Thierry Pierre Berger France
Willi Geiselmann Germany
Juriaan Simonis Netherlands
Michael E. O’Sullivan relative to Satyanarayana V. Lokam United States Satyanarayana V. Lokam's profile →
Citations per field
00.5×2.5×
Satyanarayana V. Lokam · 1×
Citations per year

Countries citing papers authored by Michael E. O’Sullivan

Since Specialization
Citations

This map shows the geographic impact of Michael E. O’Sullivan'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 Michael E. O’Sullivan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael E. O’Sullivan more than expected).

Fields of papers citing papers by Michael E. O’Sullivan

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Michael E. O’Sullivan. 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 Michael E. O’Sullivan. The network helps show where Michael E. O’Sullivan may publish in the future.

Co-authors

The 25 scholars most cited alongside Michael E. O’Sullivan, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Michael E. O’Sullivan Line = papers co-authored together Michael E. O’Sullivan links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 40 papers — load more, or switch the sort, to bring in the rest.

#Work
1 200675
2 200842
3 200634
4 199532
5 201028
6 200825
7 200121
8 200419
9 200617
10 200715
11 200815
12 200813
13 20129
14 20149
15 20009
16 20189
17 20128
18 20148
19 20067
20 20026

About Michael E. O’Sullivan

Michael E. O’Sullivan is a scholar working on Artificial Intelligence, Electrical and Electronic Engineering, Computer Networks and Communications, Computational Theory and Mathematics and Discrete Mathematics and Combinatorics, having authored 40 papers that have together received 454 indexed citations. Recurring topics across this work include Coding theory and cryptography (29 papers), graph theory and CDMA systems (15 papers), Error Correcting Code Techniques (12 papers), Cryptographic Implementations and Security (10 papers), Advanced Wireless Communication Techniques (7 papers), Cooperative Communication and Network Coding (5 papers), Finite Group Theory Research (4 papers) and Polynomial and algebraic computation (4 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (34 citations), Artificial Intelligence (328 citations), Computational Theory and Mathematics (136 citations), Computer Networks and Communications (162 citations) and Electrical and Electronic Engineering (268 citations). Michael E. O’Sullivan has collaborated with scholars based in United States, Spain and Ireland. Frequent co-authors include Kwankyu Lee, Maria Bras-Amorós, Marcus Greferath, Eimear Byrne, Daniel Lee, Mark Spivack, Naneh Apkarian, Xinmiao Zhang, Fernando Hernando and Kyle Marshall. Their work appears in journals such as IEEE Transactions on Information Theory, Designs Codes and Cryptography, Finite Fields and Their Applications, Discrete Mathematics and Journal of Pure and Applied Algebra.

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.

Explore authors with similar magnitude of impact