Paul G. Spirakis

7.9k total citations
260 papers, 2.7k citations indexed

About

Paul G. Spirakis is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Management Science and Operations Research. According to data from OpenAlex, Paul G. Spirakis has authored 260 papers receiving a total of 2.7k indexed citations (citations by other indexed papers that have themselves been cited), including 144 papers in Computer Networks and Communications, 57 papers in Computational Theory and Mathematics and 47 papers in Management Science and Operations Research. Recurrent topics in Paul G. Spirakis's work include Distributed systems and fault tolerance (50 papers), Game Theory and Applications (42 papers) and Optimization and Search Problems (38 papers). Paul G. Spirakis is often cited by papers focused on Distributed systems and fault tolerance (50 papers), Game Theory and Applications (42 papers) and Optimization and Search Problems (38 papers). Paul G. Spirakis collaborates with scholars based in Greece, United Kingdom and United States. Paul G. Spirakis's co-authors include Pavlos S. Efraimidis, Marios Mavronicolas, Othon Michail, Sotiris Nikoletseas, Ioannis Chatzigiannakis, Dimitris Fotakis, Spyros Kontogiannis, Krishna V. Palem, Gary L. Miller and Zvi M. Kedem and has published in prestigious journals such as Nature, Communications of the ACM and SIAM Journal on Computing.

In The Last Decade

Paul G. Spirakis

239 papers receiving 2.6k citations

Author Peers

Peers are selected by citation overlap in the author's most active subfields. citations · hero ref

Author Last Decade Papers Cites
Paul G. Spirakis 1.5k 548 469 434 334 260 2.7k
Burkhard Monien 926 0.6× 276 0.5× 365 0.8× 723 1.7× 184 0.6× 118 1.9k
Bruno Codenotti 780 0.5× 906 1.7× 526 1.1× 350 0.8× 420 1.3× 71 2.4k
Yossi Azar 3.0k 1.9× 972 1.8× 626 1.3× 990 2.3× 263 0.8× 152 4.2k
Nikhil Bansal 2.2k 1.5× 441 0.8× 616 1.3× 684 1.6× 103 0.3× 148 3.7k
Amit Kumar 1.4k 0.9× 189 0.3× 435 0.9× 532 1.2× 65 0.2× 119 2.3k
Steven I. Marcus 1.0k 0.7× 800 1.5× 1.1k 2.4× 1.2k 2.8× 249 0.7× 220 4.7k
Teofilo F. Gonzalez 1.3k 0.9× 182 0.3× 639 1.4× 567 1.3× 68 0.2× 68 3.6k
Amos Fiat 2.8k 1.8× 871 1.6× 1.5k 3.2× 903 2.1× 181 0.5× 116 4.7k
S. Muthukrishnan 1.7k 1.1× 592 1.1× 1.5k 3.2× 568 1.3× 53 0.2× 115 4.1k
D. de Werra 1.0k 0.7× 1.5k 2.7× 538 1.1× 1.2k 2.7× 103 0.3× 190 3.7k

Countries citing papers authored by Paul G. Spirakis

Since Specialization
Citations

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

Fields of papers citing papers by Paul G. Spirakis

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Paul G. Spirakis. 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 Paul G. Spirakis. The network helps show where Paul G. Spirakis may publish in the future.

Co-authorship network of co-authors of Paul G. Spirakis

This figure shows the co-authorship network connecting the top 25 collaborators of Paul G. Spirakis. A scholar is included among the top collaborators of Paul G. Spirakis 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 Paul G. Spirakis. Paul G. Spirakis 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.
Maskell, Simon, et al.. (2025). A Massively Parallel SMC Sampler for Decision Trees. Algorithms. 18(1). 14–14. 1 indexed citations
2.
Mertzios, George B., et al.. (2025). The complexity of transitively orienting temporal graphs. Journal of Computer and System Sciences. 150. 103630–103630.
3.
Deligkas, Argyrios, et al.. (2024). Approximate and Randomized Algorithms for Computing a Second Hamiltonian Cycle. Algorithmica. 86(9). 2766–2785.
4.
Spirakis, Paul G., et al.. (2023). Single MCMC chain parallelisation on decision trees. Annals of Mathematics and Artificial Intelligence. 93(1). 219–232. 1 indexed citations
5.
Collins, Christopher M., Dmytro Antypov, Vladimir V. Gusev, et al.. (2023). Reinforcement learning in crystal structure prediction. Digital Discovery. 2(6). 1831–1840. 4 indexed citations
6.
Gusev, Vladimir V., Argyrios Deligkas, Dmytro Antypov, et al.. (2023). Optimality guarantees for crystal structure prediction. Nature. 619(7968). 68–72. 33 indexed citations
7.
Mertzios, George B. & Paul G. Spirakis. (2018). Strong bounds for evolution in networks. Journal of Computer and System Sciences. 97. 60–82. 1 indexed citations
8.
Chatzigiannakis, Ioannis, et al.. (2008). A trusted architectural model for interconnecting testbeds of wireless sensor networks. IRIS Research product catalog (Sapienza University of Rome). 2. 515–518. 1 indexed citations
9.
Dolev, Shlomi, Elad M. Schiller, Paul G. Spirakis, & Philippas Tsigas. (2008). Strategies for repeated games with subsystem takeovers: implementable by deterministic and self-stabilizing automata (extended abstract). 37. 1 indexed citations
10.
Dolev, Shlomi, Elad M. Schiller, & Paul G. Spirakis. (2006). Game Authority for Robust Distributed Selfish-Computer Systems (Preliminary Version). Chalmers Publication Library (Chalmers University of Technology). 1 indexed citations
11.
Gibbons, Alan & Paul G. Spirakis. (2005). Lectures on Parallel Computation (Cambridge International Series on Parallel Computation). Cambridge University Press eBooks. 1 indexed citations
12.
Koukopoulos, Dimitrios, Sotiris Nikoletseas, & Paul G. Spirakis. (2001). The Range of Stability for Heterogeneous and FIFO Queueing Networks.. Electronic colloquium on computational complexity. 8 indexed citations
13.
Efraimidis, Pavlos S. & Paul G. Spirakis. (2000). Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines. Electronic colloquium on computational complexity. 7. 4 indexed citations
14.
Fotakis, Dimitris & Paul G. Spirakis. (1998). Graph Properties that Facilitate Travelling. DSpace - NTUA (National Technical University of Athens). 5. 2 indexed citations
15.
Fatourou, Panagiota, Marios Mavronicolas, & Paul G. Spirakis. (1998). The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms.. 244–258. 1 indexed citations
16.
Mamalis, Basilis, et al.. (1996). Parallel techniques for efficient searching over very large text collections. Text REtrieval Conference. 377–389. 1 indexed citations
17.
Fotakis, Dimitris & Paul G. Spirakis. (1996). (poly(log log n), poly(log log n))-Restricted Verifiers are Unlikely to Exist for Languages in NP. 360–371. 1 indexed citations
18.
Spirakis, Paul G., et al.. (1993). Performance Models for Perfect and Imperfect Clocks on Timestamp Ordering in Distributed Databases. 243–246. 1 indexed citations
19.
Spirakis, Paul G. & Alan Gibbons. (1993). PRAM models and fundamental parallel algorithmic techniques. Part I. Cambridge University Press eBooks. 19–40. 2 indexed citations
20.
Miller, Gary L., et al.. (1984). Coordinating Pebble Motion On Graphs, The Diameter Of Permutation Groups, And Applications. 241–250. 160 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

Rankless by CCL
2026