World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
53
Citations
9935
World Ranking
4876
National Ranking
292

Paul G. Spirakis 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 Paul G. Spirakis 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: 568 publications — 95th percentile

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

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

Paul G. Spirakis 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 Paul G. Spirakis 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: 53 D-Index — 67th percentile

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

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

Research.com Recognitions

  • 2014 - European Association for Theoretical Computer Science (EATCS) Fellow For seminal papers on Random Graphs and Population Protocols, Algorithmic Game Theory, as well as Robust Parallel Distributed Computing
  • 2010 - Member of Academia Europaea

Overview

Paul G. Spirakis is affiliated with the University of Liverpool in the United Kingdom and has contributed extensively to the field of Computer Science. Their research spans a variety of subfields and specialized topics within this domain.

The primary areas of study in their work include:

  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Artificial Intelligence
  • Management Science and Operations Research
  • Statistics and Probability

Their research focuses on topics such as:

  • Advanced Graph Theory Research
  • Optimization and Search Problems
  • Distributed Systems and Fault Tolerance
  • Opportunistic and Delay-Tolerant Networks
  • Complexity and Algorithms in Graphs
  • Bayesian Modeling and Causal Inference
  • Markov Chains and Monte Carlo Methods

Some recent papers authored or coauthored by Paul G. Spirakis include:

  • "Optimality guarantees for crystal structure prediction," 2023, published in Nature
  • "An O(log2N) Fully-Balanced Resampling Algorithm for Particle Filters on Distributed Memory Architectures," 2021, published in Algorithms
  • "The Complexity of Temporal Vertex Cover in Small-Degree Graphs," 2022, published in Proceedings of the AAAI Conference on Artificial Intelligence
  • "Reinforcement learning in crystal structure prediction," 2023, published in Digital Discovery
  • "The Complexity of Computing Optimum Labelings for Temporal Connectivity," 2023, published in SSRN Electronic Journal

Frequent coauthors with whom Paul G. Spirakis has collaborated include:

  • George B. Mertzios
  • Othon Michail
  • Duncan Adamson
  • Efthyvoulos Drousiotis
  • Argyrios Deligkas

The scientist has published in a range of venues, frequently contributing to:

  • arXiv (Cornell University)
  • Journal of Computer and System Sciences
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • SSRN Electronic Journal
  • Algorithmica

Paul G. Spirakis has been recognized by several organizations for their work. Notably, they were named a European Association for Theoretical Computer Science (EATCS) Fellow in 2014 for their research in Random Graphs and Population Protocols, Algorithmic Game Theory, and Robust Parallel Distributed Computing.

In addition, they became a member of the Academia Europaea in 2010.

Best Publications

  • Weighted random sampling with a reservoir

    Pavlos S. Efraimidis;Paul G. Spirakis

  • The structure and complexity of Nash equilibria for a selfish routing game

    Dimitris Fotakis;Spyros Kontogiannis;Elias Koutsoupias;Marios Mavronicolas

  • Coordinating pebble motion on graphs, the diameter of permutation groups and applications

    D. Kornhauser;G. Miller;P. Spirakis

  • The Price of Selfish Routing

    Marios Mavronicolas;Paul Spirakis

  • Space Efficient Hash Tables With Worst Case Constant Access Time

    Dimitris Fotakis;Rasmus Pagh;Peter Sanders;Paul G. Spirakis

  • Tail bounds for occupancy and the satisfiability threshold conjecture

    Anil Kamath;Rajeev Motwani;Paul Spirakis;Krishna Palem

  • Selfish unsplittable flows

    Dimitris Fotakis;Spyros Kontogiannis;Paul Spirakis

  • An Optimization Approach for Approximate Nash Equilibria

    Haralampos Tsaknakis;Paul G. Spirakis

  • Approximate Equilibria and Ball Fusion

    Elias Koutsoupias;Marios Mavronicolas;Paul G. Spirakis

  • Efficient Robust Parallel Computations

    Z. M. Kedem;K. V. Palem;P. G. Spirakis

  • Fundamental control algorithms in mobile networks

    Kostas P. Hatzis;George P. Pentaris;Paul G. Spirakis;Vasilis T. Tampakas

  • Traveling salesman problems in temporal graphs

    Othon Michail;Paul G. Spirakis;Paul G. Spirakis

  • BSP vs LogP

    Gianfranco Bilardi;Kieran T. Herley;Andrea Pietracaprina;Geppino Pucci

  • Combining tentative and definite executions for very fast dependable parallel computing

    Z. M. Kedem;K. V. Palem;A. Raghunathan;P. G. Spirakis

  • Space Efficient Hash Tables with Worst Case Constant Access Time

    Dimitris Fotakis;Rasmus Pagh;Peter Sanders;Paul G. Spirakis

  • Strong np-hardness of moving many discs

    Paul G. Spirakis;Chee-Keng Yap

  • Determining Majority in Networks with Local Interactions and Very Small Local Memory

    George B. Mertzios;Sotiris E. Nikoletseas;Christoforos L. Raptopoulos;Christoforos L. Raptopoulos;Paul G. Spirakis;Paul G. Spirakis

  • Elements of the theory of dynamic networks

    Othon Michail;Paul G. Spirakis

  • Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays

    Hermann Jung;Lefteris M. Kirousis;Paul Spirakis

  • Temporal network optimization subject to connectivity constraints

    George B. Mertzios;Othon Michail;Ioannis Chatzigiannakis;Paul G. Spirakis

  • Mediated Population Protocols

    Ioannis Chatzigiannakis;Othon Michail;Paul G. Spirakis

  • Automata, Languages and Programming

    Samson Abramsky;Cyril Gavoille;Claude Kirchner;Friedhelm Meyer Auf der Heide

Frequent Co-Authors

Sotiris Nikoletseas
Sotiris Nikoletseas University of Patras
Ioannis Chatzigiannakis
Ioannis Chatzigiannakis Sapienza University of Rome
Shlomi Dolev
Shlomi Dolev Ben-Gurion University of the Negev
Philippas Tsigas
Philippas Tsigas Chalmers University of Technology
John H. Reif
John H. Reif Duke University
Elias Koutsoupias
Elias Koutsoupias University of Oxford
Krishna V. Palem
Krishna V. Palem Rice University
Leszek Gasieniec
Leszek Gasieniec University of Liverpool
Moti Yung
Moti Yung Columbia University
Giuseppe Persiano
Giuseppe Persiano University of Salerno

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 the field of Computer Science in the USA opens up a variety of academic and career pathways. Students can begin by examining different college programs to find the major that best aligns with their interests and long-term goals, ranging from software engineering to data science.

For those looking to further their education while balancing personal and professional commitments, enrolling in the easiest online masters degree programs can be both time-efficient and flexible. These programs are designed for working adults who need to advance their skills without a heavy academic load.

If you are considering an advanced research or leadership role, pursuing the cheapest doctorate degree online can make high-level education more accessible and affordable. This is ideal for those interested in academic, research, or high-level industry positions.

Additionally, the online edd programs offer fast-track options for those aiming for educational leadership roles. These programs are tailored for professionals seeking a doctorate with a focus on practical application rather than research alone.

Best Scientists Citing Paul G. Spirakis

Trending Scientists

Recently Published Articles