Skip to main content
SpringerLink
Log in

A Glimpse at Paul G. Spirakis

  • Chapter
  • First Online:
Algorithms, Probability, Networks, and Games

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9295))

  • 1266 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Akrida, E., Gasieniec, L., Mertzios, G., Spirakis, P.: Ephemeral networks with random availability of links: diameter and connectivity. In: Proceedings of 26th ACM Symposium on Parallelism in Algorithms and Architectures—SPAA 2014, pp. 267–276 (2014)

    Google Scholar 

  2. Anbalagan, Y., Norin, S., Savani, R., Vetta, A.: Polylogarithmic supports are required for approximate well-supported Nash equilibria below 2/3. In: Chen, Y., Immorlica, N. (eds.) WINE 2013. LNCS, vol. 8289, pp. 15–23. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  3. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18(4), 235–253 (2006)

    Article  MATH  Google Scholar 

  4. Bilardi, G., Herley, K., Pietracaprina, A., Pucci, G., Spirakis, P.: BSP versus LogP. Algorithmica 24, 405–422 (1999). Preliminary version in SPAA 1996

    Article  MathSciNet  MATH  Google Scholar 

  5. Cerf, V., Burleigh, S., Hooke, A., Torgerson, L., Durst, B., Scott, K., Fall, K., Weiss, H.: Delay-tolerant networking architecture. Technical report, The IETF Trust (2007)

    Google Scholar 

  6. Chatzigiannakis, I., Dimitriou, T.D., Mavronicolas, M., Nikoletseas, S.E., Spirakis, P.G.: A comparative study of protocols for efficient data propagation in smart dust networks. In: Kosch, H., Böszörményi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol. 2790, pp. 1003–1016. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Chatzigiannakis, I., Dimitriou, T., Mavronicolas, M., Nikoletseas, S., Spirakis, P.: A comparative study of protocols for efficient data propagation in smart dust networks. Parallel Process. Lett. 13(4), 615–627 (2003)

    Article  MathSciNet  Google Scholar 

  8. Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A., Spirakis, P.: Passively mobile communicating machines that use restricted space. Theor. Comput. Sci. 412(46), 6469–6483 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  9. Chatzigiannakis, I., Nikoletseas, S.E., Paspallis, N., Spirakis, P.G., Zaroliagis, C.D.: An experimental study of basic communication protocols in ad-hoc mobile networks. In: Brodal, G.S., Frigioni, D., Marchetti-Spaccamela, A. (eds.) WAE 2001. LNCS, vol. 2141, pp. 159–171. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Chatzigiannakis, I., Nikoletseas, S., Spirakis, P.: Smart dust protocols for local detection and propagation. In: Proceedings of 2nd ACM International Workshop on Principles of Mobile Computing—POMC 2002, pp. 9–16 (2002)

    Google Scholar 

  11. Chatzigiannakis, I., Nikoletseas, S., Spirakis, P.: Distributed communication algorithms for ad hoc mobile networks. J. Parallel Distrib. Comput. 63(1), 58–74 (2003)

    Article  MATH  Google Scholar 

  12. Chen, X., Deng, X., Teng, S.-H.: Settling the complexity of computing two-player Nash equilibria. J. ACM 56, 3, Art. No. 14 (2009)

    Google Scholar 

  13. Christodoulou, G., Koutsoupias, E., Spirakis, P.: On the performance of approximate equilibria in congestion games. Algorithmica 61(1), 116–140 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  14. Czyzowicz, J., Ga̧sieniec, L., Kosowski, A., Kranakis, E., Spirakis, P.G., Uznański, P.: On convergence and threshold properties of discrete Lotka-Volterra population protocols. In: Halldórsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9134, pp. 393–405. Springer, Heidelberg (2015)

    Chapter  Google Scholar 

  15. Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. SIAM J. Comput. 39(1), 195–259 (2009). Preliminary version in ACM STOC 2006

    Article  MathSciNet  MATH  Google Scholar 

  16. Daskalakis, C., Mehta, A., Papadimitriou, C.: A note on approximate Nash equilibria. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 297–306. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  17. Díaz, J., Goldberg, L.A., Mertzios, G.B., Richerby, D., Serna, M.J., Spirakis, P.: Approximating fixation probabilities in the generalized Moran process. Algorithmica 69(1), 78–91 (2014). Preliminary version in SODA 2012

    Article  MathSciNet  MATH  Google Scholar 

  18. Diaz, J., Koukopoulos, D., Nikoletseas, S., Spirakis, P., Serna, M., Thilikos, D.: Stability and instability of the FIFO protocol. In: Proceedings of 13th ACM Symposium on Parallel Algorithms and Architectures—SPAA 2001, pp. 48–52 (2001)

    Google Scholar 

  19. Díaz, J., Serna, M.J., Spirakis, P.: On the random generation and counting of matchings in dense graphs. Theor. Comput. Sci. 201(1–2), 281–290 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  20. Dimitriou, T.D., Krontiris, I., Nikakis, F., Spirakis, P.G.: SPEED: Scalable Protocols for Efficient Event Delivery in sensor networks. In: Mitrou, N.M., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds.) NETWORKING 2004. LNCS, vol. 3042, pp. 1300–1305. Springer, Heidelberg (2004)

    Google Scholar 

  21. Fatourou, P., Spirakis, P.: Efficient scheduling of strict multithreaded computations. Theory Comput. Syst. 33(3), 173232 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  22. Fearnley, J., Goldberg, P.W., Savani, R., Sørensen, T.B.: Approximate well-supported Nash equilibria below two-thirds. In: Serna, M. (ed.) SAGT 2012. LNCS, vol. 7615, pp. 108–119. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  23. Fearnley, J., Igwe, T.P., Savani, R.: An empirical study of finding approximate equilibria in bimatrix games. ArXiv/CoRR, abs/1502.04980 (2015)

    Google Scholar 

  24. Fotakis, D., Gkatzelis, V., Kaporis, A., Spirakis, P.: The impact of social ignorance on weighted congestion games. Theory Comput, Syst. 50(3), 559–578 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  25. Fotakis, D., Kaporis, A., Spirakis, P.: Efficient methods for selfish network design. Theor. Comput. Sci. 448, 9–20 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  26. Fotakis, D., Kontogiannis, S., Spirakis, P.: Selfish unsplittable flows. Theor. Comput. Sci. 348, 226–239 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  27. Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., Spirakis, P.: The structure and complexity of Nash equilibria for a selfish routing game. Theor. Comput. Sci. 410(36), 3305–3326 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  28. Fotakis, D., Kontogiannis, S., Spirakis, P.: Atomic congestion games among coalitions. ACM Trans. Algorithms 4, 4 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  29. Fotakis, D., Nikoletseas, S., Papadopoulou, V., Spirakis, P.: Radiocoloring in planar graphs: complexity and approximations. Theor. Comput. Sci. 340(3), 514–538 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  30. Fotakis, D.A., Spirakis, P.G.: A Hamiltonian approach to the assignment of non-reusable frequencies. In: Arvind, V., Sarukkai, S. (eds.) FST TCS 1998. LNCS, vol. 1530, pp. 18–30. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  31. Harks, T., Klimm, M., Möhring, R.H.: Characterizing the existence of potential functions in weighted congestion games. Theory Comput. Syst. 49(1), 46–70 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  32. Hatzis, K., Pentaris, G., Spirakis, P.G., Tampakas, B.: Counting in mobile networks: theory and experimentation. In: Vitter, J.S., Zaroliagis, C.D. (eds.) WAE 1999. LNCS, vol. 1668, pp. 95–109. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  33. Hatzis, K., Pentaris, G., Spirakis, P., Tampakas, V., Tan, R.B.: Fundamental control algorithms in mobile networks. In: Proceedings of ACM SPAA 1999, pp. 251–260 (1999)

    Google Scholar 

  34. Jung, J., Kirousis, L.M., Spirakis, P.: Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays. Inf. Comput. 105, 94–104 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  35. Kamath, A., Motwani, R., Palem, K., Spirakis, P.: Tail bounds for occupancy and the satisfiability threshold conjecture. In: Proceedings of 35th IEEE Symposium on Foundations of Computer Science—FOCS 1994, pp. 592–603 (1994)

    Google Scholar 

  36. Kannan, R., Theobald, T.: Games of fixed rank: a hierarchy of bimatrix games. Econ. Theory 42, 157–173 (2010). Preliminary version in ACM-SIAM SODA 2007

    Article  MathSciNet  MATH  Google Scholar 

  37. Kaporis, A., Spirakis, P.: The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions. Theor. Comput. Sci. 410(8–10), 745–755 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  38. Kavvadias, D., Pantziou, G., Spirakis, P., Zaroliagis, C.: Hammock-on-Ears decomposition: a technique for the efficient parallel solution of shortest paths and other problems. Theor. Comput. Sci. 168(1), 121–154 (1996). Preliminary version in MFCS 1994

    Article  MathSciNet  MATH  Google Scholar 

  39. Kedem, Z., Palem, K., Spirakis, P.G.: Efficient robust parallel computations. In: Proceedings of 22nd Annual ACM Symposium on Theory of Computing—STOC 1990, pp. 138–148 (1990)

    Google Scholar 

  40. Kempe, D., Kleinberg, J., Kumar, A.: Connectivity and inference problems for temporal networks. In: Proceedings of 32nd ACM Symposium on Theory of Computing—STOC 2000, pp. 504–513 (2000)

    Google Scholar 

  41. Kirousis, L., Serna, M., Spirakis, P.: The parallel complexity of the connected subgraph problem. SIAM J. Comput. 22(3), 573–586 (1993). Preliminary version in FOCS 1989

    Article  MathSciNet  MATH  Google Scholar 

  42. Kirousis, L., Spirakis, P., Tsigas, P.: Reading many variables in one atomic operation solutions with linear or sublinear complexity. IEEE Trans. Parallel Distrib. Comput. 5(7), 688–696 (1994)

    Article  Google Scholar 

  43. Kontogiannis, S.C., Panagopoulou, P.N., Spirakis, P.G.: Polynomial algorithms for approximating nash equilibria of bimatrix games. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 286–296. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  44. Kontogiannis, S., Spirakis, P.: Approximability of symmetric bimatrix games and related experiments. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 1–20. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  45. Koukopoulos, D., Mavronicolas, M., Nikoletseas, S., Spirakis, P.: The impact of network structure on the stability of greedy protocols. Theory Comput. Syst. 38(4), 425–460 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  46. Koutsoupias, E., Mavronicolas, M., Spirakis, P.: Approximate equilibria and ball fusion. Theory Comput. Syst. 36, 683–693 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  47. Kumar, B., Srikant, Y.N.: The best nurturers in computer science research. In: Proceedings of 2005 SIAM International Conference on Data Mining, pp. 566–570; also Technical Report IISc-CSA-TR-2004-10, Computer Science and Automation, Indian Institute of Science, India, October 2004

    Google Scholar 

  48. Mangasarian, O.L., Stone, H.: Two-person nonzero-sum games and quadratic programming. J. Math. Anal. Appl. 9(3), 348–355 (1964)

    Article  MathSciNet  MATH  Google Scholar 

  49. Mavronicolas, M., Spirakis, P.: The price of selfish routing. Algorithmica 48(1), 91–126 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  50. Mertzios, G.B., Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Temporal network optimization subject to connectivity constraints. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 657–668. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  51. Mertzios, G.B., Nikoletseas, S., Raptopoulos, C., Spirakis, P.: Natural models for evolution on networks. Theor. Comput. Sci. 477, 76–95 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  52. Mertzios, G.B., Nikoletseas, S.E., Raptopoulos, C.L., Spirakis, P.G.: Determining majority in networks with local interactions and very small local memory. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 871–882. Springer, Heidelberg (2014)

    Google Scholar 

  53. Michail, O.: An introduction to temporal graphs—an algorithmic perspective. In: Algorithms, Probability, Networks, and Games. LNCS, vol. 9295. Springer, New York (2015)

    Google Scholar 

  54. Michail, O., Chatzigiannakis, I., Spirakis, P.: New Models for Population Protocols. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers, San Rafael (2011)

    MATH  Google Scholar 

  55. Michail, O., Chatzigiannakis, I., Spirakis, P.: Mediated population protocols. Theor. Comput. Sci. 412(22), 2434–2450 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  56. Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Naming and counting in anonymous unknown dynamic networks. In: Higashino, T., Katayama, Y., Masuzawa, T., Potop-Butucaru, M., Yamashita, M. (eds.) SSS 2013. LNCS, vol. 8255, pp. 281–295. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  57. Michail, O., Chatzigiannakis, I., Spirakis, P.: Causality, influence, and computation in possibly disconnected synchronous dynamic networks. J. Parallel Distrib. Comput. 74(1), 2016–2026 (2014)

    Article  MATH  Google Scholar 

  58. Michail, O., Chatzigiannakis, I., Spirakis, P.: Computing in dynamic networks. In: Dehmer, M., Emmert-Streib, F., Pickl, S. (eds.) Chapter 6 in Computational Network Theory: Theoretical Foundations and Applications, 1st edn, pp. 173–218, Wiley-VCH Verlag GmbH & Co. KGaA (2015)

    Google Scholar 

  59. Michail, O., Spirakis, P.: Simple and efficient local codes for distributed stable network construction. In: Proceedings of 33rd ACM Symposium on Principles of Distributed Computing—PODC 2014, pp. 76–85 (2014)

    Google Scholar 

  60. Michail, O., Spirakis, P.G.: Traveling salesman problems in temporal graphs. In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds.) MFCS 2014, Part II. LNCS, vol. 8635, pp. 553–564. Springer, Heidelberg (2014)

    Google Scholar 

  61. Michail, O., Spirakis, P.: Terminating population protocols via some minimal global knowledge assumptions. J. Parallel Distrib. Comput. 81, 1–10 (2015)

    Article  Google Scholar 

  62. Michail, O., Spirakis, P.: Distributed computation by connectivity preserving network transformers (2015) (to appear)

    Google Scholar 

  63. Moulin, H., Vial, J.P.: Strategically zero-sum games: the class of games whose completely mixed equilibria cannot be improved upon. Int. J. Game Theory 7(3–4), 201–221 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  64. Nash, J.: Noncooperative games. Ann. Math. 54, 289–295 (1951)

    Article  Google Scholar 

  65. Nikoletseas, S., Palem, K.V., Spirakis, P., Yung, M.: Short vertex disjoint paths and multiconnectivity in random graphs: reliable network computing. In: Proceedings of 21st International Colloquium on Automata, Languages and Programming—ICALP 1994, pp. 508–519 (1994)

    Google Scholar 

  66. Nikoletseas, S., Prasinos, G., Spirakis, P., Zaroliagis, C.: Attack propagation in networks. Theory Comput. Syst. 36, 553–574 (2003). Preliminary version in ACM SPAA 2001

    Article  MathSciNet  MATH  Google Scholar 

  67. Nikoletseas, S.E., Raptopoulos, C., Spirakis, P.G.: The existence and efficient construction of large independent sets in general random intersection graphs. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 1029–1040. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  68. Panagopoulou, P., Spirakis, P.: Algorithms for pure Nash equilibria in weighted congestion games. ACM J. Exp. Algorithmics 11, 1–19 (2006)

    MathSciNet  MATH  Google Scholar 

  69. Panagopoulou, P., Spirakis, P.: Random bimatrix games are asymptotically easy to solve (A simple proof). Theor. Comput. Sci. 54(3), 479–490 (2014)

    MathSciNet  Google Scholar 

  70. Pantziou, G., Pentaris, G., Spirakis, P.: Competitive call control in mobile networks. In: Algorithms and Computation—ISAAC 1997, pp. 404–413 (1997)

    Google Scholar 

  71. Pantziou, G., Spirakis, P., Zaroliagis, C.: Efficient parallel algorithms for shortest paths in planar digraphs. BIT 32(2), 215–236 (1992). Preliminary vesrion in SWAT 1990

    Article  MathSciNet  MATH  Google Scholar 

  72. Reif, J., Spirakis, P.: Random matroids. In: Proceedings 12th ACM Symposium on Theory of Computing—STOC 1980, pp. 385–397 (1980)

    Google Scholar 

  73. Reif, J., Spirakis, P.: Distributed algorithms for synchronizing interprocess communication within real time. In: Proceedings of 13th ACM Symposium on Theory of Computing—STOC 1981, pp. 133–145 (1981)

    Google Scholar 

  74. Reif, J., Spirakis, P.: Real time synchronization of interprocess communications. ACM Trans. Programm. Lang. Syst. 6(2), 215–238 (1984)

    Article  MATH  Google Scholar 

  75. Reif, J., Spirakis, P.: Unbounded speed variability in distributed systems. SIAM J. Comput. 14(1), 7592 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  76. Reif, J., Spirakis, P.: Expected parallel time and sequential space complexity of graph and digraph problems. Algorithmica 7, 597–630 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  77. Spirakis, P.: Optimal parallel randomized algorithms for addition sparse addition and identification. Inf. Comput. 76, 1–12 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  78. Spirakis, P., Zaroliagis, C.: Distributed algorithm engineering. In: Fleischer, R., Moret, B.M.E., Schmidt, E.M. (eds.) Experimental Algorithmics. LNCS, vol. 2547, pp. 197–228. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  79. Tsaknakis, H., Spirakis, P.G.: An optimization approach for approximate Nash equilibria. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 42–56. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  80. Tsaknakis, H., Spirakis, P.G., Kanoulas, D.: Performance evaluation of a descent algorithm for bi-matrix games. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 222–230. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  81. Triantafillou, P., Ntarmos, N., Nikoletseas, S., Spirakis, P.: Nanopeer networks and P2P worlds. In: Proceedings of 3rd International Conference on Peer-to-Peer Computing—P2P 2003, pp. 40–46 (2003)

    Google Scholar 

  82. Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks. Technical report CS-200006, Duke University (2000)

    Google Scholar 

