Prof Paul Spirakis PhD - Member of Academia Europaea

Professor in Computer Science Computer Science

    Publications

    2018

    Approximating the Existential Theory of the Reals (Conference Paper)

    Deligkas, A., Fearnley, J., Melissourgos, T., & Spirakis, P. G. (n.d.). Approximating the Existential Theory of the Reals. Retrieved from http://arxiv.org/abs/1810.01393v2

    Binary Search in Graphs Revisited (Journal article)

    Spirakis, P. G., Deligkas, A., & mertzios, G. (2018). Binary Search in Graphs Revisited. Algorithmica: an international journal in computer science.

    Brief Announcement: Providing End-to-End Secure Communication in Low-Power Wide Area Networks (Conference Paper)

    Chatzigiannakis, I., Liagkou, V., & Spirakis, P. G. (2018). Brief Announcement: Providing End-to-End Secure Communication in Low-Power Wide Area Networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 10879 LNCS (pp. 101-104). doi:10.1007/978-3-319-94147-9_8

    DOI: 10.1007/978-3-319-94147-9_8

    Communications of ACM (CACM) (Journal article)

    Spirakis, P. G., & Michail, O. (2018). Communications of ACM (CACM). Communications of the ACM.

    Cover Time in Edge-Uniform Stochastically-Evolving Graphs (Journal article)

    Lamprou, I., Martin, R., & Spirakis, P. G. (2018). Cover Time in Edge-Uniform Stochastically-Evolving Graphs. Algorithms, 11(10). doi:10.3390/a11100149

    DOI: 10.3390/a11100149

    Elements of the Theory of Dynamic Networks (Journal article)

    Michail, O., & Spirakis, P. G. (2018). Elements of the Theory of Dynamic Networks. COMMUNICATIONS OF THE ACM, 61(2), 72-81. doi:10.1145/3156693

    DOI: 10.1145/3156693

    Exact size counting in uniform population protocols in nearly logarithmic time (Journal article)

    Doty, D., Eftekhari, M., Michail, O., Spirakis, P. G., & Theofilatos, M. (n.d.). Exact size counting in uniform population protocols in nearly logarithmic time. Retrieved from http://arxiv.org/abs/1805.04832v1

    Fast Approximate Counting and Leader Election in Populations (Conference Paper)

    Michail, O., Spirakis, P. G., & Theofilatos, M. (n.d.). Fast Approximate Counting and Leader Election in Populations. Retrieved from http://arxiv.org/abs/1806.02638v1

    How many cooks spoil the soup? (Journal article)

    Michail, O., & Spirakis, P. G. (2018). How many cooks spoil the soup?. DISTRIBUTED COMPUTING, 31(6), 455-469. doi:10.1007/s00446-017-0317-z

    DOI: 10.1007/s00446-017-0317-z

    Mutants and Residents with Different Connection Graphs in the Moran Process (Journal article)

    Melissourgos, T., Nikoletseas, S., Raptopoulos, C., & Spirakis, P. (2018). Mutants and Residents with Different Connection Graphs in the Moran Process. LATIN 2018: THEORETICAL INFORMATICS, 10807, 790-804. doi:10.1007/978-3-319-77404-6_57

    DOI: 10.1007/978-3-319-77404-6_57

    Mutants and Residents with Different Connection Graphs in the Moran Process. (Conference Paper)

    Melissourgos, T., Nikoletseas, S. E., Raptopoulos, C., & Spirakis, P. G. (2018). Mutants and Residents with Different Connection Graphs in the Moran Process.. In M. A. Bender, M. Farach-Colton, & M. A. Mosteiro (Eds.), LATIN Vol. 10807 (pp. 790-804). Springer. Retrieved from https://doi.org/10.1007/978-3-319-77404-6

    Random input helps searching predecessors (Conference Paper)

    Belazzougui, D., Kaporis, A. C., & Spirakis, P. G. (2018). Random input helps searching predecessors. In CEUR Workshop Proceedings Vol. 2113 (pp. 106-115).

    Reachability games and related matrix and word problems (Thesis / Dissertation)

    Niskanen, R. (2018, February 13). Reachability games and related matrix and word problems.

    Short paper: Strategic contention resolution in multiple channels with limited feedback (Conference Paper)

    Christodoulou, G., Melissourgos, T., & Spirakis, P. G. (2018). Short paper: Strategic contention resolution in multiple channels with limited feedback. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 11059 LNCS (pp. 245-250). doi:10.1007/978-3-319-99660-8_22

    DOI: 10.1007/978-3-319-99660-8_22

    Simple and fast approximate counting and leader election in populations (Conference Paper)

    Michail, O., Spirakis, P. G., & Theofilatos, M. (2018). Simple and fast approximate counting and leader election in populations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 11201 LNCS (pp. 154-169). doi:10.1007/978-3-030-03232-6_11

    DOI: 10.1007/978-3-030-03232-6_11

    Strategic Contention Resolution in Multiple Channels (Conference Paper)

    Christodoulou, G., Melissourgos, T., & Spirakis, P. G. (n.d.). Strategic Contention Resolution in Multiple Channels. Retrieved from http://arxiv.org/abs/1810.04565v1

    Strong bounds for evolution in networks (Journal article)

    Mertzios, G. B., & Spirakis, P. G. (2018). Strong bounds for evolution in networks. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 97, 60-82. doi:10.1016/j.jcss.2018.04.004

    DOI: 10.1016/j.jcss.2018.04.004

    Temporal Network Optimization Subject to Connectivity Constraints (Journal article)

    Mertzios, G. B., Michail, O., & Spirakis, P. G. (n.d.). Temporal Network Optimization Subject to Connectivity Constraints. Algorithmica. doi:10.1007/s00453-018-0478-6

    DOI: 10.1007/s00453-018-0478-6

    Temporal Vertex Cover with a Sliding Time Window (Journal article)

    Akrida, E. C., Mertzios, G. B., Spirakis, P. G., & Zamaraev, V. (n.d.). Temporal Vertex Cover with a Sliding Time Window. Retrieved from http://arxiv.org/abs/1802.07103v1

    The Price of Stability of Weighted Congestion Games (Journal article)

    Christodoulou, G., Gairing, M., Giannakopoulos, Y., & Spirakis, P. G. (n.d.). The Price of Stability of Weighted Congestion Games. Retrieved from http://arxiv.org/abs/1802.09952v2

    The Price of Stability of Weighted Congestion Games. (Conference Paper)

    Christodoulou, G., Gairing, M., Giannakopoulos, Y., & Spirakis, P. G. (2018). The Price of Stability of Weighted Congestion Games.. In I. Chatzigiannakis, C. Kaklamanis, D. Marx, & D. Sannella (Eds.), ICALP Vol. 107 (pp. 150:1). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. Retrieved from http://www.dagstuhl.de/dagpub/978-3-95977-076-7

    The temporal explorer who returns to the base (Journal article)

    Akrida, E. C., Mertzios, G. B., & Spirakis, P. G. (n.d.). The temporal explorer who returns to the base. Retrieved from http://arxiv.org/abs/1805.04713v1

    2017

    A 3-Player Protocol Preventing Persistence in Strategic Contention with Limited Feedback. (Conference Paper)

    Christodoulou, G., Gairing, M., Nikoletseas, S. E., Raptopoulos, C., & Spirakis, P. G. (2017). A 3-Player Protocol Preventing Persistence in Strategic Contention with Limited Feedback.. In V. Bilò, & M. Flammini (Eds.), SAGT Vol. 10504 (pp. 240-251). Springer. Retrieved from https://doi.org/10.1007/978-3-319-66700-3

    A 3-player protocol preventing persistence in strategic contention with limited feedback (Conference Paper)

    Christodoulou, G., Gairing, M., Nikoletseas, S., Raptopoulos, C., & Spirakis, P. (n.d.). A 3-player protocol preventing persistence in strategic contention with limited feedback. Retrieved from http://arxiv.org/abs/1707.01439v1

    Binary Search in Graphs Revisited (Conference Paper)

    Deligkas, A., Mertzios, G. B., & Spirakis, P. G. (n.d.). Binary Search in Graphs Revisited. Retrieved from http://arxiv.org/abs/1702.08899v2

    Bounding the Cover Time in Edge-Uniform Stochastic Graphs. (Journal article)

    Lamprou, I., Martin, R., & Spirakis, P. G. (2017). Bounding the Cover Time in Edge-Uniform Stochastic Graphs.. CoRR, abs/1702.05412.

    Computing Approximate Nash Equilibria in Polymatrix Games. (Journal article)

    Deligkas, A., Fearnley, J., Savani, R., & Spirakis, P. G. (2017). Computing Approximate Nash Equilibria in Polymatrix Games.. Algorithmica, 77, 487-514.

    Connectivity preserving network transformers (Journal article)

    Michail, O., & Spirakis, P. G. (2017). Connectivity preserving network transformers. THEORETICAL COMPUTER SCIENCE, 671, 36-55. doi:10.1016/j.tcs.2016.02.040

    DOI: 10.1016/j.tcs.2016.02.040

    Cover Time in Edge-Uniform Stochastically-Evolving Graphs (Journal article)

    Lamprou, I., Martin, R., & Spirakis, P. (n.d.). Cover Time in Edge-Uniform Stochastically-Evolving Graphs. Retrieved from http://arxiv.org/abs/1702.05412v5

    Cover time in edge-uniform stochastically-evolving graphs (Conference Paper)

    Lamprou, I., Martin, R., & Spirakis, P. (2018). Cover time in edge-uniform stochastically-evolving graphs. In Algorithms Vol. 11. doi:10.3390/a11100149

    DOI: 10.3390/a11100149

    Determining majority in networks with local interactions and very small local memory (Journal article)

    Mertzios, G. B., Nikoletseas, S. E., Raptopoulos, C. L., & Spirakis, P. G. (2017). Determining majority in networks with local interactions and very small local memory. DISTRIBUTED COMPUTING, 30(1), 1-16. doi:10.1007/s00446-016-0277-8

    DOI: 10.1007/s00446-016-0277-8

    Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff Values (Conference Paper)

    Melissourgos, T., & Spirakis, P. (2017). Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff Values. In ALGORITHMS AND COMPLEXITY (CIAC 2017) Vol. 10236 (pp. 418-429). doi:10.1007/978-3-319-57586-5_35

    DOI: 10.1007/978-3-319-57586-5_35

    Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff Values. (Conference Paper)

    Melissourgos, T., & Spirakis, P. G. (2017). Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff Values.. In D. Fotakis, A. Pagourtzis, & V. T. Paschos (Eds.), CIAC Vol. 10236 (pp. 418-429). Retrieved from https://doi.org/10.1007/978-3-319-57586-5

    Network Constructors: A Model for Programmable Matter (Conference Paper)

    Michail, O., & Spirakis, P. G. (2017). Network Constructors: A Model for Programmable Matter. In SOFSEM 2017: THEORY AND PRACTICE OF COMPUTER SCIENCE Vol. 10139 (pp. 15-34). doi:10.1007/978-3-319-51963-0_3

    DOI: 10.1007/978-3-319-51963-0_3

    On the Chromatic Number of Non-Sparse Random Intersection Graphs (Journal article)

    Nikoletseas, S. E., Raptopoulos, C. L., & Spirakis, P. G. (2017). On the Chromatic Number of Non-Sparse Random Intersection Graphs. THEORY OF COMPUTING SYSTEMS, 60(1), 112-127. doi:10.1007/s00224-016-9733-x

    DOI: 10.1007/s00224-016-9733-x

    On the Transformation Capability of Feasible Mechanisms for Programmable Matter (Conference Paper)

    Michail, O., Skretas, G., & Spirakis, P. G. (n.d.). On the Transformation Capability of Feasible Mechanisms for Programmable Matter. Retrieved from http://arxiv.org/abs/1703.04381v1

    On the Transformation Capability of Feasible Mechanisms for Programmable Matter. (Conference Paper)

    Michail, O., Skretas, G., & Spirakis, P. G. (2017). On the Transformation Capability of Feasible Mechanisms for Programmable Matter.. In CoRR Vol. abs/1703.04381.

    Population protocols for majority in arbitrary networks (Journal article)

    Mertzios, G. B., Nikoletseas, S. E., Raptopoulos, C. L., & Spirakis, P. G. (2017). Population protocols for majority in arbitrary networks. Trends in Mathematics, 6, 77-82. doi:10.1007/978-3-319-51753-7_13

    DOI: 10.1007/978-3-319-51753-7_13

    Resolving Braess's Paradox in Random Networks (Journal article)

    Fotakis, D., Kaporis, A. C., Lianeas, T., & Spirakis, P. G. (2017). Resolving Braess's Paradox in Random Networks. ALGORITHMICA, 78(3), 788-818. doi:10.1007/s00453-016-0175-2

    DOI: 10.1007/s00453-016-0175-2

    Temporal Flows in Temporal Networks (Conference Paper)

    Akrida, E. C., Czyzowicz, J., Gasieniec, L., Kuszner, L., & Spirakis, P. G. (2017). Temporal Flows in Temporal Networks. In ALGORITHMS AND COMPLEXITY (CIAC 2017) Vol. 10236 (pp. 43-54). doi:10.1007/978-3-319-57586-5_5

    DOI: 10.1007/978-3-319-57586-5_5

    The Complexity of Optimal Design of Temporally Connected Graphs (Journal article)

    Akrida, E. C., Gasieniec, L., Mertzios, G. B., & Spirakis, P. G. (2017). The Complexity of Optimal Design of Temporally Connected Graphs. THEORY OF COMPUTING SYSTEMS, 61(3), 907-944. doi:10.1007/s00224-017-9757-x

    DOI: 10.1007/s00224-017-9757-x

    The computational complexity of weighted greedy matching (Conference Paper)

    Deligkas, A., Mertzios, G. B., & Spirakis, P. G. (2017). The computational complexity of weighted greedy matching. In 31st AAAI Conference on Artificial Intelligence, AAAI 2017 (pp. 466-472).

    2016

    Algorithms and Almost Tight Results for -Colorability of Small Diameter Graphs (Journal article)

    Mertzios, G. B., & Spirakis, P. G. (2016). Algorithms and Almost Tight Results for -Colorability of Small Diameter Graphs. ALGORITHMICA, 74(1), 385-414. doi:10.1007/s00453-014-9949-6

    DOI: 10.1007/s00453-014-9949-6

    Connectivity Preserving Network Transformers (Conference Paper)

    Michail, O., & Spirakis. (n.d.). Connectivity Preserving Network Transformers. In Emergence, Complexity and Computation Vol. 24 (pp. 337-359).

    Deterministic population protocols for exact majority and plurality (Conference Paper)

    Gasieniec, L., Hamilton, D., Martin, R., Spirakis, P. G., & Stachowiak, G. (2017). Deterministic population protocols for exact majority and plurality. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 70 (pp. 14.1-14.14). doi:10.4230/LIPIcs.OPODIS.2016.14

    DOI: 10.4230/LIPIcs.OPODIS.2016.14

    Ephemeral networks with random availability of links: The case of fast networks (Journal article)

    Akrida, E. C., Gasieniec, L., Mertzios, G. B., & Spirakis, P. G. (2016). Ephemeral networks with random availability of links: The case of fast networks. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 87, 109-120. doi:10.1016/j.jpdc.2015.10.002

    DOI: 10.1016/j.jpdc.2015.10.002

    Flows in Temporal networks. (Journal article)

    Akrida, E. C., Czyzowicz, J., Gasieniec, L., Kuszner, L., & Spirakis, P. G. (2016). Flows in Temporal networks.. CoRR, abs/1606.01091.

    How Many Cooks Spoil the Soup? (Conference Paper)

    Michail, O., & Spirakis, P. G. (2016). How Many Cooks Spoil the Soup?. In Structural Information and Communication Complexity, SIROCCO 2016 Vol. 9988 (pp. 3-18). doi:10.1007/978-3-319-48314-6_1

    DOI: 10.1007/978-3-319-48314-6_1

    Lipschitz Continuity and Approximate Equilibria (Journal article)

    Deligkas, A., Fearnley, J., & Spirakis, P. (2016). Lipschitz Continuity and Approximate Equilibria. ALGORITHMIC GAME THEORY, SAGT 2016, 9928, 15-26. doi:10.1007/978-3-662-53354-3_2

    DOI: 10.1007/978-3-662-53354-3_2

    On the Complexity of Weighted Greedy Matchings (Journal article)

    Deligkas, A., Mertzios, G. B., & Spirakis, P. G. (n.d.). On the Complexity of Weighted Greedy Matchings. Retrieved from http://arxiv.org/abs/1602.05909v2

    Simple and efficient local codes for distributed stable network construction (Journal article)

    Michail, O., & Spirakis, P. G. (2016). Simple and efficient local codes for distributed stable network construction. DISTRIBUTED COMPUTING, 29(3), 207-237. doi:10.1007/s00446-015-0257-1

    DOI: 10.1007/s00446-015-0257-1

    Stably computing order statistics with arithmetic population protocols (Conference Paper)

    Mertzios, G. B., Nikoletseas, S. E., Raptopoulos, C. L., & Spirakis, P. G. (2016). Stably computing order statistics with arithmetic population protocols. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 58. doi:10.4230/LIPIcs.MFCS.2016.68

    DOI: 10.4230/LIPIcs.MFCS.2016.68

    Strategic Contention Resolution with Limited Feedback (Conference Paper)

    Christodoulou, G., Gairing, M., Nikoletseas, S., Raptopoulos, C., & Spirakis, P. (n.d.). Strategic Contention Resolution with Limited Feedback. Retrieved from http://arxiv.org/abs/1606.06580v1

    Strategic Contention Resolution with Limited Feedback. (Conference Paper)

    Christodoulou, G., Gairing, M., Nikoletseas, S. E., Raptopoulos, C., & Spirakis, P. G. (2016). Strategic Contention Resolution with Limited Feedback.. In P. Sankowski, & C. D. Zaroliagis (Eds.), ESA Vol. 57 (pp. 30:1). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. Retrieved from http://drops.dagstuhl.de/opus/portals/lipics/index.php?semnr=16013

    Temporal Graphs (Thesis / Dissertation)

    Akrida, E. (2016, November 15). Temporal Graphs.

    Traveling salesman problems in temporal graphs (Journal article)

    Michail, O., & Spirakis, P. G. (2016). Traveling salesman problems in temporal graphs. THEORETICAL COMPUTER SCIENCE, 634, 1-23. doi:10.1016/j.tcs.2016.04.006

    DOI: 10.1016/j.tcs.2016.04.006

    2015

    Designing and Testing Temporally Connected Graphs. (Journal article)

    Akrida, E. C., Gasieniec, L., Mertzios, G. B., & Spirakis, P. G. (2015). Designing and Testing Temporally Connected Graphs.. CoRR, abs/1502.04579.

    NETCS: A New Simulator of Population Protocols and Network Constructors (Journal article)

    Amaxilatis, D., Logaras, M., Michail, O., & Spirakis, P. G. (n.d.). NETCS: A New Simulator of Population Protocols and Network Constructors. Retrieved from http://arxiv.org/abs/1508.06731v1

    On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols (Conference Paper)

    Czyzowicz, J., Gasieniec, L., Kosowski, A., Kranakis, E., Spirakis, P. G., & Uznanski, P. (2015). On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols. In Automata, Languages, and Programming, Pt I Vol. 9134 (pp. 393-405). doi:10.1007/978-3-662-47672-7_32

    DOI: 10.1007/978-3-662-47672-7_32

    On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols. (Conference Paper)

    Czyzowicz, J., Gasieniec, L., Kosowski, A., Kranakis, E., Spirakis, P. G., & Uznanski, P. (2015). On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols.. In M. M. Halldórsson, K. Iwama, N. Kobayashi, & B. Speckmann (Eds.), ICALP (1) Vol. 9134 (pp. 393-405). Springer. Retrieved from https://doi.org/10.1007/978-3-662-47672-7

    On Equilibrium Computation in Biased Games with Quadratic Penalties. (Journal article)

    Deligkas, A., & Spirakis, P. G. (2015). On Equilibrium Computation in Biased Games with Quadratic Penalties.. CoRR, abs/1509.02023.

    On Temporally Connected Graphs of Small Cost (Conference Paper)

    Akrida, E. C., Gasieniec, L., Mertzios, G. B., & Spirakis, P. G. (2015). On Temporally Connected Graphs of Small Cost. In APPROXIMATION AND ONLINE ALGORITHMS, WAOA 2015 Vol. 9499 (pp. 84-96). doi:10.1007/978-3-319-28684-6_8

    DOI: 10.1007/978-3-319-28684-6_8

    On the structure of equilibria in basic network formation (Journal article)

    Nikoletseas, S., Panagopoulou, P., Raptopoulos, C., & Spirakis, P. G. (2015). On the structure of equilibria in basic network formation. THEORETICAL COMPUTER SCIENCE, 590, 96-105. doi:10.1016/j.tcs.2015.03.029

    DOI: 10.1016/j.tcs.2015.03.029

    On verifying and maintaining connectivity of interval temporal networks (Conference Paper)

    Akrida, E. C., & Spirakis, P. G. (2015). On verifying and maintaining connectivity of interval temporal networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 9536 (pp. 142-154). doi:10.1007/978-3-319-28472-9_11

    DOI: 10.1007/978-3-319-28472-9_11

    Rationality authority for provable rational behavior (Conference Paper)

    Dolev, S., Panagopoulou, P. N., Rabie, M., Schiller, E. M., & Spirakis, P. G. (2015). Rationality authority for provable rational behavior. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 9295 (pp. 33-48). doi:10.1007/978-3-319-24024-4_5

    DOI: 10.1007/978-3-319-24024-4_5

    Simple and efficient local codes for distributed stable network construction (Journal article)

    Michail, O., & Spirakis, P. G. (2016). Simple and efficient local codes for distributed stable network construction. Distributed Computing, 29(3), 207-237. doi:10.1007/s00446-015-0257-4

    DOI: 10.1007/s00446-015-0257-4

    Terminating population protocols via some minimal global knowledge assumptions (Journal article)

    Michail, O., & Spirakis, P. G. (2015). Terminating population protocols via some minimal global knowledge assumptions. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 81-82, 1-10. doi:10.1016/j.jpdc.2015.02.005

    DOI: 10.1016/j.jpdc.2015.02.005

    The match-maker: Constant-space distributed majority via random walks (Conference Paper)

    Gąsieniec, L., Hamilton, D. D., Martin, R., & Spirakis, P. G. (2015). The match-maker: Constant-space distributed majority via random walks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 9212 (pp. 67-80). doi:10.1007/978-3-319-21741-3_5

    DOI: 10.1007/978-3-319-21741-3_5

    2014

    Approximating Fixation Probabilities in the Generalized Moran Process (Journal article)

    Diaz, J., Goldberg, L. A., Mertzios, G. B., Richerby, D., Serna, M., & Spirakis, P. G. (2014). Approximating Fixation Probabilities in the Generalized Moran Process. ALGORITHMICA, 69(1), 78-91. doi:10.1007/s00453-012-9722-7

    DOI: 10.1007/s00453-012-9722-7

    Causality, influence, and computation in possibly disconnected synchronous dynamic networks (Journal article)

    Michail, O., Chatzigiannakis, I., & Spirakis, P. G. (2014). Causality, influence, and computation in possibly disconnected synchronous dynamic networks. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 74(1), 2016-2026. doi:10.1016/j.jpdc.2013.07.007

    DOI: 10.1016/j.jpdc.2013.07.007

    Computing Approximate Nash Equilibria in Polymatrix Games (Conference Paper)

    Deligkas, A., Fearnley, J., Savani, R., & Spirakis, P. (2014). Computing Approximate Nash Equilibria in Polymatrix Games. In WEB AND INTERNET ECONOMICS Vol. 8877 (pp. 58-71). Retrieved from http://gateway.webofknowledge.com/

    Computing Approximate Nash Equilibria in Polymatrix Games (Journal article)

    Deligkas, A., Fearnley, J., Savani, R., & Spirakis, P. (2017). Computing Approximate Nash Equilibria in Polymatrix Games. ALGORITHMICA, 77(2), 487-514. doi:10.1007/s00453-015-0078-7

    DOI: 10.1007/s00453-015-0078-7

    Determining Majority in Networks with Local Interactions and Very Small Local Memory (Conference Paper)

    Mertzios, G. B., Nikoletseas, S. E., Raptopoulos, C. L., & Spirakis, P. G. (2014). Determining Majority in Networks with Local Interactions and Very Small Local Memory. In AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP 2014), PT I Vol. 8572 (pp. 871-882). Retrieved from http://gateway.webofknowledge.com/

    Ephemeral networks with random availability of links: Diameter and connectivity (Conference Paper)

    Akrida, E. C., Mertzios, G. B., Ga̧sieniec, L., & Spirakis, P. G. (2014). Ephemeral networks with random availability of links: Diameter and connectivity. In Annual ACM Symposium on Parallelism in Algorithms and Architectures (pp. 267-276). doi:10.1145/2612669.2612693

    DOI: 10.1145/2612669.2612693

    Information security for sensors by overwhelming random sequences and permutations (Journal article)

    Dolev, S., Gilboa, N., Kopeetsky, M., Persiano, G., & Spirakis, P. G. (2014). Information security for sensors by overwhelming random sequences and permutations. AD HOC NETWORKS, 12, 193-200. doi:10.1016/j.adhoc.2011.09.002

    DOI: 10.1016/j.adhoc.2011.09.002

    On the hardness of network design for bottleneck routing games (Journal article)

    Fotakis, D., Kaporis, A. C., Lianeas, T., & Spirakis, P. G. (2014). On the hardness of network design for bottleneck routing games. THEORETICAL COMPUTER SCIENCE, 521, 107-122. doi:10.1016/j.tcs.2013.11.035

    DOI: 10.1016/j.tcs.2013.11.035

    Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof) (Journal article)

    Panagopoulou, P. N., & Spirakis, P. G. (2014). Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof). THEORY OF COMPUTING SYSTEMS, 54(3), 479-490. doi:10.1007/s00224-013-9446-3

    DOI: 10.1007/s00224-013-9446-3

    Simple and Efficient Local Codes for Distributed Stable Network Construction (Conference Paper)

    Michail, O., & Spirakis, P. G. (n.d.). Simple and Efficient Local Codes for Distributed Stable Network Construction. Retrieved from http://arxiv.org/abs/1309.6978v2

    Traveling Salesman Problems in Temporal Graphs (Conference Paper)

    Michail, O., & Spirakis, P. G. (2014). Traveling Salesman Problems in Temporal Graphs. In MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE, PT II Vol. 8635 (pp. 553-564). Retrieved from http://gateway.webofknowledge.com/

    2013

    Moving in temporal graphs with very sparse random availability of edges (Journal article)

    Spirakis, P. G., & Akrida, E. C. (n.d.). Moving in temporal graphs with very sparse random availability of edges. Retrieved from http://arxiv.org/abs/1310.7898v1

    2010

    Passively Mobile Communicating Logarithmic Space Machines (Journal article)

    Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A., & Spirakis, P. G. (n.d.). Passively Mobile Communicating Logarithmic Space Machines. Retrieved from http://arxiv.org/abs/1004.3395v1

    2009

    On the Performance of Approximate Equilibria in Congestion Games. (Conference Paper)

    Christodoulou, G., Koutsoupias, E., & Spirakis, P. G. (2009). On the Performance of Approximate Equilibria in Congestion Games.. In ESA (pp. 251-262). Copenhagen: Springer.

    2008

    Random sampling of colourings of sparse random graphs with a constant number of colours (Journal article)

    Efthymiou, C., & Spirakis, P. G. (n.d.). Random sampling of colourings of sparse random graphs with a constant number of colours. doi:10.1016/j.tcs.2008.05.008

    DOI: 10.1016/j.tcs.2008.05.008

    Untitled Document