2023
Drousiotis, E., Phillips, A. M., Spirakis, P. G., & Maskell, S. (2023). Bayesian Decision Trees Inspired from Evolutionary Algorithms. In Unknown Conference (pp. 318-331). Springer International Publishing. doi:10.1007/978-3-031-44505-7_22DOI: 10.1007/978-3-031-44505-7_22
Klobas, N., Mertzios, G. B., & Spirakis, P. G. (2023). Sliding into the Future: Investigating Sliding Windows in Temporal Graphs. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 272. doi:10.4230/LIPIcs.MFCS.2023.5DOI: 10.4230/LIPIcs.MFCS.2023.5
Adamson, D., Gusev, V. V., Deligkas, A., Antypov, D., Collins, C. M., Krysta, P., . . . Rosseinsky, M. J. (2023). Optimality Guarantees for Crystal Structure Prediction. Nature. doi:10.1038/s41586-023-06071-yDOI: 10.1038/s41586-023-06071-y
Michail, O., Spirakis, P. G., & Theofilatos, M. (2023). Fault tolerant network constructors. Information and Computation, 292, 105037. doi:10.1016/j.ic.2023.105037DOI: 10.1016/j.ic.2023.105037
Michail, O., Spirakis, P. G., & Theofilatos, M. (2023). Fault tolerant network constructors. In INFORMATION AND COMPUTATION Vol. 292. doi:10.1016/j.ic.2023.105037DOI: 10.1016/j.ic.2023.105037
Drousiotis, E., Joyce, D. W., Dempsey, R. C., Haines, A., Spirakis, P. G., Shi, L., & Maskell, S. (2023). Probabilistic Decision Trees for Predicting 12-Month University Students Likely to Experience Suicidal Ideation. In Unknown Conference (pp. 475-487). Springer Nature Switzerland. doi:10.1007/978-3-031-34111-3_40DOI: 10.1007/978-3-031-34111-3_40
Spirakis, P. G., Nikoletseas, S., & Raptopoulos, C. (2023). Selected Combinatorial Problems Through the Prism of Random Intersection Graphs Models. In Unknown Conference (pp. 1-4). Springer International Publishing. doi:10.1007/978-3-031-30448-4_28DOI: 10.1007/978-3-031-30448-4_28
Gąsieniec, L., Spirakis, P. G., & Stachowiak, G. (2023). New Clocks, Optimal Line Formation and Self-Replication Population Protocols. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 254. doi:10.4230/LIPIcs.STACS.2023.33DOI: 10.4230/LIPIcs.STACS.2023.33
Kipouridis, E., Spirakis, P. G., & Tsichlas, K. (2023). Threshold-based network structural dynamics. Theoretical Computer Science, 944, 113669. doi:10.1016/j.tcs.2022.12.019DOI: 10.1016/j.tcs.2022.12.019
Christodoulou, F., Nikoletseas, S., Raptopoulos, C., & Spirakis, P. G. (2023). A Spectral Algorithm for Finding Maximum Cliques in Dense Random Intersection Graphs. In SOFSEM 2023: THEORY AND PRACTICE OF COMPUTER SCIENCE Vol. 13878 (pp. 18-32). doi:10.1007/978-3-031-23101-8_2DOI: 10.1007/978-3-031-23101-8_2
GestureSet: Public Domain Dataset for Human Gesture Recognition using Wrist-worn Devices: A Preliminary Version (Conference Paper)
Tzamalis, P., Nikoletseas, S., & Spirakis, P. G. (2023). GestureSet: Public Domain Dataset for Human Gesture Recognition using Wrist-worn Devices: A Preliminary Version. In 2023 19th International Conference on Distributed Computing in Smart Systems and the Internet of Things (DCOSS-IoT). IEEE. doi:10.1109/dcoss-iot58021.2023.00071DOI: 10.1109/dcoss-iot58021.2023.00071
On the structural and combinatorial properties in 2-swap word permutation graphs. (Journal article)
Adamson, D., Flaherty, N., Potapov, I., & Spirakis, P. G. (2023). On the structural and combinatorial properties in 2-swap word permutation graphs.. CoRR, abs/2307.01648.
Zamaraeva, E., Collins, C. M., Antypov, D., Gusev, V. V., Savani, R., Dyer, M. S., . . . Spirakis, P. G. (n.d.). Reinforcement Learning in Crystal Structure Prediction. Digital Discovery. doi:10.1039/d3dd00063jDOI: 10.1039/d3dd00063j
Drousiotis, E., & Spirakis, P. (2023). Single MCMC chain parallelisation on decision trees. ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE. doi:10.1007/s10472-023-09876-9DOI: 10.1007/s10472-023-09876-9
Mavronicolas, M., & Spirakis, P. G. (2023). The Contest Game for Crowdsourcing Reviews. In Unknown Conference (pp. 71-89). Springer Nature Switzerland. doi:10.1007/978-3-031-43254-5_5DOI: 10.1007/978-3-031-43254-5_5
2022
Spirakis, P., Czyzowicz, J., Gasieniec, L., Kosowski, A., Kranakis, E., & Uznanski, P. (n.d.). On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols. Journal of Computer and System Sciences. doi:10.1016/j.jcss.2022.06.002DOI: 10.1016/j.jcss.2022.06.002
Gąsieniec, L., Spirakis, P., & Stachowiak, G. (2022). Brief Announcement: New Clocks, Fast Line Formation and Self-Replication Population Protocols. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 246. doi:10.4230/LIPIcs.DISC.2022.44DOI: 10.4230/LIPIcs.DISC.2022.44
Klobas, N., Mertzios, G. B., Molter, H., & Spirakis, P. G. (2022). The Complexity of Computing Optimum Labelings for Temporal Connectivity. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 241. doi:10.4230/LIPIcs.MFCS.2022.62DOI: 10.4230/LIPIcs.MFCS.2022.62
Hamm, T., Klobas, N., Mertzios, G. B., & Spirakis, P. G. (2022). The Complexity of Temporal Vertex Cover in Small-Degree Graphs. In THIRTY-SIXTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FOURTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE / TWELVETH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE (pp. 10193-10201). Retrieved from https://www.webofscience.com/
Drousiotis, E., Shi, L., Spirakis, P., & Maskell, S. (2022). Novel Decision Forest Building Techniques by Utilising Correlation Coefficient Methods. In Engineering Applications of Neural Networks.
Deligkas, A., Fearnley, J., Melissourgos, T., & Spirakis, P. G. (2022). Approximating the existential theory of the reals. Journal of Computer and System Sciences, 125, 106-128. doi:10.1016/j.jcss.2021.11.002DOI: 10.1016/j.jcss.2021.11.002
Simple and fast approximate counting and leader election in populations (Journal article)
Michail, O., Spirakis, P. G., & Theofilatos, M. (2022). Simple and fast approximate counting and leader election in populations. INFORMATION AND COMPUTATION, 285. doi:10.1016/j.ic.2021.104698DOI: 10.1016/j.ic.2021.104698
Distributed Computation and Reconfiguration in Actively Dynamic Networks (Journal article)
Michail, O., Skretas, G., & Spirakis, P. (2022). Distributed Computation and Reconfiguration in Actively Dynamic Networks. Distributed Computing. doi:10.1007/s00446-021-00415-5DOI: 10.1007/s00446-021-00415-5
Melissourgos, T., Nikoletseas, S. E., Raptopoulos, C. L., & Spirakis, P. G. (2022). An extension of the Moran process using type-specific connection graphs. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 124, 77-96. doi:10.1016/j.jcss.2021.07.007DOI: 10.1016/j.jcss.2021.07.007
Filios, G., Kyriakopoulos, A., Livanios, S., Manolopoulos, F., Nikoletseas, S., Panagiotou, S. H., & Spirakis, P. (2022). Data-driven soft sensing towards quality monitoring of industrial pasteurization processes. In 2022 18th International Conference on Distributed Computing in Sensor Systems (DCOSS). IEEE. doi:10.1109/dcoss54816.2022.00039DOI: 10.1109/dcoss54816.2022.00039
Drousiotis, E., & Spirakis, P. G. (2022). Single MCMC Chain Parallelisation on Decision Trees. In Unknown Conference (pp. 191-204). Springer International Publishing. doi:10.1007/978-3-031-24866-5_15DOI: 10.1007/978-3-031-24866-5_15
Mertzios, G. B., Michail, O., Skretas, G., Spirakis, P. G., & Theofilatos, M. (2022). The Complexity of Growing a Graph. In ALGORITHMICS OF WIRELESS NETWORKS, ALGOSENSORS 2022 Vol. 13707 (pp. 123-137). doi:10.1007/978-3-031-22050-0_9DOI: 10.1007/978-3-031-22050-0_9
2021
Varsi, A., Maskell, S., & Spirakis, P. G. (n.d.). An O(log2N) Fully-Balanced Resampling Algorithm for Particle Filters on Distributed Memory Architectures. Algorithms, 14(12), 342. doi:10.3390/a14120342DOI: 10.3390/a14120342
ASPIDA: An Observatory for Security and Privacy in the Greek e-Business Sector (Conference Paper)
Vlachos, V., Katevas, G., Katsidimas, I., Kerimakis, E., Nikoletseas, S., Panagiotou, S., & Spirakis, P. (2021). ASPIDA: An Observatory for Security and Privacy in the Greek e-Business Sector. In 25TH PAN-HELLENIC CONFERENCE ON INFORMATICS WITH INTERNATIONAL PARTICIPATION (PCI2021) (pp. 362-368). doi:10.1145/3503823.3503890DOI: 10.1145/3503823.3503890
ASPIDA: A client-oriented platform for assessing websites security practices adoption and reward (Conference Paper)
Vlachos, V., Katsidimas, I., Kerimakis, E., Nikoletseas, S., Panagiotou, S., & Spirakis, P. (2021). ASPIDA: A client-oriented platform for assessing websites security practices adoption and reward. In 2021 29TH TELECOMMUNICATIONS FORUM (TELFOR). doi:10.1109/TELFOR52709.2021.9653275DOI: 10.1109/TELFOR52709.2021.9653275
Akrida, E. C., Deligkas, A., Melissourgos, T., & Spirakis, P. G. (2021). Connected Subgraph Defense Games. ALGORITHMICA, 83(11), 3403-3431. doi:10.1007/s00453-021-00858-zDOI: 10.1007/s00453-021-00858-z
Akrida, E. C., Mertzios, G. B., Spirakis, P. G., & Raptopoulos, C. (2021). The temporal explorer who returns to the base. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 120, 179-193. doi:10.1016/j.jcss.2021.04.001DOI: 10.1016/j.jcss.2021.04.001
Mertzios, G. B., Molter, H., Renken, M., Spirakis, P. G., & Zschoche, P. (2021). The Complexity of Transitively Orienting Temporal Graphs. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 202. doi:10.4230/LIPIcs.MFCS.2021.75DOI: 10.4230/LIPIcs.MFCS.2021.75
Connor, M., Michail, O., & Spirakis, P. (n.d.). On the Distributed Construction of Stable Networks in Polylogarithmic Parallel Time. Information, 12(6), 254. doi:10.3390/info12060254DOI: 10.3390/info12060254
Computing exact solutions of consensus halving and the Borsuk-Ulam theorem (Conference Paper)
Deligkas, A., Fearnley, J., Melissourgos, T., & Spirakis, P. G. (2021). Computing exact solutions of consensus halving and the Borsuk-Ulam theorem. In JOURNAL OF COMPUTER AND SYSTEM SCIENCES Vol. 117 (pp. 75-98). doi:10.1016/j.jcss.2020.10.006DOI: 10.1016/j.jcss.2020.10.006
Mavronicolas, M., Michael, L., Papadopoulou Lesta, V., Persiano, G., Philippou, A., & Spirakis, P. G. (n.d.). The Price of Defense. Algorithmica. doi:10.1007/s00453-020-00783-7DOI: 10.1007/s00453-020-00783-7
Nikoletseas, S. E., Raptopoulos, C. L., & Spirakis, P. G. (2021). Maximum cliques in graphs with small intersection number and random intersection graphs. COMPUTER SCIENCE REVIEW, 39. doi:10.1016/j.cosrev.2020.100353DOI: 10.1016/j.cosrev.2020.100353
Bardoutsos, A., Matzarapis, G., Nikoletseas, S., Spirakis, P. G., & Tzamalis, P. (2021). A Complementary Sensing Platform for a holistic approach to Allergic Rhinitis monitoring. In 17TH ANNUAL INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING IN SENSOR SYSTEMS (DCOSS 2021) (pp. 171-180). doi:10.1109/DCOSS52077.2021.00039DOI: 10.1109/DCOSS52077.2021.00039
Bardoutsos, A., Markantonatos, D., Nikoletseas, S., Spirakis, P. G., & Tzamalis, P. (2021). A human-centered Web-based tool for the effective real-time motion data collection and annotation from BLE IoT devices. In 17TH ANNUAL INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING IN SENSOR SYSTEMS (DCOSS 2021) (pp. 380-389). doi:10.1109/DCOSS52077.2021.00067DOI: 10.1109/DCOSS52077.2021.00067
New Clocks, Optimal Line Formation and Efficient Replication Population Protocols (Making Population Protocols Alive). (Journal article)
Gasieniec, L., Spirakis, P. G., & Stachowiak, G. (2021). New Clocks, Optimal Line Formation and Efficient Replication Population Protocols (Making Population Protocols Alive).. CoRR, abs/2111.10822.
Kipouridis, E., Spirakis, P. G., & Tsichlas, K. (2021). Threshold-Based Network Structural Dynamics. In Unknown Conference (pp. 127-145). Springer International Publishing. doi:10.1007/978-3-030-79527-6_8DOI: 10.1007/978-3-030-79527-6_8
Deligkas, A., Melissourgos, T., & Spirakis, P. G. (2021). Walrasian equilibria in markets with small demands. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS Vol. 1 (pp. 413-419).
2020
Akrida, E. C., Mertzios, G. B., Nikoletseas, S., Raptopoulos, C., Spirakis, P. G., & Zamaraev, V. (2020). How fast can we reach a target vertex in stochastic temporal graphs?. Journal of Computer and System Sciences, 114, 65-83. doi:10.1016/j.jcss.2020.05.005DOI: 10.1016/j.jcss.2020.05.005
Deligkas, A., Fearnley, J., & Spirakis, P. (2020). Lipschitz Continuity and Approximate Equilibria. In ALGORITHMICA Vol. 82 (pp. 2927-2954). doi:10.1007/s00453-020-00709-3DOI: 10.1007/s00453-020-00709-3
Michail, O., Spirakis, P. G., & Theofilatos, M. (n.d.). Gathering in 1-Interval Connected Graphs. Retrieved from http://arxiv.org/abs/2008.07455v1
Michail, O., Spirakis, P. G., & Theofilatos, M. (2021). Beyond Rings: Gathering in 1-Interval Connected Graphs. PARALLEL PROCESSING LETTERS, 31(04). doi:10.1142/S0129626421500201DOI: 10.1142/S0129626421500201
Distributed Computation and Reconfiguration in Actively Dynamic Networks (Conference Paper)
Michail, O., Skretas, G., & Spirakis, P. (2020). Distributed Computation and Reconfiguration in Actively Dynamic Networks. In PODC '20: Proceedings of the 39th Symposium on Principles of Distributed Computing (pp. 448-457). doi:10.1145/3382734.3405744DOI: 10.1145/3382734.3405744
Antypov, D., Deligkas, A., Gusev, V., Rosseinsky, M. J., Spirakis, P. G., & Theofilatos, M. (2020). Crystal Structure Prediction via Oblivious Local Search. 18th Symposium on Experimental Algorithms (SEA 2020), 160, 21:1-21:14. doi:10.4230/LIPIcs.SEA.2020.21DOI: 10.4230/LIPIcs.SEA.2020.21
Akrida, E. C., Deligkas, A., Mertzios, G. B., Spirakis, P. G., & Zamaraev, V. (2020). Matching in Stochastically Evolving Graphs. Retrieved from http://arxiv.org/abs/2005.08263v1
Deligkas, A., Mertzios, G. B., Spirakis, P. G., & Zamaraev, V. (2020). Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. Retrieved from http://arxiv.org/abs/2004.06036v2
Temporal Vertex Cover with a Sliding Time Window (Journal article)
Akrida, E., Mertzios, G. B., Spirakis, P., & Zamaraev, V. (2020). Temporal Vertex Cover with a Sliding Time Window. Journal of Computer and System Sciences, 107, 108-123. doi:10.1016/j.jcss.2019.08.002DOI: 10.1016/j.jcss.2019.08.002
Crystal Structure Prediction via Oblivious Local Search. (Conference Paper)
Antypov, D., Deligkas, A., Gusev, V. V., Rosseinsky, M. J., Spirakis, P. G., & Theofilatos, M. (2020). Crystal Structure Prediction via Oblivious Local Search.. In S. Faro, & D. Cantone (Eds.), SEA Vol. 160 (pp. 21:1). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Retrieved from https://www.dagstuhl.de/dagpub/978-3-95977-148-1
Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. (Conference Paper)
Deligkas, A., Mertzios, G. B., Spirakis, P. G., & Zamaraev, V. (2020). Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle.. In J. Esparza, & D. Král' (Eds.), MFCS Vol. 170 (pp. 27:1). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Retrieved from https://www.dagstuhl.de/dagpub/978-3-95977-159-7
2019
Michail, O., Spirakis, P. G., & Theofilatos, M. (2019). Fault Tolerant Network Constructors. Lecture Notes in Computer Science. Retrieved from http://arxiv.org/abs/1903.05992v2
Akrida, E. C., Deligkas, A., Melissourgos, T., & Spirakis, P. G. (2019). Connected Subgraph Defense Games. In Algorithmic Game Theory. Retrieved from http://arxiv.org/abs/1906.02774v1
Akrida, E., & Spirakis, P. (2019). On Verifying and Maintaining Connectivity of Interval Temporal Networks. Parallel Processing Letters. doi:10.1142/S0129626419500099DOI: 10.1142/S0129626419500099
Akrida, E., Czyzowicz, J., Gasieniec, L., Kuszner, L., & Spirakis, P. (2019). Temporal flows in Temporal networks. Journal of Computer and System Sciences, 103, 46-60. doi:10.1016/j.jcss.2019.02.003DOI: 10.1016/j.jcss.2019.02.003
Akrida, E. C., Czyzowicz, J., Gasieniec, L., Kuszner, L., & Spirakis, P. G. (2019). Temporal flows in temporal networks. In JOURNAL OF COMPUTER AND SYSTEM SCIENCES Vol. 103 (pp. 46-60). doi:10.1016/j.jcss.2019.02.003DOI: 10.1016/j.jcss.2019.02.003
Michail, O., Skretas, G., & Spirakis, P. G. (2019). On the Transformation Capability of Feasible Mechanisms for Programmable Matter. Journal of Computer and System Sciences, 102, 18-39. doi:10.1016/j.jcss.2018.12.001DOI: 10.1016/j.jcss.2018.12.001
Akrida, E. C., Mertzios, G. B., & Spirakis, P. G. (2019). The temporal explorer who returns to the base. International Conference on Algorithms and Complexity (CIAC). Retrieved from http://arxiv.org/abs/1805.04713v1
Mertzios, G., Michail, O., & Spirakis, P. (2019). Temporal Network Optimization Subject to Connectivity Constraints. Algorithmica: an international journal in computer science, 81, 1416-1449. doi:10.1007/s00453-018-0478-6DOI: 10.1007/s00453-018-0478-6
Akrida, E. C., Mertzios, G. B., Nikoletseas, S., Raptopoulos, C., Spirakis, P. G., & Zamaraev, V. (2019). How fast can we reach a target vertex in stochastic temporal graphs?. Retrieved from http://arxiv.org/abs/1903.03636v1
Deligkas, A., Fearnley, J., Melissourgos, T., & Spirakis, P. G. (2019). Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem. Retrieved from http://arxiv.org/abs/1903.03101v2
Binary Search in Graphs Revisited. (Journal article)
Deligkas, A., Mertzios, G. B., & Spirakis, P. G. (2019). Binary Search in Graphs Revisited.. Algorithmica, 81, 1757-1780. doi:10.1007/s00453-018-0501-yDOI: 10.1007/s00453-018-0501-y
Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem. (Conference Paper)
Deligkas, A., Fearnley, J., Melissourgos, T., & Spirakis, P. G. (2019). Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem.. In C. Baier, I. Chatzigiannakis, P. Flocchini, & S. Leonardi (Eds.), ICALP Vol. 132 (pp. 138:1). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Retrieved from http://www.dagstuhl.de/dagpub/978-3-95977-109-2
Data-Driven Intrusion Detection for Ambient Intelligence (Conference Paper)
Chatzigiannakis, I., Maiano, L., Trakadas, P., Anagnostopoulos, A., Bacci, F., Karkazis, P., . . . Zahariadis, T. (2019). Data-Driven Intrusion Detection for Ambient Intelligence. In AMBIENT INTELLIGENCE (AMI 2019) Vol. 11912 (pp. 235-251). doi:10.1007/978-3-030-34255-5_16DOI: 10.1007/978-3-030-34255-5_16
On the transformation capability of feasible mechanisms for programmable matter. (Journal article)
Michail, O., Skretas, G., & Spirakis, P. G. (2019). On the transformation capability of feasible mechanisms for programmable matter.. J. Comput. Syst. Sci., 102, 18-39.
The Price of Stability of Weighted Congestion Games (Journal article)
Christodoulou, G., Gairing, M., Giannakopoulos, Y., & Spirakis, P. G. (2019). The Price of Stability of Weighted Congestion Games. SIAM Journal on Computing, 48(5), 1544-1582. doi:10.1137/18M1207880DOI: 10.1137/18M1207880
2018
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-zDOI: 10.1007/s00446-017-0317-z
Mertzios, G., & 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.004DOI: 10.1016/j.jcss.2018.04.004
Michail, O., Spirakis, P. G., & Theofilatos, M. (2018). Simple and Fast Approximate Counting and Leader Election in Populations. In Springer LNCS. Tokyo, Japan..
Christodoulou, G., Melissourgos, T., & Spirakis, P. G. (2018). Strategic Contention Resolution in Multiple Channels. In APPROXIMATION AND ONLINE ALGORITHMS (WAOA 2018) Vol. 11312 (pp. 165-180). doi:10.1007/978-3-030-04693-4_11DOI: 10.1007/978-3-030-04693-4_11
Deligkas, A., Fearnley, J., Melissourgos, T., & Spirakis, P. G. (2018). Approximating the Existential Theory of the Reals. In WEB AND INTERNET ECONOMICS, WINE 2018 Vol. 11316 (pp. 126-139). doi:10.1007/978-3-030-04612-5_9DOI: 10.1007/978-3-030-04612-5_9
Lamprou, I., Martin, R., & Spirakis, P. G. (2018). Cover Time in Edge-Uniform Stochastically-Evolving Graphs. Algorithms, 11(10). doi:10.3390/a11100149DOI: 10.3390/a11100149
Doty, D., Eftekhari, M., Michail, O., Spirakis, P. G., & Theofilatos, M. (2018). Brief announcement: Exact size counting in uniform population protocols in nearly logarithmic time. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 121. doi:10.4230/LIPIcs.DISC.2018.46DOI: 10.4230/LIPIcs.DISC.2018.46
Lamprou, I., Martin, R., & Spirakis, P. (2018). Cover Time in Edge-Uniform Stochastically-Evolving Graphs. In ALGORITHMS Vol. 11. doi:10.3390/a11100149DOI: 10.3390/a11100149
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.
Preface (Conference Paper)
Potapov, I., Spirakis, P., & Worrell, J. (2018). Preface. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 117. doi:10.4230/LIPIcs.MFCS.2018.0DOI: 10.4230/LIPIcs.MFCS.2018.0
Christodoulou, G., Gairing, M., Giannakopoulos, Y., & Spirakis, P. G. (2018). The Price of Stability of Weighted Congestion Games. In LIPIcs : Leibniz International Proceedings in Informatics Vol. 107 (pp. 150:1-150:16). Prague: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik. doi:10.4230/LIPIcs.ICALP.2018.150DOI: 10.4230/LIPIcs.ICALP.2018.150
Michail, O., Spirakis, P. G., & Theofilatos, M. (2018). Fast Approximate Counting and Leader Election in Populations. Retrieved from http://arxiv.org/abs/1806.02638v1
Doty, D., Eftekhari, M., Michail, O., Spirakis, P. G., & Theofilatos, M. (2018). Exact size counting in uniform population protocols in nearly logarithmic time. Retrieved from http://arxiv.org/abs/1805.04832v1
Melissourgos, T., Nikoletseas, S. E., Raptopoulos, C. L., & 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
Akrida, E. C., Mertzios, G. B., Spirakis, P. G., & Zamaraev, V. (2018). Temporal Vertex Cover with a Sliding Time Window. Retrieved from http://arxiv.org/abs/1802.07103v3
Spirakis, P. G., & Michail, O. (2018). Communications of ACM (CACM). Communications of the ACM.
Michail, O., & Spirakis, P. G. (2018). Elements of the Theory of Dynamic Networks. COMMUNICATIONS OF THE ACM, 61(2), 72-81. doi:10.1145/3156693DOI: 10.1145/3156693
Approximating the Existential Theory of the Reals. (Conference Paper)
Deligkas, A., Fearnley, J., Melissourgos, T., & Spirakis, P. G. (2018). Approximating the Existential Theory of the Reals.. In G. Christodoulou, & T. Harks (Eds.), WINE Vol. 11316 (pp. 126-139). Springer. Retrieved from https://doi.org/10.1007/978-3-030-04612-5
Chatzigiannakis, I., Liagkou, V., & Spirakis, P. G. (2018). Brief Announcement: Providing End-to-End Secure Communication in Low-Power Wide Area Networks. In CYBER SECURITY CRYPTOGRAPHY AND MACHINE LEARNING, CSCML 2018 Vol. 10879 (pp. 101-104). doi:10.1007/978-3-319-94147-9_8DOI: 10.1007/978-3-319-94147-9_8
Michail, O., Spirakis, P. G., & Theofilatos, M. (2018). Brief Announcement: Fast Approximate Counting and Leader Election in Populations. In Unknown Conference (pp. 38-42). Springer International Publishing. doi:10.1007/978-3-030-01325-7_7DOI: 10.1007/978-3-030-01325-7_7
Belazzougui, D., Kaporis, A. C., & Spirakis, P. G. (2018). Random input helps searching predecessors. In CEUR Workshop Proceedings Vol. 2113 (pp. 106-115).
Christodoulou, G., Melissourgos, T., & Spirakis, P. G. (2018). Short Paper: Strategic Contention Resolution in Multiple Channels with Limited Feedback. In Unknown Conference (pp. 245-250). Springer International Publishing. doi:10.1007/978-3-319-99660-8_22DOI: 10.1007/978-3-319-99660-8_22
Strategic Contention Resolution in Multiple Channels. (Journal article)
Christodoulou, G., Melissourgos, T., & Spirakis, P. G. (2018). Strategic Contention Resolution in Multiple Channels.. CoRR, abs/1810.04565.
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.
2017
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_57DOI: 10.1007/978-3-319-77404-6_57
Lamprou, I., Martin, R., & Spirakis, P. (2017). Cover Time in Edge-Uniform Stochastically-Evolving Graphs. Lecture Notes in Computer Science. Retrieved from http://arxiv.org/abs/1702.05412v5
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-xDOI: 10.1007/s00224-017-9757-x
Spirakis, P. G., Christodoulou, G., Gairing, M., Nikoletseas, S., & Raptopoulos, C. (2017). A 3-player protocol preventing persistence in strategic contention with limited feedback. In LNCS ARCoSS. L'Acquilla Iatly.
Fotakis, D., Kaporis, A., Lianeas, T., & Spirakis, P. G. (2017). Resolving Braess's Paradox in Random Networks. Algorithmica, 78(03), 788-818. doi:10.1007/s00453-016-0175-2DOI: 10.1007/s00453-016-0175-2
Spirakis, P. G., Gasieniec, L., Martin, R., Hamilton, D., & Stachowiac, G. (2017). Deterministic Population Protocols for Exact Majority and Plurality. In LIPIcs. Madrit Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. doi:10.4230/LIPIcs.OPODIS.2016.14DOI: 10.4230/LIPIcs.OPODIS.2016.14
Michail, O., Skretas, G., & Spirakis, P. G. (2017). On the Transformation Capability of Feasible Mechanisms for Programmable Matter. Retrieved from http://arxiv.org/abs/1703.04381v1
Deligkas, A., Mertzios, G. B., & Spirakis, P. G. (2017). Binary Search in Graphs Revisited. Retrieved from http://arxiv.org/abs/1702.08899v2
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-7DOI: 10.1007/s00453-015-0078-7
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-8DOI: 10.1007/s00446-016-0277-8
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_35DOI: 10.1007/978-3-319-57586-5_35
A 3-Player Protocol Preventing Persistence in Strategic Contention with Limited Feedback. (Conference Paper)
Christodoulou, G., Gairing, M., Nikoletseas, S. E., Raptopoulos, C. L., & 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
Lamprou, I., Martin, R., & Spirakis, P. G. (2017). Bounding the Cover Time in Edge-Uniform Stochastic Graphs.. CoRR, abs/1702.05412.
Deligkas, A., Fearnley, J., Savani, R., & Spirakis, P. G. (2017). Computing Approximate Nash Equilibria in Polymatrix Games.. Algorithmica, 77, 487-514.
Michail, O., & Spirakis, P. G. (2017). Connectivity Preserving Network Transformers. In EMERGENT COMPUTATION: A FESTSCHRIFT FOR SELIM G. AKL Vol. 24 (pp. 337-359). doi:10.1007/978-3-319-46376-6_15DOI: 10.1007/978-3-319-46376-6_15
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
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_3DOI: 10.1007/978-3-319-51963-0_3
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-xDOI: 10.1007/s00224-016-9733-x
Mertzios, G. B., Nikoletseas, S. E., Raptopoulos, C. L., & Spirakis, P. G. (2017). Population Protocols for Majority in Arbitrary Networks. Unknown Journal, 77-82. doi:10.1007/978-3-319-51753-7_13DOI: 10.1007/978-3-319-51753-7_13
Deligkas, A., Mertzios, G. B., & Spirakis, P. G. (2017). The Computational Complexity of Weighted Greedy Matching. In THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE (pp. 466-472). Retrieved from https://www.webofscience.com/
2016
Michail, O., & Spirakis, P. G. (2016). How Many Cooks Spoil the Soup ?. In Lecture Notes in Computer Science Vol. 9988 (pp. 1-16). Helsinki , Finland: Springer Verlag (Germany).
Christodoulou, G., Gairing, M., Nikoletseas, S., Raptopoulos, C., & Spirakis, P. G. (2016). Strategic Contention Resolution with Limited Feedback. In Leibniz International Proceedings in Informatics (LIPIcs) Vol. 57 (pp. 30:1-30:16). Aarhus , Denmark. doi:10.4230/LIPIcs.ESA.2016.30DOI: 10.4230/LIPIcs.ESA.2016.30
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.68DOI: 10.4230/LIPIcs.MFCS.2016.68
Traveling Salesman Problems in Temporal Graphs (Journal article)
Spirakis, P. G., & Michail, O. (2016). Traveling Salesman Problems in Temporal Graphs. Theoretical Computer Science, 634, 1-23. doi:10.1016/j.tcs.2016.04.006DOI: 10.1016/j.tcs.2016.04.006
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_5DOI: 10.1007/978-3-319-57586-5_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-4DOI: 10.1007/s00446-015-0257-4
Deligkas, A., Mertzios, G. B., & Spirakis, P. G. (2016). On the Complexity of Weighted Greedy Matchings. Retrieved from http://arxiv.org/abs/1602.05909v2
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.002DOI: 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.
INTERVIEW WITH PAUL SPIRAKIS PRESIDENT OF THE EATCS (Journal article)
Aceto, L., & Spirakis, P. G. (2016). INTERVIEW WITH PAUL SPIRAKIS PRESIDENT OF THE EATCS. BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, (120), 9-12. Retrieved from https://www.webofscience.com/
Christodoulou, G., Gairing, M., Nikoletseas, S. E., Raptopoulos, C. L., & 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 für Informatik. Retrieved from http://drops.dagstuhl.de/opus/portals/lipics/index.php?semnr=16013
2015
Michail, O., & Spirakis, P. G. (2017). Connectivity preserving network transformers. THEORETICAL COMPUTER SCIENCE, 671, 36-55. doi:10.1016/j.tcs.2016.02.040DOI: 10.1016/j.tcs.2016.02.040
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_2DOI: 10.1007/978-3-662-53354-3_2
Amaxilatis, D., Logaras, M., Michail, O., & Spirakis, P. G. (2015). NETCS: A New Simulator of Population Protocols and Network Constructors. Retrieved from http://arxiv.org/abs/1508.06731v1
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.005DOI: 10.1016/j.jpdc.2015.02.005
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_32DOI: 10.1007/978-3-662-47672-7_32
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_8DOI: 10.1007/978-3-319-28684-6_8
Temporal Network Optimization Subject to Connectivity Constraints (Conference Paper)
Mertzios, G. B., Michail, O., Chatzigiannakis, I., & Spirakis, P. G. (2013). Temporal Network Optimization Subject to Connectivity Constraints. In AUTOMATA, LANGUAGES, AND PROGRAMMING, PT II Vol. 7966 (pp. 657-668). Retrieved from https://www.webofscience.com/
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.
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 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 Unknown Conference (pp. 142-154). Springer International Publishing. doi:10.1007/978-3-319-28472-9_11DOI: 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 ALGORITHMS, PROBABILITY, NETWORKS, AND GAMES: SCIENTIFIC PAPERS AND ESSAYS DEDICATED TO PAUL G. SPIRAKIS ON THE OCCASION OF HIS 60TH BIRTHDAY Vol. 9295 (pp. 33-48). doi:10.1007/978-3-319-24024-4_5DOI: 10.1007/978-3-319-24024-4_5
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 Unknown Conference (pp. 67-80). Springer International Publishing. doi:10.1007/978-3-319-21741-3_5DOI: 10.1007/978-3-319-21741-3_5
2014
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 https://www.webofscience.com/
Ephemeral Networks with Random Availability of Links: Diameter and Connectivity (Conference Paper)
Akrida, E. C., Gasieniec, L., Mertzios, G. B., & Spirakis, P. G. (2014). Ephemeral Networks with Random Availability of Links: Diameter and Connectivity. In PROCEEDINGS OF THE 26TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA'14) (pp. 267-276). doi:10.1145/2612669.2612693DOI: 10.1145/2612669.2612693
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 https://www.webofscience.com/
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-3DOI: 10.1007/s00224-013-9446-3
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.002DOI: 10.1016/j.adhoc.2011.09.002
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 https://www.webofscience.com/
2013
The computational power of simple protocols for self-awareness on graphs (Journal article)
Chatzigiannakis, I., Michail, O., Nikolaou, S., & Spirakis, P. G. (2013). The computational power of simple protocols for self-awareness on graphs. THEORETICAL COMPUTER SCIENCE, 512, 98-118. doi:10.1016/j.tcs.2012.08.026DOI: 10.1016/j.tcs.2012.08.026
Spirakis, P. G., & Akrida, E. C. (2013). Moving in temporal graphs with very sparse random availability of edges. Retrieved from http://arxiv.org/abs/1310.7898v1
Simple and Efficient Local Codes for Distributed Stable Network Construction (Conference Paper)
Michail, O., & Spirakis, P. G. (2014). Simple and Efficient Local Codes for Distributed Stable Network Construction. In PROCEEDINGS OF THE 2014 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'14) (pp. 76-85). doi:10.1145/2611462.2611466DOI: 10.1145/2611462.2611466
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.029DOI: 10.1016/j.tcs.2015.03.029
A Guided Tour in Random Intersection Graphs (Conference Paper)
Spirakis, P. G., Nikoletseas, S., & Raptopoulos, C. (2013). A Guided Tour in Random Intersection Graphs. In AUTOMATA, LANGUAGES, AND PROGRAMMING, PT II Vol. 7966 (pp. 29-35). Retrieved from https://www.webofscience.com/
Strong Bounds for Evolution in Networks (Conference Paper)
Mertzios, G. B., & Spirakis, P. G. (2013). Strong Bounds for Evolution in Networks. In AUTOMATA, LANGUAGES, AND PROGRAMMING, PT II Vol. 7966 (pp. 669-680). Retrieved from https://www.webofscience.com/
2012
Causality, Influence, and Computation in Possibly Disconnected Synchronous Dynamic Networks (Conference Paper)
Michail, O., Chatzigiannakis, I., & Spirakis, P. G. (2012). Causality, Influence, and Computation in Possibly Disconnected Synchronous Dynamic Networks. In Unknown Conference (pp. 269-283). Springer Berlin Heidelberg. doi:10.1007/978-3-642-35476-2_19DOI: 10.1007/978-3-642-35476-2_19
Brief Announcement: Naming and Counting in Anonymous Unknown Dynamic Networks (Conference Paper)
Michail, O., Chatzigiannakis, I., & Spirakis, P. G. (2012). Brief Announcement: Naming and Counting in Anonymous Unknown Dynamic Networks. In DISTRIBUTED COMPUTING, DISC 2012 Vol. 7611 (pp. 437-438). Retrieved from https://www.webofscience.com/
Terminating Population Protocols via Some Minimal Global Knowledge Assumptions (Conference Paper)
Michail, O., Chatzigiannakis, I., & Spirakis, P. G. (2012). Terminating Population Protocols via Some Minimal Global Knowledge Assumptions. In Unknown Conference (pp. 77-89). Springer Berlin Heidelberg. doi:10.1007/978-3-642-33536-5_8DOI: 10.1007/978-3-642-33536-5_8
Naming and Counting in Anonymous Unknown Dynamic Networks (Conference Paper)
Michail, O., Chatzigiannakis, I., & Spirakis, P. G. (2013). Naming and Counting in Anonymous Unknown Dynamic Networks. In STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2013 Vol. 8255 (pp. 281-295). Retrieved from https://www.webofscience.com/
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.035DOI: 10.1016/j.tcs.2013.11.035
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(01), 2016-2026. doi:10.1016/j.jpdc.2013.07.007DOI: 10.1016/j.jpdc.2013.07.007
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-6DOI: 10.1007/s00453-014-9949-6
2011
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-7DOI: 10.1007/s00453-012-9722-7
The Computational Power of Simple Protocols for Self-awareness on Graphs (Conference Paper)
Chatzigiannakis, I., Michail, O., Nikolaou, S., & Spirakis, P. G. (2011). The Computational Power of Simple Protocols for Self-awareness on Graphs. In STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS Vol. 6976 (pp. 135-147). Retrieved from https://www.webofscience.com/
Passively mobile communicating machines that use restricted space (Conference Paper)
Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A., & Spirakis, P. G. (2011). Passively mobile communicating machines that use restricted space. In Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing. ACM. doi:10.1145/1998476.1998480DOI: 10.1145/1998476.1998480
Michail, O., Chatzigiannakis, I., & Spirakis, P. G. (2011). Mediated population protocols. THEORETICAL COMPUTER SCIENCE, 412(22), 2434-2450. doi:10.1016/j.tcs.2011.02.003DOI: 10.1016/j.tcs.2011.02.003
Computational models for networks of tiny artifacts: A survey (Journal article)
Àlvarez, C., Chatzigiannakis, I., Duch, A., Gabarró, J., Michail, O., Serna, M., & Spirakis, P. G. (2011). Computational models for networks of tiny artifacts: A survey. Computer Science Review, 5(1), 7-25. doi:10.1016/j.cosrev.2010.09.001DOI: 10.1016/j.cosrev.2010.09.001
2010
Passively mobile communicating machines that use restricted space (Journal article)
Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A., & Spirakis, P. G. (2011). Passively mobile communicating machines that use restricted space. THEORETICAL COMPUTER SCIENCE, 412(46), 6469-6483. doi:10.1016/j.tcs.2011.07.001DOI: 10.1016/j.tcs.2011.07.001
All Symmetric Predicates in <i>NSPACE</i>(<i>n</i><SUP>2</SUP>) Are Stably Computable by the Mediated Population Protocol Model (Conference Paper)
Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A., & Spirakis, P. G. (2010). All Symmetric Predicates in <i>NSPACE</i>(<i>n</i><SUP>2</SUP>) Are Stably Computable by the Mediated Population Protocol Model. In MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2010 Vol. 6281 (pp. 270-+). Retrieved from https://www.webofscience.com/
Algorithmic Verification of Population Protocols (Conference Paper)
Chatzigiannakis, I., Michail, O., & Spirakis, P. G. (2010). Algorithmic Verification of Population Protocols. In STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS Vol. 6366 (pp. 221-235). Retrieved from https://www.webofscience.com/
Stably Decidable Graph Languages by Mediated Population Protocols (Conference Paper)
Chatzigiannakis, I., Michail, O., & Spirakis, P. G. (2010). Stably Decidable Graph Languages by Mediated Population Protocols. In STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS Vol. 6366 (pp. 252-266). Retrieved from https://www.webofscience.com/
Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A., & Spirakis, P. G. (2010). Passively Mobile Communicating Logarithmic Space Machines. Retrieved from http://arxiv.org/abs/1004.3395v1
On the Fairness of Probabilistic Schedulers for Population Protocols (Conference Paper)
Chatzigiannakis, I., Dolev, S., Fekete, S. P., Michail, O., & Spirakis, P. G. (2010). On the Fairness of Probabilistic Schedulers for Population Protocols. In Dagstuhl Seminar Proceedings Vol. 9371.
2009
Not All Fair Probabilistic Schedulers Are Equivalent (Conference Paper)
Chatzigiannakis, I., Dolev, S., Fekete, S. P., Michail, O., & Spirakis, P. C. (2009). Not All Fair Probabilistic Schedulers Are Equivalent. In PRINCIPLES OF DISTRIBUTED SYSTEMS, PROCEEDINGS Vol. 5923 (pp. 33-+). Retrieved from https://www.webofscience.com/
Mediated Population Protocols (Conference Paper)
Chatzigiannakis, I., Michail, O., & Spirakis, P. G. (2009). Mediated Population Protocols. In AUTOMATA, LANGUAGES AND PROGRAMMING, PT II, PROCEEDINGS Vol. 5556 (pp. 363-+). Retrieved from https://www.webofscience.com/
Recent Advances in Population Protocols (Conference Paper)
Chatzigiannakis, I., Michail, O., & Spirakis, P. G. (2009). Recent Advances in Population Protocols. In MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2009 Vol. 5734 (pp. 56-76). Retrieved from https://www.webofscience.com/
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
Efthymiou, C., & Spirakis, P. G. (2008). Random sampling of colourings of sparse random graphs with a constant number of colours. Retrieved from http://dx.doi.org/10.1016/j.tcs.2008.05.008