Download references

Acknowledgements

We are indebted to Eleni Spiraki (Paul’s sister) for her great help in the preparation of this article.

Author information

Authors and Affiliations

  1. Computer Technology Institute and Press “Diophantus”, Patras University Campus, N. Kazantzaki Str., 26504, Patras, Greece

    Ioannis Chatzigiannakis, Spyros Kontogiannis, Othon Michail, Sotiris Nikoletseas, Grammati Pantziou & Christos Zaroliagis

  2. Sapienza University of Rome, Rome, Italy

    Ioannis Chatzigiannakis

  3. Division of Computer Science, School of Electrical and Computer Engineering, National Technical University of Athens, 15780, Athens, Greece

    Dimitris Fotakis

  4. Department of Computer Science and Engineering, University of Ioannina, 45110, Ioannina, Greece

    Spyros Kontogiannis

  5. Department of Computer Engineering and Informatics, University of Patras, 26504, Patras, Greece

    Sotiris Nikoletseas & Christos Zaroliagis

  6. Department of Informatics, Technological Educational Institution of Athens, Egaleo, Greece

    Grammati Pantziou

Authors
  1. Ioannis Chatzigiannakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dimitris Fotakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Spyros Kontogiannis
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Othon Michail
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Sotiris Nikoletseas
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Grammati Pantziou
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Christos Zaroliagis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ioannis Chatzigiannakis .

Editor information

Editors and Affiliations

  1. University of Patras, Patras, Greece

    Christos Zaroliagis

  2. Technological Educational Institute of Athens, Athens, Greece

    Grammati Pantziou

  3. University of Ioannina, Ioannina, Greece

    Spyros Kontogiannis

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Chatzigiannakis, I. et al. (2015). A Glimpse at Paul G. Spirakis. In: Zaroliagis, C., Pantziou, G., Kontogiannis, S. (eds) Algorithms, Probability, Networks, and Games. Lecture Notes in Computer Science(), vol 9295. Springer, Cham. https://doi.org/10.1007/978-3-319-24024-4_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24024-4_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24023-7

  • Online ISBN: 978-3-319-24024-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation