What is he best known for?
The fields of study he is best known for:
- 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.
His most cited work include:
- 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)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Combinatorics (43.55%)
- Discrete mathematics (43.40%)
- Distributed computing (15.74%)
What were the highlights of his more recent work (between 2014-2021)?
- Discrete mathematics (43.40%)
- Combinatorics (43.55%)
- Upper and lower bounds (15.18%)
In recent papers he was focusing on the following fields of study:
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.
Between 2014 and 2021, his most popular works were:
- Efficient Robust Parallel Computations (113 citations)
- Traveling salesman problems in temporal graphs (55 citations)
- Traveling salesman problems in temporal graphs (55 citations)
In his most recent research, the most cited papers focused on:
- 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.
