World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

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

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
S. Sitharama Iyengar
S. Sitharama Iyengar Florida International University

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