- Home
- Best Scientists - Computer Science
- Paul G. Spirakis

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
42
Citations
7,737
483
World Ranking
5255
National Ranking
329

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

- Computer network
- The Internet
- Programming language

Paul G. Spirakis mainly investigates Nash equilibrium, Combinatorics, Mathematical economics, Mathematical optimization and Best response. His Nash equilibrium research incorporates themes from Function, Strategy, Game theory and Price of anarchy. The study incorporates disciplines such as Discrete mathematics, Upper and lower bounds and Probabilistic logic in addition to Combinatorics.

The Discrete mathematics study which covers Double hashing that intersects with Perfect hash function. His Mathematical economics research includes themes of Convergence and Polynomial. His Risk dominance study incorporates themes from Correlated equilibrium and Folk theorem.

- Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups and Applications (196 citations)
- Weighted random sampling with a reservoir (194 citations)
- Selfish unsplittable flows (187 citations)

Paul G. Spirakis mainly investigates Combinatorics, Discrete mathematics, Distributed computing, Nash equilibrium and Time complexity. Paul G. Spirakis regularly links together related areas like Upper and lower bounds in his Combinatorics studies. His research on Discrete mathematics often connects related topics like Bounded function.

His Distributed computing research is multidisciplinary, incorporating elements of Wireless sensor network, Computer network and Mobile computing. A significant part of his Nash equilibrium research incorporates Mathematical economics and Mathematical optimization studies. Paul G. Spirakis combines subjects such as Correlated equilibrium and Normal-form game, Folk theorem with his study of Best response.

- Combinatorics (43.55%)
- Discrete mathematics (43.40%)
- Distributed computing (15.74%)

- Discrete mathematics (43.40%)
- Combinatorics (43.55%)
- Upper and lower bounds (15.18%)

His primary scientific interests are in Discrete mathematics, Combinatorics, Upper and lower bounds, Graph and Vertex. His Discrete mathematics research is multidisciplinary, relying on both Discrete time and continuous time, Bounded function and Theory of computation. His Combinatorics research incorporates elements of Function, Computational complexity theory, Leader election and Special case.

Paul G. Spirakis works mostly in the field of Upper and lower bounds, limiting it down to topics relating to Nash equilibrium and, in certain cases, Stochastic game and Game theory, as a part of the same area of interest. His Graph study integrates concerns from other disciplines, such as Stochastic process and Algorithm, Approximation algorithm. His biological study spans a wide range of topics, including Connectivity and Shortest path problem.

- Efficient Robust Parallel Computations (113 citations)
- Traveling salesman problems in temporal graphs (55 citations)
- Traveling salesman problems in temporal graphs (55 citations)

- Computer network
- The Internet
- Algorithm

His main research concerns Discrete mathematics, Combinatorics, Upper and lower bounds, Universality and Population protocol. The concepts of his Discrete mathematics study are interwoven with issues in Discrete time and continuous time and Random variable. Paul G. Spirakis works mostly in the field of Combinatorics, limiting it down to concerns involving Function and, occasionally, Integer, Nash equilibrium and Polynomial.

His Nash equilibrium study is associated with Mathematical economics. His studies in Upper and lower bounds integrate themes in fields like Leader election, Undirected graph, Exponential function, Random graph and Random walk. His study looks at the relationship between Population protocol and topics such as Turing machine, which overlap with Pairwise comparison and Exploit.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Internet and Network Economics

Xiaotie Deng;Fan Chung Graham.

**(2008)**

487 Citations

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

Dimitris Fotakis;Spyros Kontogiannis;Elias Koutsoupias;Marios Mavronicolas.

Theoretical Computer Science **(2009)**

368 Citations

The Price of Selfish Routing

Marios Mavronicolas;Paul Spirakis.

Algorithmica **(2007)**

314 Citations

Weighted random sampling with a reservoir

Pavlos S. Efraimidis;Paul G. Spirakis.

Information Processing Letters **(2006)**

307 Citations

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

D. Kornhauser;G. Miller;P. Spirakis.

**(2011)**

303 Citations

Tail bounds for occupancy and the satisfiability threshold conjecture

Anil Kamath;Rajeev Motwani;Paul Spirakis;Krishna Palem.

Random Structures and Algorithms **(1995)**

229 Citations

Space Efficient Hash Tables With Worst Case Constant Access Time

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

Theory of Computing Systems / Mathematical Systems Theory **(2005)**

229 Citations

Selfish unsplittable flows

Dimitris Fotakis;Spyros Kontogiannis;Paul Spirakis.

international colloquium on automata, languages and programming **(2005)**

215 Citations

An Optimization Approach for Approximate Nash Equilibria

Haralampos Tsaknakis;Paul G. Spirakis.

Internet Mathematics **(2008)**

194 Citations

Approximate Equilibria and Ball Fusion

Elias Koutsoupias;Marios Mavronicolas;Paul G. Spirakis.

Theory of Computing Systems / Mathematical Systems Theory **(2003)**

169 Citations

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

Contact us

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:

University of Patras

Sapienza University of Rome

Ben-Gurion University of the Negev

Chalmers University of Technology

Duke University

Rice University

University of Liverpool

Columbia University

Fixie.ai

Max Planck Institute for Informatics

The University of Texas at Austin

University of Southern California

University of California, Santa Cruz

Duke University

University of Bari Aldo Moro

Centre national de la recherche scientifique, CNRS

University of California, San Francisco

Osaka University

University of Zurich

Texas A&M University

Ohio University - Lancaster

Ludwig-Maximilians-Universität München

University of Cambridge

University of Mississippi

University of Bristol

University at Buffalo, State University of New York

Something went wrong. Please try again later.