Michael E. O’Sullivan

910 total citations
35 papers, 401 citations indexed

About

Michael E. O’Sullivan is a scholar working on Artificial Intelligence, Electrical and Electronic Engineering and Computer Networks and Communications. According to data from OpenAlex, Michael E. O’Sullivan has authored 35 papers receiving a total of 401 indexed citations (citations by other indexed papers that have themselves been cited), including 26 papers in Artificial Intelligence, 20 papers in Electrical and Electronic Engineering and 11 papers in Computer Networks and Communications. Recurrent topics in Michael E. O’Sullivan's work include Coding theory and cryptography (25 papers), graph theory and CDMA systems (12 papers) and Cryptographic Implementations and Security (10 papers). Michael E. O’Sullivan is often cited by papers focused on Coding theory and cryptography (25 papers), graph theory and CDMA systems (12 papers) and Cryptographic Implementations and Security (10 papers). Michael E. O’Sullivan collaborates with scholars based in United States, Spain and Ireland. Michael E. O’Sullivan's co-authors include Kwankyu Lee, Maria Bras-Amorós, Marcus Greferath, Eimear Byrne, Daniel Lee, Mark Spivack, Xinmiao Zhang, Naneh Apkarian, Fernando Hernando and Janet Bowers and has published in prestigious journals such as IEEE Transactions on Information Theory, Discrete Mathematics and Symmetry.

In The Last Decade

Michael E. O’Sullivan

34 papers receiving 379 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Michael E. O’Sullivan United States 11 277 238 148 108 38 35 401
G.L. Feng United States 9 484 1.7× 316 1.3× 128 0.9× 154 1.4× 105 2.8× 16 524
Shudi Yang China 12 321 1.2× 213 0.9× 143 1.0× 52 0.5× 24 0.6× 28 358
Iwan Duursma United States 13 368 1.3× 178 0.7× 171 1.2× 99 0.9× 32 0.8× 44 450
Nicolas Sendrier France 13 618 2.2× 300 1.3× 224 1.5× 152 1.4× 49 1.3× 29 659
S.M. Dodunekov Bulgaria 11 432 1.6× 324 1.4× 210 1.4× 103 1.0× 16 0.4× 41 473
Maosheng Xiong Hong Kong 14 467 1.7× 298 1.3× 83 0.6× 141 1.3× 15 0.4× 56 551
Thierry Pierre Berger France 12 371 1.3× 229 1.0× 101 0.7× 88 0.8× 11 0.3× 30 401
Gaojun Luo China 12 403 1.5× 172 0.7× 153 1.0× 174 1.6× 8 0.2× 59 432
Ana Sălăgean United Kingdom 9 440 1.6× 308 1.3× 72 0.5× 174 1.6× 19 0.5× 35 487
Rongquan Feng China 11 184 0.7× 141 0.6× 90 0.6× 85 0.8× 54 1.4× 66 353

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-authorship network of co-authors of Michael E. O’Sullivan

This figure shows the co-authorship network connecting the top 25 collaborators of Michael E. O’Sullivan. A scholar is included among the top collaborators of Michael E. O’Sullivan 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 Michael E. O’Sullivan. Michael E. O’Sullivan is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Bras-Amorós, Maria & Michael E. O’Sullivan. (2019). The Symmetric Key Equation for Reed–Solomon Codes and a New Perspective on the Berlekamp–Massey Algorithm. Symmetry. 11(11). 1357–1357. 2 indexed citations
2.
Apkarian, Naneh, Janet Bowers, Michael E. O’Sullivan, & Chris Rasmussen. (2018). A Case Study of Change in the Teaching and Learning of Precalculus to Calculus 2: What We are Doing With What We Have. PRIMUS. 28(6). 528–549. 9 indexed citations
3.
O’Sullivan, Michael E., et al.. (2017). The Hamiltonian problem and t-path traceable graphs. Involve a Journal of Mathematics. 10(5). 801–812. 1 indexed citations
4.
Lee, Kwankyu, Maria Bras-Amorós, & Michael E. O’Sullivan. (2012). Unique Decoding of Plane AG Codes via Interpolation. IEEE Transactions on Information Theory. 58(6). 3941–3950. 8 indexed citations
5.
Lee, Kwankyu & Michael E. O’Sullivan. (2008). List decoding of Hermitian codes using Gröbner bases. Journal of Symbolic Computation. 44(12). 1662–1675. 24 indexed citations
6.
Lee, Kwankyu & Michael E. O’Sullivan. (2008). List decoding of Reed–Solomon codes from a Gröbner basis perspective. Journal of Symbolic Computation. 43(9). 645–658. 38 indexed citations
7.
Byrne, Eimear, Marcus Greferath, & Michael E. O’Sullivan. (2007). The linear programming bound for codes over finite Frobenius rings. Designs Codes and Cryptography. 42(3). 13 indexed citations
8.
Bras-Amorós, Maria & Michael E. O’Sullivan. (2007). On Semigroups Generated by Two Consecutive Integers and Improved Hermitian Codes. IEEE Transactions on Information Theory. 53(7). 2560–2566. 5 indexed citations
9.
Bras-Amorós, Maria & Michael E. O’Sullivan. (2007). The Order Bound on the Minimum Distance of the One-Point Codes Associated to the Garcia–Stichtenoth Tower. IEEE Transactions on Information Theory. 53(11). 4241–4245. 2 indexed citations
10.
Bras-Amorós, Maria & Michael E. O’Sullivan. (2006). The Correction Capability of the Berlekamp–Massey–Sakata Algorithm with Majority Voting. Applicable Algebra in Engineering Communication and Computing. 17(5). 315–335. 11 indexed citations
11.
Greferath, Marcus, Gary McGuire, & Michael E. O’Sullivan. (2006). ON PLOTKIN-OPTIMAL CODES OVER FINITE FROBENIUS RINGS. Journal of Algebra and Its Applications. 5(6). 799–815. 7 indexed citations
12.
Byrne, Andrew W., Emanuel Popovici, & Michael E. O’Sullivan. (2006). Versatile architectures for decoding a class of LDPC codes. 3. 269–272. 1 indexed citations
13.
Greferath, Marcus & Michael E. O’Sullivan. (2004). On bounds for codes over Frobenius rings under homogeneous weights. Discrete Mathematics. 289(1-3). 11–24. 16 indexed citations
14.
O’Sullivan, Michael E.. (2004). On Koetter's Algorithm and the Computation of Error Values. Designs Codes and Cryptography. 31(2). 169–188. 3 indexed citations
15.
O’Sullivan, Michael E. & Roxana Smarandache. (2003). High-rate, short length, (3,3s)-regular LDPC of girth 6 and 8. 59–59. 3 indexed citations
16.
O’Sullivan, Michael E.. (2002). The key equation for one-point codes and efficient error evaluation. Journal of Pure and Applied Algebra. 169(2-3). 295–320. 4 indexed citations
17.
18.
O’Sullivan, Michael E.. (2002). Decoding Hermitian codes beyond (d/sub min/-1)/2. 384–384. 4 indexed citations
19.
O’Sullivan, Michael E.. (2001). New Codes for the Berlekamp–Massey–Sakata Algorithm. Finite Fields and Their Applications. 7(2). 293–317. 13 indexed citations
20.
O’Sullivan, Michael E.. (2000). Decoding of Hermitian codes: the key equation and efficient error evaluation. IEEE Transactions on Information Theory. 46(2). 512–523. 7 indexed citations

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

Breakdown of academic impact, for papers by G.L. Feng Breakdown of academic impact, for papers by Shudi Yang Breakdown of academic impact, for papers by Iwan Duursma Breakdown of academic impact, for papers by Nicolas Sendrier Breakdown of academic impact, for papers by S.M. Dodunekov Breakdown of academic impact, for papers by Maosheng Xiong Breakdown of academic impact, for papers by Thierry Pierre Berger Breakdown of academic impact, for papers by Gaojun Luo Breakdown of academic impact, for papers by Ana Sălăgean Breakdown of academic impact, for papers by Rongquan Feng
Rankless by CCL
2026