Skip to main content
Top
Published in:
Cover of the book

2015 | OriginalPaper | Chapter

A Glimpse at Paul G. Spirakis

Authors : Ioannis Chatzigiannakis, Dimitris Fotakis, Spyros Kontogiannis, Othon Michail, Sotiris Nikoletseas, Grammati Pantziou, Christos Zaroliagis

Published in: Algorithms, Probability, Networks, and Games

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference 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) 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)
2.
go back to reference 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) CrossRef 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) CrossRef
3.
go back to reference 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)CrossRefMATH 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)CrossRefMATH
4.
go back to reference Bilardi, G., Herley, K., Pietracaprina, A., Pucci, G., Spirakis, P.: BSP versus LogP. Algorithmica 24, 405–422 (1999). Preliminary version in SPAA 1996MathSciNetCrossRefMATH Bilardi, G., Herley, K., Pietracaprina, A., Pucci, G., Spirakis, P.: BSP versus LogP. Algorithmica 24, 405–422 (1999). Preliminary version in SPAA 1996MathSciNetCrossRefMATH
5.
go back to reference 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) 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)
6.
go back to reference 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) CrossRef 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) CrossRef
7.
go back to reference 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)MathSciNetCrossRef 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)MathSciNetCrossRef
8.
go back to reference 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)MathSciNetCrossRefMATH 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)MathSciNetCrossRefMATH
9.
go back to reference 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) CrossRef 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) CrossRef
10.
go back to reference 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) 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)
11.
go back to reference Chatzigiannakis, I., Nikoletseas, S., Spirakis, P.: Distributed communication algorithms for ad hoc mobile networks. J. Parallel Distrib. Comput. 63(1), 58–74 (2003)CrossRefMATH Chatzigiannakis, I., Nikoletseas, S., Spirakis, P.: Distributed communication algorithms for ad hoc mobile networks. J. Parallel Distrib. Comput. 63(1), 58–74 (2003)CrossRefMATH
12.
go back to reference Chen, X., Deng, X., Teng, S.-H.: Settling the complexity of computing two-player Nash equilibria. J. ACM 56, 3, Art. No. 14 (2009) Chen, X., Deng, X., Teng, S.-H.: Settling the complexity of computing two-player Nash equilibria. J. ACM 56, 3, Art. No. 14 (2009)
13.
go back to reference Christodoulou, G., Koutsoupias, E., Spirakis, P.: On the performance of approximate equilibria in congestion games. Algorithmica 61(1), 116–140 (2011)MathSciNetCrossRefMATH Christodoulou, G., Koutsoupias, E., Spirakis, P.: On the performance of approximate equilibria in congestion games. Algorithmica 61(1), 116–140 (2011)MathSciNetCrossRefMATH
14.
go back to reference 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) CrossRef 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) CrossRef
15.
go back to reference 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 2006MathSciNetCrossRefMATH 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 2006MathSciNetCrossRefMATH
16.
go back to reference 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) CrossRef 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) CrossRef
17.
go back to reference 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 2012MathSciNetCrossRefMATH 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 2012MathSciNetCrossRefMATH
18.
go back to reference 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) 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)
19.
go back to reference 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)MathSciNetCrossRefMATH 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)MathSciNetCrossRefMATH
20.
go back to reference 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) 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)
21.
22.
go back to reference 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) CrossRef 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) CrossRef
23.
go back to reference Fearnley, J., Igwe, T.P., Savani, R.: An empirical study of finding approximate equilibria in bimatrix games. ArXiv/CoRR, abs/1502.04980 (2015) Fearnley, J., Igwe, T.P., Savani, R.: An empirical study of finding approximate equilibria in bimatrix games. ArXiv/CoRR, abs/1502.04980 (2015)
24.
go back to reference 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)MathSciNetCrossRefMATH 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)MathSciNetCrossRefMATH
25.
27.
go back to reference 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)MathSciNetCrossRefMATH 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)MathSciNetCrossRefMATH
28.
29.
go back to reference Fotakis, D., Nikoletseas, S., Papadopoulou, V., Spirakis, P.: Radiocoloring in planar graphs: complexity and approximations. Theor. Comput. Sci. 340(3), 514–538 (2005)MathSciNetCrossRefMATH Fotakis, D., Nikoletseas, S., Papadopoulou, V., Spirakis, P.: Radiocoloring in planar graphs: complexity and approximations. Theor. Comput. Sci. 340(3), 514–538 (2005)MathSciNetCrossRefMATH
30.
go back to reference 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) CrossRef 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) CrossRef
31.
go back to reference 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)MathSciNetCrossRefMATH 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)MathSciNetCrossRefMATH
32.
go back to reference 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) CrossRef 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) CrossRef
33.
go back to reference 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) 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)
34.
go back to reference 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)MathSciNetCrossRefMATH 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)MathSciNetCrossRefMATH
35.
go back to reference 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) 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)
36.
go back to reference 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 2007MathSciNetCrossRefMATH 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 2007MathSciNetCrossRefMATH
37.
go back to reference 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)MathSciNetCrossRefMATH 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)MathSciNetCrossRefMATH
38.
go back to reference 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 1994MathSciNetCrossRefMATH 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 1994MathSciNetCrossRefMATH
39.
go back to reference 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) 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)
40.
go back to reference 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) 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)
41.
go back to reference 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 1989MathSciNetCrossRefMATH 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 1989MathSciNetCrossRefMATH
42.
go back to reference 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)CrossRef 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)CrossRef
43.
go back to reference 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) CrossRef 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) CrossRef
44.
go back to reference 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) CrossRef 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) CrossRef
45.
go back to reference 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)MathSciNetCrossRefMATH 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)MathSciNetCrossRefMATH
46.
47.
go back to reference 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 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
48.
50.
go back to reference 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) CrossRef 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) CrossRef
51.
go back to reference Mertzios, G.B., Nikoletseas, S., Raptopoulos, C., Spirakis, P.: Natural models for evolution on networks. Theor. Comput. Sci. 477, 76–95 (2013)MathSciNetCrossRefMATH Mertzios, G.B., Nikoletseas, S., Raptopoulos, C., Spirakis, P.: Natural models for evolution on networks. Theor. Comput. Sci. 477, 76–95 (2013)MathSciNetCrossRefMATH
52.
go back to reference 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) 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)
53.
go back to reference Michail, O.: An introduction to temporal graphs—an algorithmic perspective. In: Algorithms, Probability, Networks, and Games. LNCS, vol. 9295. Springer, New York (2015) Michail, O.: An introduction to temporal graphs—an algorithmic perspective. In: Algorithms, Probability, Networks, and Games. LNCS, vol. 9295. Springer, New York (2015)
54.
go back to reference Michail, O., Chatzigiannakis, I., Spirakis, P.: New Models for Population Protocols. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers, San Rafael (2011) MATH Michail, O., Chatzigiannakis, I., Spirakis, P.: New Models for Population Protocols. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers, San Rafael (2011) MATH
55.
56.
go back to reference 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) CrossRef 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) CrossRef
57.
go back to reference 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)CrossRefMATH 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)CrossRefMATH
58.
go back to reference 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) 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)
59.
go back to reference 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) 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)
60.
go back to reference 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) 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)
61.
go back to reference Michail, O., Spirakis, P.: Terminating population protocols via some minimal global knowledge assumptions. J. Parallel Distrib. Comput. 81, 1–10 (2015)CrossRef Michail, O., Spirakis, P.: Terminating population protocols via some minimal global knowledge assumptions. J. Parallel Distrib. Comput. 81, 1–10 (2015)CrossRef
62.
go back to reference Michail, O., Spirakis, P.: Distributed computation by connectivity preserving network transformers (2015) (to appear) Michail, O., Spirakis, P.: Distributed computation by connectivity preserving network transformers (2015) (to appear)
63.
go back to reference 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)MathSciNetCrossRefMATH 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)MathSciNetCrossRefMATH
64.
65.
go back to reference 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) 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)
66.
go back to reference Nikoletseas, S., Prasinos, G., Spirakis, P., Zaroliagis, C.: Attack propagation in networks. Theory Comput. Syst. 36, 553–574 (2003). Preliminary version in ACM SPAA 2001MathSciNetCrossRefMATH Nikoletseas, S., Prasinos, G., Spirakis, P., Zaroliagis, C.: Attack propagation in networks. Theory Comput. Syst. 36, 553–574 (2003). Preliminary version in ACM SPAA 2001MathSciNetCrossRefMATH
67.
go back to reference 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) CrossRef 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) CrossRef
68.
go back to reference Panagopoulou, P., Spirakis, P.: Algorithms for pure Nash equilibria in weighted congestion games. ACM J. Exp. Algorithmics 11, 1–19 (2006)MathSciNetMATH Panagopoulou, P., Spirakis, P.: Algorithms for pure Nash equilibria in weighted congestion games. ACM J. Exp. Algorithmics 11, 1–19 (2006)MathSciNetMATH
69.
go back to reference Panagopoulou, P., Spirakis, P.: Random bimatrix games are asymptotically easy to solve (A simple proof). Theor. Comput. Sci. 54(3), 479–490 (2014)MathSciNet Panagopoulou, P., Spirakis, P.: Random bimatrix games are asymptotically easy to solve (A simple proof). Theor. Comput. Sci. 54(3), 479–490 (2014)MathSciNet
70.
go back to reference Pantziou, G., Pentaris, G., Spirakis, P.: Competitive call control in mobile networks. In: Algorithms and Computation—ISAAC 1997, pp. 404–413 (1997) Pantziou, G., Pentaris, G., Spirakis, P.: Competitive call control in mobile networks. In: Algorithms and Computation—ISAAC 1997, pp. 404–413 (1997)
71.
go back to reference 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 1990MathSciNetCrossRefMATH 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 1990MathSciNetCrossRefMATH
72.
go back to reference Reif, J., Spirakis, P.: Random matroids. In: Proceedings 12th ACM Symposium on Theory of Computing—STOC 1980, pp. 385–397 (1980) Reif, J., Spirakis, P.: Random matroids. In: Proceedings 12th ACM Symposium on Theory of Computing—STOC 1980, pp. 385–397 (1980)
73.
go back to reference 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) 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)
74.
go back to reference Reif, J., Spirakis, P.: Real time synchronization of interprocess communications. ACM Trans. Programm. Lang. Syst. 6(2), 215–238 (1984)CrossRefMATH Reif, J., Spirakis, P.: Real time synchronization of interprocess communications. ACM Trans. Programm. Lang. Syst. 6(2), 215–238 (1984)CrossRefMATH
76.
go back to reference Reif, J., Spirakis, P.: Expected parallel time and sequential space complexity of graph and digraph problems. Algorithmica 7, 597–630 (1992)MathSciNetCrossRefMATH Reif, J., Spirakis, P.: Expected parallel time and sequential space complexity of graph and digraph problems. Algorithmica 7, 597–630 (1992)MathSciNetCrossRefMATH
77.
go back to reference Spirakis, P.: Optimal parallel randomized algorithms for addition sparse addition and identification. Inf. Comput. 76, 1–12 (1988)MathSciNetCrossRefMATH Spirakis, P.: Optimal parallel randomized algorithms for addition sparse addition and identification. Inf. Comput. 76, 1–12 (1988)MathSciNetCrossRefMATH
78.
go back to reference 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) CrossRef 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) CrossRef
79.
go back to reference 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) CrossRef 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) CrossRef
80.
go back to reference 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) CrossRef 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) CrossRef
81.
go back to reference 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) 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)
82.
go back to reference Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks. Technical report CS-200006, Duke University (2000) Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks. Technical report CS-200006, Duke University (2000)
Metadata
Title
A Glimpse at Paul G. Spirakis
Authors
Ioannis Chatzigiannakis
Dimitris Fotakis
Spyros Kontogiannis
Othon Michail
Sotiris Nikoletseas
Grammati Pantziou
Christos Zaroliagis
Copyright Year
2015
DOI
https://doi.org/10.1007/978-3-319-24024-4_1

Premium Partner