World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
38
Citations
7227
World Ranking
10128
National Ranking
35

Thomas J. Naughton publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Thomas J. Naughton sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 207 publications — 49th percentile

49% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Thomas J. Naughton D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Thomas J. Naughton sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 38 D-Index — 30th percentile

30% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

Overview

Thomas J. Naughton is affiliated with the National University of Ireland, Maynooth in Ireland. Their primary field of study is Computer Science, with a focus on several subfields including Computer Networks and Communications, Information Systems and Management, Artificial Intelligence, Information Systems, and Hardware and Architecture.

The main topics covered in their research encompass Distributed and Parallel Computing Systems, Scientific Computing and Data Management, Cloud Computing and Resource Management, Advanced Data Storage Technologies, Parallel Computing and Optimization Techniques, Distributed Systems and Fault Tolerance, and Quantum Computing Algorithms and Architecture.

Frequent publication venues for their work include arXiv (Cornell University), Light Advanced Manufacturing, Future Generation Computer Systems, The International Journal of High Performance Computing Applications, and the 2022 IEEE International Systems Conference (SysCon).

Notable recent papers authored or co-authored by Thomas J. Naughton are:

  • Compression strategies for digital holograms in biomedical and multimedia applications, 2022, Light Advanced Manufacturing
  • Bridging paradigms: Designing for HPC-Quantum convergence, 2025, Future Generation Computer Systems
  • Taking the MPI standard and the open MPI library to exascale, 2024, The International Journal of High Performance Computing Applications
  • VFSIE -- Development and Testing Framework for Federated Science Instruments, 2021, arXiv (Cornell University)
  • Emulation Framework for Distributed Large-Scale Systems Integration, 2022, 2022 IEEE International Systems Conference (SysCon)

Thomas J. Naughton's work is often conducted in collaboration with frequent co-authors including Wael Elwasif, Amir Shehata, Seth Hitefield, Nageswara S. V. Rao, and Swen Boehm.

Best Publications

  • Assessment of methods for amino acid matrix selection and their use on empirical data shows that ad hoc assumptions for choice of matrix are not justified

    Thomas M Keane;Christopher J Creevey;Melissa M Pentony;Thomas J Naughton

  • Resistance of the double random phase encryption against various attacks

    Yann Frauel;Albertina Castro;Thomas J Naughton;Bahram Javidi

  • Compression of digital holograms for three-dimensional object reconstruction and recognition

    Thomas J. Naughton;Yann Frauel;Bahram Javidi;Enrique Tajahuerce

  • Real-time three-dimensional object reconstruction by use of a phase-encoded digital hologram.

    Osamu Matoba;Thomas J. Naughton;Yann Frauel;Nicolas Bertaux

  • Individualized leadership: A new multiple-level approach

    Fred Dansereau;Francis J. Yammarino;Steven E. Markham;Joseph A. Alutto

  • A known-plaintext heuristic attack on the Fourier plane encryption algorithm.

    Unnikrishnan Gopinathan;David S. Monaghan;Thomas J. Naughton;John T. Sheridan

  • Three-Dimensional Imaging and Processing Using Computational Holographic Imaging

    Y. Frauel;T.J. Naughton;O. Matoba;E. Tajahuerce

  • Dynamic task scheduling using genetic algorithms for heterogeneous distributed computing

    A.J. Page;T.J. Naughton

  • Optical computing: Photonic neural networks

    Damien Woods;Thomas J. Naughton

  • Reduction of speckle in digital holography by discrete Fourier filtering.

    Jonathan Maycock;Bryan M. Hennelly;John B. McDonald;Yann Frauel

  • Her2 challenge contest: a detailed assessment of automated her2 scoring algorithms in whole slide images of breast cancer tissues

    Talha Qaiser;Abhik Mukherjee;Chaitanya Reddy Pb;Sai Dileep Munugoti

  • Efficient compression of Fresnel fields for internet transmission of three-dimensional images

    Thomas J. Naughton;John B. McDonald;Bahram Javidi

  • Resolution limits in practical digital holographic systems

    Damien P. Kelly;Bryan M. Hennelly;Nitesh Pandey;Thomas J. Naughton

  • Compression of encrypted three-dimensional objects using digital holography

    Thomas J. Naughton;Bahram Javidi

  • Multi-heuristic dynamic task allocation using genetic algorithms in a heterogeneous distributed system

    Andrew J. Page;Thomas M. Keane;Thomas J. Naughton

  • Synthesis and display of dynamic holographic 3D scenes with real-world objects

    Melania Paturzo;Pasquale Memmolo;Andrea Finizio;Risto Näsänen

  • Framework for Task Scheduling in Heterogeneous Distributed Computing Using Genetic Algorithms

    Andrew J. Page;Thomas J. Naughton

  • Key-space analysis of double random phase encryption technique.

    David S. Monaghan;Unnikrishnan Gopinathan;Thomas J. Naughton;John T. Sheridan

  • Focus prediction in digital holographic microscopy using deep convolutional neural networks.

    Tomi Pitkäaho;Aki Manninen;Thomas J Naughton

  • Compression of digital holograms of three-dimensional objects using wavelets.

    Alison E. Shortt;Thomas J. Naughton;Bahram Javidi

  • Microparticle characterization using digital holography

    Emmanouil Darakis;Emmanouil Darakis;Taslima Khanam;Arvind Rajendran;Vinay Kariwala

Frequent Co-Authors

Bahram Javidi
Bahram Javidi University of Connecticut
Thomas M. Keane
Thomas M. Keane European Bioinformatics Institute
James O. McInerney
James O. McInerney University of Nottingham
Anand Asundi
Anand Asundi d'Optron Pte
Osamu Matoba
Osamu Matoba Kobe University
Arvind Rajendran
Arvind Rajendran University of Alberta
Guohai Situ
Guohai Situ Chinese Academy of Sciences
Nasir M. Rajpoot
Nasir M. Rajpoot University of Warwick
Lajos Hanzo
Lajos Hanzo University of Southampton
Pasquale Memmolo
Pasquale Memmolo National Research Council (CNR)

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

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online degrees can open up diverse career pathways for students of Computer Science in the USA. Many learners are seeking flexible and affordable education options that allow for quick entry or advancement into the tech workforce.

If you're interested in combining business acumen with your technical skills, consider the cheapest online mba programs. These options provide a cost-effective way to gain management expertise alongside a tech background.

For those looking to earn a graduate credential quickly, one year graduate programs offer intensive, focused learning experiences. Alternatively, if speed to job readiness is your priority, explore the fastest degree to get online to accelerate your career progression.

With artificial intelligence in high demand, choosing from the best online ai degree programs can pave the way for exciting roles in AI, machine learning, and data science.

Each of these tailored online pathways allows students to customize their educational journey while balancing work and personal commitments.

Best Scientists Citing Thomas J. Naughton

Trending Scientists

Recently Published Articles