A Glimpse at Paul G. Spirakis

@inproceedings{Chatzigiannakis2015AGA,
  title={A Glimpse at Paul G. Spirakis},
  author={Ioannis Chatzigiannakis and Dimitris Fotakis and Spyros C. Kontogiannis and Othon Michail and Sotiris E. Nikoletseas and G. Pantziou and Christos D. Zaroliagis},
  booktitle={Algorithms, Probability, Networks, and Games},
  year={2015}
}
Paul Spirakis is an eminent, talented, and influential researcher that contributed significantly to computer science. This article is a modest attempt of a biographical sketch of Paul, which we drafted with extreme love and honor. 

References

SHOWING 1-10 OF 83 REFERENCES
The Best Nurturers in Computer Science Research
TLDR
A heuristic for mining nurturers in temporally organized collaboration networks: people who facilitate the growth and success of the young ones in the network is presented, and there is a recognizable deviation between the most successful researchers and the best nurturers.
Efficient robust parallel computations
TLDR
This paper describes a completely general strategy that takes an arbitrary step of an ideal CRCW PRAM and automatically translates it to run efficiently and robustly on a PRAM in which processors are prone to failure.
Optimal Parallel Randomized Algorithms for Addition Sparse Addition and Identification
Connectivity preserving network transformers
Approximating Fixation Probabilities in the Generalized Moran Process
TLDR
The Moran process is considered, as generalized by Lieberman et al. (Nature 433:312–316, 2005), and it is shown that the number of steps needed to reach fixation or extinction is bounded by a polynomial in thenumber of vertices in the graph.
Determining majority in networks with local interactions and very small local memory
TLDR
It is proved that there does not exist any population protocol that always computes majority in any interaction graph by using at most 3 types per vertex, and that, if the initial assignement of types to vertices is random, the protocol of Angluin et al. (Distrib.
Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/3
TLDR
A probabilistic argument shows that there exist e-well-supported equilibria with supports of cardinality $O\frac{1}{\epsilon^2}\cdot \log n$ , for any e>0; thus, the polylogarithmic cardinality bound presented cannot be greatly improved.
Random matroids
TLDR
A new random structure generalizing matroids are introduced that allow us to develop general techniques for solving hard combinatorial optimization problems with random inputs.
Settling the complexity of computing two-player Nash equilibria
We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version) introduced by
...
...