2024
Structural and Combinatorial Properties of 2-Swap Word Permutation Graphs. (Conference Paper)
Adamson, D., Flaherty, N., Potapov, I., & Spirakis, P. G. (2024). Structural and Combinatorial Properties of 2-Swap Word Permutation Graphs.. In J. A. Soto, & A. Wiese (Eds.), LATIN (2) Vol. 14579 (pp. 61-76). Springer. Retrieved from https://doi.org/10.1007/978-3-031-55601-2
Adamson, D., Flaherty, N., Potapov, I., & Spirakis, P. G. (2024). Structural and Combinatorial Properties of 2-Swap Word Permutation Graphs. Unknown Journal, 61-76. doi:10.1007/978-3-031-55601-2_5DOI: 10.1007/978-3-031-55601-2_5
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
A Shared Memory SMC Sampler for Decision Trees (Conference Paper)
Drousiotis, E., Varsi, A., Spirakis, P. G., & Maskell, S. (2023). A Shared Memory SMC Sampler for Decision Trees. In 2023 IEEE 35th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD). IEEE. doi:10.1109/sbac-pad59825.2023.00030DOI: 10.1109/sbac-pad59825.2023.00030
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
Nikoletseas, S., Raptopoulos, C., & Spirakis, P. (2023). MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems. In Algorithmica Vol. 85 (pp. 2817-2842). Springer Science and Business Media LLC. doi:10.1007/s00453-023-01121-3DOI: 10.1007/s00453-023-01121-3
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
Preface (Conference Paper)
Doty, D., & Spirakis, P. (2023). Preface. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 257. doi:10.4230/LIPIcs.SAND.2023.0DOI: 10.4230/LIPIcs.SAND.2023.0
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
Liagkou, V., Nastou, P. E., Spirakis, P., & Stamatiou, Y. C. (2023). On the Existence of Highly Organized Communities in Networks of Locally Interacting Agents. In Unknown Conference (pp. 501-510). Springer Nature Switzerland. doi:10.1007/978-3-031-34671-2_35DOI: 10.1007/978-3-031-34671-2_35
Realizing Predictive Maintenance in Production Machinery Through Low-Cost IIoT Framework and Anomaly Detection: A Case Study in a Real-World Manufacturing Environment (Conference Paper)
Filios, G., Karatzas, S., Krousarlis, M., Nikoletseas, S., Panagiotou, S. H., & Spirakis, P. (2023). Realizing Predictive Maintenance in Production Machinery Through Low-Cost IIoT Framework and Anomaly Detection: A Case Study in a Real-World Manufacturing Environment. 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.00062DOI: 10.1109/dcoss-iot58021.2023.00062
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
How Hard Is It to Detect Surveillance? A Formal Study of Panopticons and Their Detectability Problem (Journal article)
Liagkou, V., Nastou, P. E., Spirakis, P., & Stamatiou, Y. C. (n.d.). How Hard Is It to Detect Surveillance? A Formal Study of Panopticons and Their Detectability Problem. Cryptography, 6(3), 42. doi:10.3390/cryptography6030042DOI: 10.3390/cryptography6030042
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
Liagkou, V., Nastou, P. E., Spirakis, P., & Stamatiou, Y. C. (2022). On the Undecidability of the Panopticon Detection Problem. In Unknown Conference (pp. 78-87). Springer International Publishing. doi:10.1007/978-3-031-07689-3_6DOI: 10.1007/978-3-031-07689-3_6
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
Nikoletseas, S., Raptopoulos, C., & Spirakis, P. (2021). MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems. Leibniz International Proceedings in Informatics, LIPIcs, 212. doi:10.4230/LIPIcs.ISAAC.2021.28DOI: 10.4230/LIPIcs.ISAAC.2021.28
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
Liagkou, V., Nastou, P. E., Spirakis, P., & Stamatiou, Y. C. (2021). Effective Enumeration of Infinitely Many Programs that Evade Formal Malware Analysis. In Unknown Conference (pp. 230-243). Springer International Publishing. doi:10.1007/978-3-030-78086-9_18DOI: 10.1007/978-3-030-78086-9_18
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
A smart energy management power supply unit for low-power IoT systems (Conference Paper)
Filios, G., Katsidimas, I., Nikoletseas, S., Souroulagkas, A., Spirakis, P., & Tsenempis, I. (2020). A smart energy management power supply unit for low-power IoT systems. In 2020 16th International Conference on Distributed Computing in Sensor Systems (DCOSS). IEEE. doi:10.1109/dcoss49796.2020.00045DOI: 10.1109/dcoss49796.2020.00045
An IoT based Solar Park Health Monitoring System for PID and Hotspots Effects (Conference Paper)
Filios, G., Katsidimas, I., Kerimakis, E., Nikoletseas, S., Souroulagkas, A., & Spirakis, P. (2020). An IoT based Solar Park Health Monitoring System for PID and Hotspots Effects. In 2020 16th International Conference on Distributed Computing in Sensor Systems (DCOSS). IEEE. doi:10.1109/dcoss49796.2020.00069DOI: 10.1109/dcoss49796.2020.00069
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
Preface (Journal article)
Ausiello, G., Kari, L., Rozenberg, G., Sannella, D., Spirakis, P., & Curien, P. -L. (2020). Preface. Theoretical Computer Science, 807, 1-2. doi:10.1016/j.tcs.2019.12.021DOI: 10.1016/j.tcs.2019.12.021
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
Preface (Journal article)
Ausiello, G., Kari, L., Rozenberg, G., Sannella, D., Spirakis, P., & Curien, P. -L. (2019). Preface. Theoretical Computer Science, 777, 1-2. doi:10.1016/j.tcs.2019.05.003DOI: 10.1016/j.tcs.2019.05.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
Connected Subgraph Defense Games (Chapter)
Akrida, E. C., Deligkas, A., Melissourgos, T., & Spirakis, P. G. (2019). Connected Subgraph Defense Games. In Algorithmic Game Theory (Vol. 11801, pp. 216-236). Springer Nature. doi:10.1007/978-3-030-30473-7_15DOI: 10.1007/978-3-030-30473-7_15
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
Fault Tolerant Network Constructors (Chapter)
Michail, O., Spirakis, P. G., & Theofilatos, M. (2019). Fault Tolerant Network Constructors. In Stabilization, Safety, and Security of Distributed Systems (Vol. 11914, pp. 243-255). Springer Nature. doi:10.1007/978-3-030-34992-9_19DOI: 10.1007/978-3-030-34992-9_19
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.
Randomized and Set-System Based Collusion Resistant Key Predistribution Schemes (Brief Announcement) (Chapter)
Liagkou, V., Spirakis, P., & Stamatiou, Y. C. (2019). Randomized and Set-System Based Collusion Resistant Key Predistribution Schemes (Brief Announcement). In Lecture Notes in Computer Science (pp. 324-327). Springer International Publishing. doi:10.1007/978-3-030-20951-3_28DOI: 10.1007/978-3-030-20951-3_28
Randomized and set-system based collusion resistant key predistribution schemes (Conference Paper)
Liagkou, V., Spirakis, P., & Stamatiou, Y. C. (2019). Randomized and set-system based collusion resistant key predistribution schemes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 11527 LNCS (pp. 324-327). doi:10.1007/978-3-030-20951-3_28DOI: 10.1007/978-3-030-20951-3_28
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
The Temporal Explorer Who Returns to the Base (Chapter)
Akrida, E. C., Mertzios, G. B., & Spirakis, P. G. (2019). The Temporal Explorer Who Returns to the Base. In Algorithms and Complexity (Vol. 11485, pp. 13-24). Springer Nature. doi:10.1007/978-3-030-17402-6_2DOI: 10.1007/978-3-030-17402-6_2
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
Randomized Approximation Techniques (Chapter)
Nikoletseas, S., & Spirakis, P. (2018). Randomized Approximation Techniques. In Handbook of Approximation Algorithms and Metaheuristics, Second Edition (pp. 189-201). Chapman and Hall/CRC. doi:10.1201/9781351236423-11DOI: 10.1201/9781351236423-11
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
Cover Time in Edge-Uniform Stochastically-Evolving Graphs (Chapter)
Lamprou, I., Martin, R., & Spirakis, P. (2017). Cover Time in Edge-Uniform Stochastically-Evolving Graphs. In Stabilization, Safety, and Security of Distributed Systems (Vol. 10616, pp. 441-455). Springer Nature. doi:10.1007/978-3-319-69084-1_33DOI: 10.1007/978-3-319-69084-1_33
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
Preface (Book)
Spirakis, P., & Tsigas, P. (2017). Preface (Vol. 10616 LNCS).
Temporal Flows in Temporal Networks (Chapter)
Akrida, E. C., Czyzowicz, J., Gąsieniec, L., Kuszner, Ł., & Spirakis, P. G. (2017). Temporal Flows in Temporal Networks. In Algorithms and Complexity (Vol. 10236, pp. 43-54). Springer Nature. doi:10.1007/978-3-319-57586-5_5DOI: 10.1007/978-3-319-57586-5_5
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/
Chatzigiannakis, I., & Spirakis, P. (2017). The Dynamics and Stability of Probabilistic Population Processes. In Unknown Conference (pp. 33-45). Springer International Publishing. doi:10.1007/978-3-319-69084-1_3DOI: 10.1007/978-3-319-69084-1_3
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
Approximations of Bimatrix Nash Equilibria (Chapter)
Spirakis, P. P., Spirakis, P. P., & Spirakis, P. P. (2016). Approximations of Bimatrix Nash Equilibria. In Encyclopedia of Algorithms (pp. 137-141). Springer New York. doi:10.1007/978-1-4939-2864-4_30DOI: 10.1007/978-1-4939-2864-4_30
Best Response Algorithms for Selfish Routing (Chapter)
Spirakis, P. (2016). Best Response Algorithms for Selfish Routing. In Encyclopedia of Algorithms (pp. 181-183). Springer New York. doi:10.1007/978-1-4939-2864-4_46DOI: 10.1007/978-1-4939-2864-4_46
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.
Hamilton Cycles in Random Intersection Graphs (Chapter)
Efthymiou, C., & Spirakis, P. (2016). Hamilton Cycles in Random Intersection Graphs. In Encyclopedia of Algorithms (pp. 891-894). Springer New York. doi:10.1007/978-1-4939-2864-4_176DOI: 10.1007/978-1-4939-2864-4_176
How Many Cooks Spoil the Soup? (Chapter)
Michail, O., & Spirakis, P. G. (2016). How Many Cooks Spoil the Soup?. In Structural Information and Communication Complexity (Vol. 9988, pp. 3-18). Springer Nature. doi:10.1007/978-3-319-48314-6_1DOI: 10.1007/978-3-319-48314-6_1
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/
Independent Sets in Random Intersection Graphs (Chapter)
Nikoletseas, S., Raptopoulos, C. L., & Spirakis, P. (2016). Independent Sets in Random Intersection Graphs. In Encyclopedia of Algorithms (pp. 961-964). Springer New York. doi:10.1007/978-1-4939-2864-4_187DOI: 10.1007/978-1-4939-2864-4_187
Lipschitz Continuity and Approximate Equilibria (Chapter)
Deligkas, A., Fearnley, J., & Spirakis, P. (2016). Lipschitz Continuity and Approximate Equilibria. In Algorithmic Game Theory (Vol. 9928, pp. 15-26). Springer Nature. doi:10.1007/978-3-662-53354-3_2DOI: 10.1007/978-3-662-53354-3_2
Minimum Congestion Redundant Assignments (Chapter)
Fotakis, D., & Spirakis, P. (2016). Minimum Congestion Redundant Assignments. In Encyclopedia of Algorithms (pp. 1298-1302). Springer New York. doi:10.1007/978-1-4939-2864-4_232DOI: 10.1007/978-1-4939-2864-4_232
Selfish Unsplittable Flows: Algorithms for Pure Equilibria (Chapter)
Spirakis, P. P. (2016). Selfish Unsplittable Flows: Algorithms for Pure Equilibria. In Encyclopedia of Algorithms (pp. 1930-1932). Springer New York. doi:10.1007/978-1-4939-2864-4_360DOI: 10.1007/978-1-4939-2864-4_360
Stackelberg Games: The Price of Optimum (Chapter)
Kaporis, A., & Spirakis, P. (2016). Stackelberg Games: The Price of Optimum. In Encyclopedia of Algorithms (pp. 2078-2083). Springer New York. doi:10.1007/978-1-4939-2864-4_398DOI: 10.1007/978-1-4939-2864-4_398
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
Tail Bounds for Occupancy Problems (Chapter)
Spirakis, P. (2016). Tail Bounds for Occupancy Problems. In Encyclopedia of Algorithms (pp. 2198-2199). Springer New York. doi:10.1007/978-1-4939-2864-4_419DOI: 10.1007/978-1-4939-2864-4_419
Weighted Random Sampling (Chapter)
Efraimidis, P., & Spirakis, P. (2016). Weighted Random Sampling. In Encyclopedia of Algorithms (pp. 2365-2367). Springer New York. doi:10.1007/978-1-4939-2864-4_478DOI: 10.1007/978-1-4939-2864-4_478
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
PODC 2015 Chairs' welcome (Conference Paper)
Georgiou, C., & Spirakis, P. G. (2015). PODC 2015 Chairs' welcome. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing Vol. 2015-July (pp. iii).
Session details: Session 2 (Conference Paper)
Spirakis, P. G. (2015). Session details: Session 2. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing. ACM. doi:10.1145/3260478DOI: 10.1145/3260478
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/
Approximations of Bimatrix Nash Equilibria (Chapter)
Spirakis, P. (2015). Approximations of Bimatrix Nash Equilibria. In Encyclopedia of Algorithms (pp. 1-6). Springer Berlin Heidelberg. doi:10.1007/978-3-642-27848-8_30-2DOI: 10.1007/978-3-642-27848-8_30-2
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 Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations (Chapter)
Andreou, M., Fotakis, D., Lesta, V. P., Nikoletseas, S., & Spirakis, P. (2015). On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations. In Algorithms, Probability, Networks, and Games (pp. 97-132). Springer International Publishing. doi:10.1007/978-3-319-24024-4_8DOI: 10.1007/978-3-319-24024-4_8
On Temporally Connected Graphs of Small Cost (Chapter)
Akrida, E. C., Gąsieniec, L., Mertzios, G. B., & Spirakis, P. G. (2015). On Temporally Connected Graphs of Small Cost. In Approximation and Online Algorithms (Vol. 9499, pp. 84-96). Springer Nature. doi:10.1007/978-3-319-28684-6_8DOI: 10.1007/978-3-319-28684-6_8
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
On the discrete dynamics of probabilistic (finite) population protocols (Conference Paper)
Spirakis, P. (2015). On the discrete dynamics of probabilistic (finite) population protocols. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 9294.
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/
Session details: Session 10 (Conference Paper)
Spirakis, P. (2014). Session details: Session 10. In Proceedings of the 2014 ACM symposium on Principles of distributed computing. ACM. doi:10.1145/3246724DOI: 10.1145/3246724
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
Computing Approximate Nash Equilibria in Polymatrix Games (Chapter)
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). Springer Nature. doi:10.1007/978-3-319-13129-0_5DOI: 10.1007/978-3-319-13129-0_5
Determining Majority in Networks with Local Interactions and Very Small Local Memory (Chapter)
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 (Vol. 8572, pp. 871-882). Springer Nature. doi:10.1007/978-3-662-43948-7_72DOI: 10.1007/978-3-662-43948-7_72
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
On the Design of Agent Agreement Protocol using Linear Error-Correcting Codes (Chapter)
Nastou, P. E., Pardalos, P., Spirakis, P., & Stamatiou, Y. C. (2014). On the Design of Agent Agreement Protocol using Linear Error-Correcting Codes. In Applications of Mathematics and Informatics in Science and Engineering (pp. 389-403). Springer International Publishing. doi:10.1007/978-3-319-04720-1_24DOI: 10.1007/978-3-319-04720-1_24
Privacy Preserving Course Evaluations in Greek Higher Education Institutes: An e-Participation Case Study with the Empowerment of Attribute Based Credentials (Chapter)
Liagkou, V., Metakides, G., Pyrgelis, A., Raptopoulos, C., Spirakis, P., & Stamatiou, Y. C. (2014). Privacy Preserving Course Evaluations in Greek Higher Education Institutes: An e-Participation Case Study with the Empowerment of Attribute Based Credentials. In Privacy Technologies and Policy (pp. 140-156). Springer Berlin Heidelberg. doi:10.1007/978-3-642-54069-1_9DOI: 10.1007/978-3-642-54069-1_9
Stackelberg Games: The Price of Optimum (Chapter)
Kaporis, A., & Spirakis, P. (2014). Stackelberg Games: The Price of Optimum. In Encyclopedia of Algorithms (pp. 1-6). Springer Berlin Heidelberg. doi:10.1007/978-3-642-27848-8_398-2DOI: 10.1007/978-3-642-27848-8_398-2
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
Agent agreement protocols based on golay error-correcting code (Conference Paper)
Nastou, P. E., Spirakis, P., Stamatiou, Y., & Vichou, C. (2013). Agent agreement protocols based on golay error-correcting code. In IISA 2013. IEEE. doi:10.1109/iisa.2013.6623689DOI: 10.1109/iisa.2013.6623689
Resolving Braess’s Paradox in Random Networks (Chapter)
Fotakis, D., Kaporis, A. C., Lianeas, T., & Spirakis, P. G. (2013). Resolving Braess’s Paradox in Random Networks. In Web and Internet Economics (pp. 188-201). Springer Berlin Heidelberg. doi:10.1007/978-3-642-45046-4_16DOI: 10.1007/978-3-642-45046-4_16
On the Derivation of a Closed-Form Expression for the Solutions of a Subclass of Generalized Abel Differential Equations (Journal article)
Nastou, P. E., Spirakis, P., Stamatiou, Y. C., & Tsiakalos, A. (2013). On the Derivation of a Closed-Form Expression for the Solutions of a Subclass of Generalized Abel Differential Equations. International Journal of Differential Equations, 2013, 1-9. doi:10.1155/2013/929286DOI: 10.1155/2013/929286
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
Algorithms and Complexity (Book)
Spirakis, P. G., & Serna, M. (Eds.) (2013). Algorithms and Complexity. Springer Berlin Heidelberg. doi:10.1007/978-3-642-38233-8DOI: 10.1007/978-3-642-38233-8
On the Structure of Equilibria in Basic Network Formation (Conference Paper)
Nikoletseas, S., Panagopoulou, P., Raptopoulos, C., & Spirakis, P. G. (2013). On the Structure of Equilibria in Basic Network Formation. In Unknown Conference (pp. 259-270). Springer Berlin Heidelberg. doi:10.1007/978-3-642-40164-0_25DOI: 10.1007/978-3-642-40164-0_25
On the fixation probability of superstars (Journal article)
Díaz, J., Goldberg, L. A., Mertzios, G. B., Richerby, D., Serna, M., & Spirakis, P. G. (2013). On the fixation probability of superstars. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 469(2156), 20130193. doi:10.1098/rspa.2013.0193DOI: 10.1098/rspa.2013.0193
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/
Preface to Special Issue on Algorithmic Game Theory (Journal article)
Kontogiannis, S., Koutsoupias, E., & Spirakis, P. (2013). Preface to Special Issue on Algorithmic Game Theory. Theory of Computing Systems, 53(1), 1-2. doi:10.1007/s00224-013-9466-zDOI: 10.1007/s00224-013-9466-z
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 Framework for Protecting Voters’ Privacy In Electronic Voting Procedures (Journal article)
Manolopoulos, C., Sofotassios, D., Spirakis, P., & Stamatiou, Y. C. (2013). A Framework for Protecting Voters’ Privacy In Electronic Voting Procedures. Journal of Cases on Information Technology, 15(2), 1-33. doi:10.4018/jcit.2013040101DOI: 10.4018/jcit.2013040101
Natural models for evolution on networks (Journal article)
Mertzios, G. B., Nikoletseas, S., Raptopoulos, C., & Spirakis, P. G. (2013). Natural models for evolution on networks. Theoretical Computer Science, 477, 76-95. doi:10.1016/j.tcs.2012.11.032DOI: 10.1016/j.tcs.2012.11.032
Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs (Chapter)
Mertzios, G. B., & Spirakis, P. G. (2013). Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs. In Lecture Notes in Computer Science (pp. 332-343). Springer Berlin Heidelberg. doi:10.1007/978-3-642-35843-2_29DOI: 10.1007/978-3-642-35843-2_29
Attribute Based Credentials Towards Refined Public Consultation Results and Effective eGovernance (Chapter)
Spirakis, P., & Stamatiou, Y. C. (2013). Attribute Based Credentials Towards Refined Public Consultation Results and Effective eGovernance. In Cyber Security and Privacy (pp. 115-126). Springer Berlin Heidelberg. doi:10.1007/978-3-642-41205-9_10DOI: 10.1007/978-3-642-41205-9_10
Naming and Counting in Anonymous Unknown Dynamic Networks (Chapter)
Michail, O., Chatzigiannakis, I., & Spirakis, P. G. (2013). Naming and Counting in Anonymous Unknown Dynamic Networks. In Stabilization, Safety, and Security of Distributed Systems (Vol. 8255, pp. 281-295). Springer Nature. doi:10.1007/978-3-319-03089-0_20DOI: 10.1007/978-3-319-03089-0_20
Potential Functions in Strategic Games (Chapter)
Spirakis, P. G., & Panagopoulou, P. N. (2013). Potential Functions in Strategic Games. In Computer Science – Theory and Applications (pp. 283-297). Springer Berlin Heidelberg. doi:10.1007/978-3-642-38536-0_25DOI: 10.1007/978-3-642-38536-0_25
Temporal Network Optimization Subject to Connectivity Constraints (Chapter)
Mertzios, G. B., Michail, O., Chatzigiannakis, I., & Spirakis, P. G. (2013). Temporal Network Optimization Subject to Connectivity Constraints. In Automata, Languages, and Programming (Vol. 7966, pp. 657-668). Springer Nature. doi:10.1007/978-3-642-39212-2_57DOI: 10.1007/978-3-642-39212-2_57
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/
On the Hardness of Network Design for Bottleneck Routing Games (Chapter)
Fotakis, D., Kaporis, A. C., Lianeas, T., & Spirakis, P. G. (2012). On the Hardness of Network Design for Bottleneck Routing Games. In Algorithmic Game Theory (pp. 156-167). Springer Berlin Heidelberg. doi:10.1007/978-3-642-33996-7_14DOI: 10.1007/978-3-642-33996-7_14
A Probabilistic Key Agreement Scheme for Sensor Networks without Key Predistribution (Chapter)
Liagkou, V., Makri, E., Spirakis, P., & Stamatiou, Y. (2012). A Probabilistic Key Agreement Scheme for Sensor Networks without Key Predistribution. In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering (pp. 72-79). Springer Berlin Heidelberg. doi:10.1007/978-3-642-33448-1_11DOI: 10.1007/978-3-642-33448-1_11
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
Efficient methods for selfish network design (Journal article)
Fotakis, D., Kaporis, A. C., & Spirakis, P. G. (2012). Efficient methods for selfish network design. Theoretical Computer Science, 448, 9-20. doi:10.1016/j.tcs.2012.04.033DOI: 10.1016/j.tcs.2012.04.033
Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs (Chapter)
Nikoletseas, S., Raptopoulos, C., & Spirakis, P. G. (2012). Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs. In Mathematical Foundations of Computer Science 2012 (pp. 728-739). Springer Berlin Heidelberg. doi:10.1007/978-3-642-32589-2_63DOI: 10.1007/978-3-642-32589-2_63
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
Adaptive Hierarchical Network Structures for Wireless Sensor Networks (Chapter)
Amaxilatis, D., Chatzigiannakis, I., Dolev, S., Koninis, C., Pyrgelis, A., & Spirakis, P. G. (2012). Adaptive Hierarchical Network Structures for Wireless Sensor Networks. In Ad Hoc Networks (pp. 65-80). Springer Berlin Heidelberg. doi:10.1007/978-3-642-29096-1_5DOI: 10.1007/978-3-642-29096-1_5
On mutual concavity and strategically-zero-sum bimatrix games (Journal article)
Kontogiannis, S., & Spirakis, P. (2012). On mutual concavity and strategically-zero-sum bimatrix games. Theoretical Computer Science, 432, 64-76. doi:10.1016/j.tcs.2012.01.016DOI: 10.1016/j.tcs.2012.01.016
The Impact of Social Ignorance on Weighted Congestion Games (Journal article)
Fotakis, D., Gkatzelis, V., Kaporis, A. C., & Spirakis, P. G. (2012). The Impact of Social Ignorance on Weighted Congestion Games. Theory of Computing Systems, 50(3), 559-578. doi:10.1007/s00224-011-9355-2DOI: 10.1007/s00224-011-9355-2
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
Approximating Fixation Probabilities in the Generalized Moran Process (Conference Paper)
Díaz, J., Goldberg, L. A., Mertzios, G. B., Richerby, D., Serna, M., & Spirakis, P. G. (2012). Approximating Fixation Probabilities in the Generalized Moran Process. In Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics. doi:10.1137/1.9781611973099.76DOI: 10.1137/1.9781611973099.76
Playing a Game to Bound the Chromatic Number (Journal article)
Panagiota N. Panagopoulou., & Paul G. Spirakis. (2012). Playing a Game to Bound the Chromatic Number. The American Mathematical Monthly, 119(9), 771. doi:10.4169/amer.math.monthly.119.09.771DOI: 10.4169/amer.math.monthly.119.09.771
2011
Elliptic Curve Based Zero Knowledge Proofs and their Applicability on Resource Constrained Devices (Conference Paper)
Chatzigiannakis, I., Pyrgelis, A., Spirakis, P. G., & Stamatiou, Y. C. (2011). Elliptic Curve Based Zero Knowledge Proofs and their Applicability on Resource Constrained Devices. In 2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems. IEEE. doi:10.1109/mass.2011.77DOI: 10.1109/mass.2011.77
ICT and eGovernance (Chapter)
Manolopoulos, C., Sofotassios, D., Spirakis, P., & Stamatiou, Y. C. (n.d.). ICT and eGovernance. In Public Sector Reform Using Information Technologies (pp. 115-136). IGI Global. doi:10.4018/978-1-60960-839-2.ch007DOI: 10.4018/978-1-60960-839-2.ch007
Selected Combinatorial Properties of Random Intersection Graphs (Chapter)
Nikoletseas, S., Raptopoulos, C., & Spirakis, P. G. (2011). Selected Combinatorial Properties of Random Intersection Graphs. In Algebraic Foundations in Computer Science (pp. 347-362). Springer Berlin Heidelberg. doi:10.1007/978-3-642-24897-9_15DOI: 10.1007/978-3-642-24897-9_15
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
On the independence number and Hamiltonicity of uniform random intersection graphs (Journal article)
Nikoletseas, S., Raptopoulos, C., & Spirakis, P. G. (2011). On the independence number and Hamiltonicity of uniform random intersection graphs. Theoretical Computer Science, 412(48), 6750-6760. doi:10.1016/j.tcs.2011.09.003DOI: 10.1016/j.tcs.2011.09.003
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/
Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof) (Chapter)
Panagopoulou, P. N., & Spirakis, P. G. (2011). Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof). In Algorithmic Game Theory (pp. 190-199). Springer Berlin Heidelberg. doi:10.1007/978-3-642-24829-0_18DOI: 10.1007/978-3-642-24829-0_18
Communication and security in random intersection graphs models (Conference Paper)
Nikoletseas, S., Raptopoulos, C., & Spirakis, P. G. (2011). Communication and security in random intersection graphs models. In 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks. IEEE. doi:10.1109/wowmom.2011.5986170DOI: 10.1109/wowmom.2011.5986170
On the Performance of Approximate Equilibria in Congestion Games (Journal article)
Christodoulou, G., Koutsoupias, E., & Spirakis, P. G. (2011). On the Performance of Approximate Equilibria in Congestion Games. Algorithmica, 61(1), 116-140. doi:10.1007/s00453-010-9449-2DOI: 10.1007/s00453-010-9449-2
Selfish splittable flows and -completeness (Journal article)
Kaporis, A. C., & Spirakis, P. G. (2011). Selfish splittable flows and -completeness. Computer Science Review, 5(3), 209-228. doi:10.1016/j.cosrev.2011.04.002DOI: 10.1016/j.cosrev.2011.04.002
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
Rationality authority for provable rational behavior (Conference Paper)
Dolev, S., Panagopoulou, P. N., Rabie, M., Schiller, E. M., & Spirakis, P. G. (2011). Rationality authority for provable rational behavior. In Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing. ACM. doi:10.1145/1993806.1993858DOI: 10.1145/1993806.1993858
Approximability of Symmetric Bimatrix Games and Related Experiments (Chapter)
Kontogiannis, S., & Spirakis, P. (2011). Approximability of Symmetric Bimatrix Games and Related Experiments. In Experimental Algorithms (pp. 1-20). Springer Berlin Heidelberg. doi:10.1007/978-3-642-20662-7_1DOI: 10.1007/978-3-642-20662-7_1
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
New Models for Population Protocols (Book)
Michail, O., Chatzigiannakis, I., & Spirakis, P. G. (2011). New Models for Population Protocols (Vol. 2). Springer Science and Business Media LLC. doi:10.2200/s00328ed1v01y201101dct006DOI: 10.2200/s00328ed1v01y201101dct006
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
Innovative approaches for security of small artefacts (Journal article)
Blundo, C., De Caro, A., Dolev, S., Gilboa, N., Kopeetsky, M., Persiano, G., & Spirakis, P. G. (2011). Innovative approaches for security of small artefacts. Computer Science Review, 5(1), 47-55. doi:10.1016/j.cosrev.2010.09.002DOI: 10.1016/j.cosrev.2010.09.002
Introduction to the special issue on foundations of adaptive networked societies of tiny artefacts (Journal article)
Chatzigiannakis, I., & Spirakis, P. (2011). Introduction to the special issue on foundations of adaptive networked societies of tiny artefacts. Computer Science Review, 5(1), 4-6. doi:10.1016/j.cosrev.2010.11.003DOI: 10.1016/j.cosrev.2010.11.003
Robust and scalable middleware for selfish-computer systems (Journal article)
Dolev, S., Schiller, E. M., Spirakis, P. G., & Tsigas, P. (2011). Robust and scalable middleware for selfish-computer systems. Computer Science Review, 5(1), 69-84. doi:10.1016/j.cosrev.2010.09.008DOI: 10.1016/j.cosrev.2010.09.008
Natural Models for Evolution on Networks (Chapter)
Mertzios, G. B., Nikoletseas, S., Raptopoulos, C., & Spirakis, P. G. (2011). Natural Models for Evolution on Networks. In Lecture Notes in Computer Science (pp. 290-301). Springer Berlin Heidelberg. doi:10.1007/978-3-642-25510-6_25DOI: 10.1007/978-3-642-25510-6_25
New Models for Population Protocols (Book)
Michail, O., Chatzigiannakis, I., & Spirakis, P. G. (2011). New Models for Population Protocols. Springer International Publishing. doi:10.1007/978-3-031-02004-9DOI: 10.1007/978-3-031-02004-9
Population Protocols and Related Models (Chapter)
Spirakis, P. G. (2011). Population Protocols and Related Models. In Monographs in Theoretical Computer Science. An EATCS Series (pp. 109-159). Springer Berlin Heidelberg. doi:10.1007/978-3-642-14849-1_5DOI: 10.1007/978-3-642-14849-1_5
Probabilistic Data Propagation in Wireless Sensor Networks (Chapter)
Nikoletseas, S., & Spirakis, P. G. (2011). Probabilistic Data Propagation in Wireless Sensor Networks. In Monographs in Theoretical Computer Science (pp. 353-380). Springer Berlin Heidelberg. doi:10.1007/978-3-642-14849-1_12DOI: 10.1007/978-3-642-14849-1_12
Strategies for repeated games with subsystem takeovers implementable by deterministic and self-stabilising automata (Journal article)
Dolev, S., Schiller, E. M., Spirakis, P. G., & Philippas, N. A. (2011). Strategies for repeated games with subsystem takeovers implementable by deterministic and self-stabilising automata. International Journal of Autonomous and Adaptive Communications Systems, 4(1), 4. doi:10.1504/ijaacs.2011.037747DOI: 10.1504/ijaacs.2011.037747
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
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface (Book)
Kontogiannis, S., Koutsoupias, E., & Spirakis, P. G. (2010). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface (Vol. 6386 LNCS).
A Secure Data Management Model for Cultural Organizations (Conference Paper)
Liagkou, V., & Spirakis, P. (2010). A Secure Data Management Model for Cultural Organizations. In 2010 International Conference on Multimedia Information Networking and Security. IEEE. doi:10.1109/mines.2010.135DOI: 10.1109/mines.2010.135
Can Formalism Alone Provide an Answer to the Quest of a Viable Definition of Trust in the WWW Society? (Chapter)
Liagkou, V., Spirakis, P., & Stamatiou, Y. C. (2010). Can Formalism Alone Provide an Answer to the Quest of a Viable Definition of Trust in the WWW Society?. In Next Generation Society. Technological and Legal Issues (pp. 199-208). Springer Berlin Heidelberg. doi:10.1007/978-3-642-11631-5_19DOI: 10.1007/978-3-642-11631-5_19
Distributed Game-Theoretic Vertex Coloring (Chapter)
Chatzigiannakis, I., Koninis, C., Panagopoulou, P. N., & Spirakis, P. G. (2010). Distributed Game-Theoretic Vertex Coloring. In Lecture Notes in Computer Science (pp. 103-118). Springer Berlin Heidelberg. doi:10.1007/978-3-642-17653-1_9DOI: 10.1007/978-3-642-17653-1_9
Fun with Games (Chapter)
Spirakis, P. G., Chatzigiannakis, I., Mylonas, G., & Panagopoulou, P. N. (2010). Fun with Games. In Lecture Notes in Computer Science (pp. 4-15). Springer Berlin Heidelberg. doi:10.1007/978-3-642-13122-6_3DOI: 10.1007/978-3-642-13122-6_3
MURPESS - MUlti radio pedestrian energy scavenging sensor network (Conference Paper)
Chatzigiannakis, I., Colesanti, U., Kontogiannis, S., Leshem, G., Marchetti-Spaccamela, A., Mehler, J., . . . Vitaletti, A. (2010). MURPESS - MUlti radio pedestrian energy scavenging sensor network. In eChallenges e-2010 Conference.
Practical and Efficient Approximations of Nash Equilibria for Win-Lose Games Based on Graph Spectra (Chapter)
Tsaknakis, H., & Spirakis, P. G. (2010). Practical and Efficient Approximations of Nash Equilibria for Win-Lose Games Based on Graph Spectra. In Lecture Notes in Computer Science (pp. 378-390). Springer Berlin Heidelberg. doi:10.1007/978-3-642-17572-5_31DOI: 10.1007/978-3-642-17572-5_31
The Impact of the Web and Political Balance to e-Democracy (Chapter)
Manolopoulos, C., Efstathiadou, R., & Spirakis, P. (2010). The Impact of the Web and Political Balance to e-Democracy. In Next Generation Society. Technological and Legal Issues (pp. 13-28). Springer Berlin Heidelberg. doi:10.1007/978-3-642-11631-5_2DOI: 10.1007/978-3-642-11631-5_2
Blueprints for a Large-Scale Early Warning System (Conference Paper)
Spirakis, P. G., Vlachos, V., Karakoidas, V., Liappis, D., Kalaitzis, D., Valeontis, E., . . . Argyros, G. (2010). Blueprints for a Large-Scale Early Warning System. In 2010 14th Panhellenic Conference on Informatics. IEEE. doi:10.1109/pci.2010.27DOI: 10.1109/pci.2010.27
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/
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses (Chapter)
Kontogiannis, S., & Spirakis, P. (2010). Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (pp. 312-325). Springer Berlin Heidelberg. doi:10.1007/978-3-642-15369-3_24DOI: 10.1007/978-3-642-15369-3_24
Information security for sensors by overwhelming random sequences and permutations (Conference Paper)
Dolev, S., Gilboa, N., Kopeetsky, M., Persiano, G., & Spirakis, P. (2010). Information security for sensors by overwhelming random sequences and permutations. In Proceedings of the 17th ACM conference on Computer and communications security. ACM. doi:10.1145/1866307.1866392DOI: 10.1145/1866307.1866392
Information security for sensors by overwhelming random sequences and permutations (Conference Paper)
Dolev, S., Gilboa, N., Kopeetsky, M., Persiano, G., & Spirakis, P. G. (2010). Information security for sensors by overwhelming random sequences and permutations. In Proceedings of the 6th International Workshop on Foundations of Mobile Computing. ACM. doi:10.1145/1860684.1860694DOI: 10.1145/1860684.1860694
Sharp thresholds for Hamiltonicity in random intersection graphs (Journal article)
Efthymiou, C., & Spirakis, P. G. (2010). Sharp thresholds for Hamiltonicity in random intersection graphs. Theoretical Computer Science, 411(40-42), 3714-3730. doi:10.1016/j.tcs.2010.06.022DOI: 10.1016/j.tcs.2010.06.022
Well Supported Approximate Equilibria in Bimatrix Games (Journal article)
Kontogiannis, S. C., & Spirakis, P. G. (2010). Well Supported Approximate Equilibria in Bimatrix Games. Algorithmica, 57(4), 653-667. doi:10.1007/s00453-008-9227-6DOI: 10.1007/s00453-008-9227-6
Atomic Congestion Games: Fast, Myopic and Concurrent (Journal article)
Fotakis, D., Kaporis, A. C., & Spirakis, P. G. (2010). Atomic Congestion Games: Fast, Myopic and Concurrent. Theory of Computing Systems, 47(1), 38-59. doi:10.1007/s00224-009-9198-2DOI: 10.1007/s00224-009-9198-2
Brief announcement (Conference Paper)
Chatzigiannakis, I., Mylonas, G., Akribopoulos, O., Logaras, M., Kokkinos, P., & Spirakis, P. (2010). Brief announcement. In Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures. ACM. doi:10.1145/1810479.1810495DOI: 10.1145/1810479.1810495
Session details: Computing despite an adversary (Conference Paper)
Spirakis, P. (2010). Session details: Computing despite an adversary. In Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures. ACM. doi:10.1145/3254392DOI: 10.1145/3254392
Session details: Graph algorithms (Conference Paper)
Spirakis, P. (2010). Session details: Graph algorithms. In Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures. ACM. doi:10.1145/3254402DOI: 10.1145/3254402
Game authority for robust and scalable distributed selfish-computer systems (Journal article)
Dolev, S., Schiller, E. M., Spirakis, P. G., & Tsigas, P. (2010). Game authority for robust and scalable distributed selfish-computer systems. Theoretical Computer Science, 411(26-28), 2459-2466. doi:10.1016/j.tcs.2010.02.014DOI: 10.1016/j.tcs.2010.02.014
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
Trust in Global Computing Systems as a Limit Property Emerging from Short Range Random Interactions (Chapter)
Liagkou, V., Spirakis, P., C., Y., & Makri, E. (n.d.). Trust in Global Computing Systems as a Limit Property Emerging from Short Range Random Interactions. In Ambient Intelligence. InTech. doi:10.5772/8679DOI: 10.5772/8679
The "Hot Potato" Case: Challenges in Multiplayer Pervasive Games Based on Ad hoc Mobile Sensor Networks and the Experimental Evaluation of a Prototype Game (Preprint)
DOI: 10.48550/arxiv.1002.1099
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/
The Impact of Social Ignorance on Weighted Congestion Games (Chapter)
Fotakis, D., Gkatzelis, V., Kaporis, A. C., & Spirakis, P. G. (2009). The Impact of Social Ignorance on Weighted Congestion Games. In Lecture Notes in Computer Science (pp. 316-327). Springer Berlin Heidelberg. doi:10.1007/978-3-642-10841-9_29DOI: 10.1007/978-3-642-10841-9_29
Combinatorial properties for efficient communication in distributed networks with local interactions (Conference Paper)
Nikoletseas, S., Raptopoulos, C., & Spirakis, P. G. (2009). Combinatorial properties for efficient communication in distributed networks with local interactions. In 2009 IEEE International Symposium on Parallel & Distributed Processing. IEEE. doi:10.1109/ipdps.2009.5161002DOI: 10.1109/ipdps.2009.5161002
Computational Game Theory (Chapter)
Spirakis, P., & Panagopoulou, P. (2009). Computational Game Theory. In Chapman & Hall/CRC Applied Algorithms and Data Structures series (pp. 1-27). Chapman and Hall/CRC. doi:10.1201/9781584888215-c21DOI: 10.1201/9781584888215-c21
Computational game theory: An introduction (Chapter)
Spirakis, P. G., & Panagopoulou, P. N. (2009). Computational game theory: An introduction. In Algorithms and Theory of Computation Handbook, Second Edition, Volume 2: Special Topics and Techniques (pp. 21.1-21.27).
Expander properties and the cover time of random intersection graphs (Journal article)
Nikoletseas, S., Raptopoulos, C., & Spirakis, P. G. (2009). Expander properties and the cover time of random intersection graphs. Theoretical Computer Science, 410(50), 5261-5272. doi:10.1016/j.tcs.2009.08.028DOI: 10.1016/j.tcs.2009.08.028
Efficient Methods for Selfish Network Design (Chapter)
Fotakis, D., Kaporis, A. C., & Spirakis, P. G. (2009). Efficient Methods for Selfish Network Design. In Automata, Languages and Programming (pp. 459-471). Springer Berlin Heidelberg. doi:10.1007/978-3-642-02930-1_38DOI: 10.1007/978-3-642-02930-1_38
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/
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 Unknown Conference (pp. 251-262). Springer Berlin Heidelberg. doi:10.1007/978-3-642-04128-0_22DOI: 10.1007/978-3-642-04128-0_22
Developing multiplayer pervasive games and networked interactive installations using ad hoc mobile sensor nets (Conference Paper)
Akribopoulos, O., Logaras, M., Vasilakis, N., Kokkinos, P., Mylonas, G., Chatzigiannakis, I., & Spirakis, P. (2009). Developing multiplayer pervasive games and networked interactive installations using ad hoc mobile sensor nets. In Proceedings of the International Conference on Advances in Computer Entertainment Technology. ACM. doi:10.1145/1690388.1690418DOI: 10.1145/1690388.1690418
Multiplayer pervasive games and networked interactive installations using ad hoc mobile sensor networks (Conference Paper)
Akribopoulos, O., Logaras, M., Vasilakis, N., Kokkinos, P., Mylonas, G., Chatzigiannakis, I., & Spirakis, P. (2009). Multiplayer pervasive games and networked interactive installations using ad hoc mobile sensor networks. In Proceedings of the International Conference on Advances in Computer Entertainment Technology. ACM. doi:10.1145/1690388.1690500DOI: 10.1145/1690388.1690500
Colouring Non-sparse Random Intersection Graphs (Chapter)
Nikoletseas, S., Raptopoulos, C., & Spirakis, P. G. (2009). Colouring Non-sparse Random Intersection Graphs. In Mathematical Foundations of Computer Science 2009 (pp. 600-611). Springer Berlin Heidelberg. doi:10.1007/978-3-642-03816-7_51DOI: 10.1007/978-3-642-03816-7_51
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/
The structure and complexity of Nash equilibria for a selfish routing game (Journal article)
Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., & Spirakis, P. (2009). The structure and complexity of Nash equilibria for a selfish routing game. Theoretical Computer Science, 410(36), 3305-3326. doi:10.1016/j.tcs.2008.01.004DOI: 10.1016/j.tcs.2008.01.004
A glimpse at Christos H. Papadimitriou (Journal article)
Mavronicolas, M., & Spirakis, P. G. (2009). A glimpse at Christos H. Papadimitriou. Computer Science Review, 3(2), 55-63. doi:10.1016/j.cosrev.2009.04.001DOI: 10.1016/j.cosrev.2009.04.001
A note on proofs of existence of Nash equilibria in finite strategic games, of two players (Journal article)
Spirakis, P. G. (2009). A note on proofs of existence of Nash equilibria in finite strategic games, of two players. Computer Science Review, 3(2), 101-103. doi:10.1016/j.cosrev.2009.03.002DOI: 10.1016/j.cosrev.2009.03.002
Polynomial algorithms for approximating Nash equilibria of bimatrix games (Journal article)
Kontogiannis, S. C., Panagopoulou, P. N., & Spirakis, P. G. (2009). Polynomial algorithms for approximating Nash equilibria of bimatrix games. Theoretical Computer Science, 410(17), 1599-1606. doi:10.1016/j.tcs.2008.12.033DOI: 10.1016/j.tcs.2008.12.033
Preface (Journal article)
Spirakis, P. G., Mavronicolas, M., & Kontogiannis, S. C. (2009). Preface. Theoretical Computer Science, 410(17), 1551. doi:10.1016/j.tcs.2008.12.026DOI: 10.1016/j.tcs.2008.12.026
On the support size of stable strategies in random games (Journal article)
Kontogiannis, S. C., & Spirakis, P. G. (2009). On the support size of stable strategies in random games. Theoretical Computer Science, 410(8-10), 933-942. doi:10.1016/j.tcs.2008.12.056DOI: 10.1016/j.tcs.2008.12.056
Probabilistic Distributed Algorithms for Energy Efficient Routing and Tracking in Wireless Sensor Networks (Journal article)
Nikoletseas, S., & Spirakis, P. (n.d.). Probabilistic Distributed Algorithms for Energy Efficient Routing and Tracking in Wireless Sensor Networks. Algorithms, 2(1), 121-157. doi:10.3390/a2010121DOI: 10.3390/a2010121
The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions (Journal article)
Kaporis, A. C., & Spirakis, P. G. (2009). The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions. Theoretical Computer Science, 410(8-10), 745-755. doi:10.1016/j.tcs.2008.11.002DOI: 10.1016/j.tcs.2008.11.002
Computing on a partially eponymous ring (Journal article)
Mavronicolas, M., Michael, L., & Spirakis, P. (2009). Computing on a partially eponymous ring. Theoretical Computer Science, 410(6-7), 595-613. doi:10.1016/j.tcs.2008.10.010DOI: 10.1016/j.tcs.2008.10.010
Brief Announcement: Decidable Graph Languages by Mediated Population Protocols (Chapter)
Chatzigiannakis, I., Michail, O., & Spirakis, P. G. (2009). Brief Announcement: Decidable Graph Languages by Mediated Population Protocols. In Lecture Notes in Computer Science (pp. 239-240). Springer Berlin Heidelberg. doi:10.1007/978-3-642-04355-0_24DOI: 10.1007/978-3-642-04355-0_24
Preface to special issue on cooperation in selfish systems (Journal article)
Hales, D., Edmonds, B., Babaoglu, O., & Spirakis, P. (2009). Preface to special issue on cooperation in selfish systems. Computational and Mathematical Organization Theory, 15(2), 61-63. doi:10.1007/s10588-008-9054-yDOI: 10.1007/s10588-008-9054-y
The survival of the weakest in networks (Journal article)
Nikoletseas, S., Raptopoulos, C., & Spirakis, P. (2009). The survival of the weakest in networks. Computational and Mathematical Organization Theory, 15(2), 127-146. doi:10.1007/s10588-008-9050-2DOI: 10.1007/s10588-008-9050-2
2008
Adaptive probabilistic secure routing in mobile wireless sensor networks (Conference Paper)
Bairaktaris, K., Chatzigiannakis, I., Liagkou, V., & Spirakis, P. G. (2008). Adaptive probabilistic secure routing in mobile wireless sensor networks. In 2008 16th International Conference on Software, Telecommunications and Computer Networks. IEEE. doi:10.1109/softcom.2008.4669481DOI: 10.1109/softcom.2008.4669481
Brief announcement: Scheduling tasks with dependencies on asymmetric multiprocessors (Conference Paper)
Chatzigiannakis, I., Giannoulis, G., & Spirakis, P. G. (2008). Brief announcement: Scheduling tasks with dependencies on asymmetric multiprocessors. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (pp. 454).
A Game Theoretic Approach for Efficient Graph Coloring (Chapter)
Panagopoulou, P. N., & Spirakis, P. G. (2008). A Game Theoretic Approach for Efficient Graph Coloring. In Algorithms and Computation (pp. 183-195). Springer Berlin Heidelberg. doi:10.1007/978-3-540-92182-0_19DOI: 10.1007/978-3-540-92182-0_19
A step-wise refinement approach for enhancing e-voting acceptance (Conference Paper)
Manolopoulos, C., Sofotassios, D., Nakou, P., Stamatiou, Y., Panagiotaki, A., & Spirakis, P. (2008). A step-wise refinement approach for enhancing e-voting acceptance. In Proceedings of the 2nd international conference on Theory and practice of electronic governance. ACM. doi:10.1145/1509096.1509153DOI: 10.1145/1509096.1509153
A trusted architectural model for interconnecting testbeds of wireless sensor networks (Conference Paper)
Chatzigiannakis, I., Liagkou, V., & Spirakis, P. G. (2008). A trusted architectural model for interconnecting testbeds of wireless sensor networks. In Proceedings Elmar - International Symposium Electronics in Marine Vol. 2 (pp. 515-518).
Equilibrium Points in Fear of Correlated Threats (Chapter)
Kontogiannis, S. C., & Spirakis, P. G. (2008). Equilibrium Points in Fear of Correlated Threats. In Lecture Notes in Computer Science (pp. 210-221). Springer Berlin Heidelberg. doi:10.1007/978-3-540-92185-1_28DOI: 10.1007/978-3-540-92185-1_28
Performance Evaluation of a Descent Algorithm for Bi-matrix Games (Chapter)
Tsaknakis, H., Spirakis, P. G., & Kanoulas, D. (2008). Performance Evaluation of a Descent Algorithm for Bi-matrix Games. In Lecture Notes in Computer Science (pp. 222-230). Springer Berlin Heidelberg. doi:10.1007/978-3-540-92185-1_29DOI: 10.1007/978-3-540-92185-1_29
The Dynamics of Adaptive Networked Societies of Tiny Artefacts (Conference Paper)
Chatzigiannakis, I., & Spirakis, P. G. (2008). The Dynamics of Adaptive Networked Societies of Tiny Artefacts. In 2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops. IEEE. doi:10.1109/sasow.2008.45DOI: 10.1109/sasow.2008.45
A Security Model for Internet-Based Digital Asset Management Systems (Chapter)
Chatzigiannakis, I., Liagkou, V., Salouros, D., & Spirakis, P. (n.d.). A Security Model for Internet-Based Digital Asset Management Systems. In Software Architecture (pp. 326-329). Springer Berlin Heidelberg. doi:10.1007/978-3-540-88030-1_29DOI: 10.1007/978-3-540-88030-1_29
Large independent sets in general random intersection graphs (Journal article)
Nikoletseas, S., Raptopoulos, C., & Spirakis, P. (2008). Large independent sets in general random intersection graphs. Theoretical Computer Science, 406(3), 215-224. doi:10.1016/j.tcs.2008.06.047DOI: 10.1016/j.tcs.2008.06.047
Cost Sharing Mechanisms for Fair Pricing of Resource Usage (Journal article)
Mavronicolas, M., Panagopoulou, P. N., & Spirakis, P. G. (2008). Cost Sharing Mechanisms for Fair Pricing of Resource Usage. Algorithmica, 52(1), 19-43. doi:10.1007/s00453-007-9108-4DOI: 10.1007/s00453-007-9108-4
Efficient Sensor Network Design for Continuous Monitoring of Moving Objects (Chapter)
Nikoletseas, S., & Spirakis, P. G. (n.d.). Efficient Sensor Network Design for Continuous Monitoring of Moving Objects. In Algorithmic Aspects of Wireless Sensor Networks (pp. 18-31). Springer Berlin Heidelberg. doi:10.1007/978-3-540-77871-4_4DOI: 10.1007/978-3-540-77871-4_4
Full and Local Information in Distributed Decision Making (Chapter)
Panagopoulou, P. N., & Spirakis, P. G. (n.d.). Full and Local Information in Distributed Decision Making. In Approximation and Online Algorithms (pp. 156-169). Springer Berlin Heidelberg. doi:10.1007/978-3-540-77918-6_13DOI: 10.1007/978-3-540-77918-6_13
Optimal Algorithms for Detecting Network Stability (Chapter)
Koukopoulos, D., Nikolopoulos, S. D., Palios, L., & Spirakis, P. G. (n.d.). Optimal Algorithms for Detecting Network Stability. In WALCOM: Algorithms and Computation (pp. 188-199). Springer Berlin Heidelberg. doi:10.1007/978-3-540-77891-2_18DOI: 10.1007/978-3-540-77891-2_18
Scheduling tasks with dependencies on asymmetric multiprocessors (Conference Paper)
Chatzigiannakis, I., Giannoulis, G., & Spirakis, P. (2008). Scheduling tasks with dependencies on asymmetric multiprocessors. In Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing. ACM. doi:10.1145/1400751.1400851DOI: 10.1145/1400751.1400851
Atomic congestion games among coalitions (Journal article)
Fotakis, D., Kontogiannis, S., & Spirakis, P. (2008). Atomic congestion games among coalitions. ACM Transactions on Algorithms, 4(4), 1-27. doi:10.1145/1383369.1383383DOI: 10.1145/1383369.1383383
Efficient sensor network design for continuous monitoring of moving objects (Journal article)
Nikoletseas, S., & Spirakis, P. (2008). Efficient sensor network design for continuous monitoring of moving objects. Theoretical Computer Science, 402(1), 56-66. doi:10.1016/j.tcs.2008.03.005DOI: 10.1016/j.tcs.2008.03.005
A Network Game with Attackers and a Defender (Journal article)
Mavronicolas, M., Papadopoulou, V., Philippou, A., & Spirakis, P. (2008). A Network Game with Attackers and a Defender. Algorithmica, 51(3), 315-341. doi:10.1007/s00453-007-9109-3DOI: 10.1007/s00453-007-9109-3
Myopic Distributed Protocols for Singleton and Independent-Resource Congestion Games (Chapter)
Kalles, D., Kaporis, A. C., & Spirakis, P. G. (n.d.). Myopic Distributed Protocols for Singleton and Independent-Resource Congestion Games. In Experimental Algorithms (pp. 181-193). Springer Berlin Heidelberg. doi:10.1007/978-3-540-68552-4_14DOI: 10.1007/978-3-540-68552-4_14
Approximate Equilibria for Strategic Two Person Games (Chapter)
Spirakis, P. G. (2008). Approximate Equilibria for Strategic Two Person Games. In Algorithmic Game Theory (pp. 5-21). Springer Berlin Heidelberg. doi:10.1007/978-3-540-79309-0_3DOI: 10.1007/978-3-540-79309-0_3
Atomic Congestion Games: Fast, Myopic and Concurrent (Chapter)
Fotakis, D., Kaporis, A. C., & Spirakis, P. G. (2008). Atomic Congestion Games: Fast, Myopic and Concurrent. In Algorithmic Game Theory (pp. 121-132). Springer Berlin Heidelberg. doi:10.1007/978-3-540-79309-0_12DOI: 10.1007/978-3-540-79309-0_12
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
Algorithmic Game Theory and Applications (Chapter)
Mavronicolas, M., Papadopoulou, V., & Spirakis, P. (2008). Algorithmic Game Theory and Applications. In Unknown Book (pp. 287-315). Wiley. doi:10.1002/9780470175668.ch10DOI: 10.1002/9780470175668.ch10
A graph-theoretic network security game (Journal article)
Mavronicolas, M., Papadopoulou, V. G., Philippou, A., & Spirakis, P. G. (2008). A graph-theoretic network security game. International Journal of Autonomous and Adaptive Communications Systems, 1(4), 390. doi:10.1504/ijaacs.2008.021488DOI: 10.1504/ijaacs.2008.021488
An Optimization Approach for Approximate Nash Equilibria (Journal article)
Tsaknakis, H., & Spirakis, P. G. (2008). An Optimization Approach for Approximate Nash Equilibria. Internet Mathematics, 5(4), 365-382. doi:10.1080/15427951.2008.10129172DOI: 10.1080/15427951.2008.10129172
Approximations of Bimatrix Nash Equilibria (Chapter)
Kontogiannis, S., Panagopoulou, P., & Spirakis, P. (2008). Approximations of Bimatrix Nash Equilibria. In Encyclopedia of Algorithms (pp. 53-57). Springer US. doi:10.1007/978-0-387-30162-4_30DOI: 10.1007/978-0-387-30162-4_30
Best Response Algorithms for Selfish Routing (Chapter)
Spirakis, P. (2008). Best Response Algorithms for Selfish Routing. In Encyclopedia of Algorithms (pp. 86-88). Springer US. doi:10.1007/978-0-387-30162-4_46DOI: 10.1007/978-0-387-30162-4_46
Cost-Balancing Tolls for Atomic Network Congestion Games (Journal article)
Fotakis, D., & Spirakis, P. G. (2008). Cost-Balancing Tolls for Atomic Network Congestion Games. Internet Mathematics, 5(4), 343-363. doi:10.1080/15427951.2008.10129175DOI: 10.1080/15427951.2008.10129175
Hamilton Cycles in Random Intersection Graphs (Chapter)
Efthymiou, C., & Spirakis, P. (2008). Hamilton Cycles in Random Intersection Graphs. In Encyclopedia of Algorithms (pp. 383-385). Springer US. doi:10.1007/978-0-387-30162-4_176DOI: 10.1007/978-0-387-30162-4_176
Independent Sets in Random Intersection Graphs (Chapter)
Nikoletseas, S., Raptopoulos, C., & Spirakis, P. (2008). Independent Sets in Random Intersection Graphs. In Encyclopedia of Algorithms (pp. 405-408). Springer US. doi:10.1007/978-0-387-30162-4_187DOI: 10.1007/978-0-387-30162-4_187
Minimum Congestion Redundant Assignments (Chapter)
Fotakis, D., & Spirakis, P. (2008). Minimum Congestion Redundant Assignments. In Encyclopedia of Algorithms (pp. 522-526). Springer US. doi:10.1007/978-0-387-30162-4_232DOI: 10.1007/978-0-387-30162-4_232
Preface (Journal article)
Spirakis, P. G. (2008). Preface. Theory of Computing Systems, 42(1), 1. doi:10.1007/s00224-007-9012-yDOI: 10.1007/s00224-007-9012-y
Selfish Unsplittable Flows: Algorithms for Pure Equilibria (Chapter)
Spirakis, P. (2008). Selfish Unsplittable Flows: Algorithms for Pure Equilibria. In Encyclopedia of Algorithms (pp. 810-811). Springer US. doi:10.1007/978-0-387-30162-4_360DOI: 10.1007/978-0-387-30162-4_360
Stackelberg Games: The Price of Optimum (Chapter)
Kaporis, A., & Spirakis, P. (2008). Stackelberg Games: The Price of Optimum. In Encyclopedia of Algorithms (pp. 888-892). Springer US. doi:10.1007/978-0-387-30162-4_398DOI: 10.1007/978-0-387-30162-4_398
Strategies for repeated games with subsystem takeovers: implementable by deterministic and self-stabilizing automata (extended abstract) (Conference Paper)
Dolev, S., Schiller, E. M., Spirakis, P. G., & Tsigas, P. (2008). Strategies for repeated games with subsystem takeovers: implementable by deterministic and self-stabilizing automata (extended abstract). In Proceedings of the 2nd International ICST Conference on Autonomic Computing and Communication Systems. ICST. doi:10.4108/icst.autonomics2008.4626DOI: 10.4108/icst.autonomics2008.4626
Tail Bounds for Occupancy Problems (Chapter)
Spirakis, P. (2008). Tail Bounds for Occupancy Problems. In Encyclopedia of Algorithms (pp. 942-944). Springer US. doi:10.1007/978-0-387-30162-4_419DOI: 10.1007/978-0-387-30162-4_419
The Dynamics of Probabilistic Population Protocols (Chapter)
Chatzigiannakis, I., & Spirakis, P. G. (n.d.). The Dynamics of Probabilistic Population Protocols. In Lecture Notes in Computer Science (pp. 498-499). Springer Berlin Heidelberg. doi:10.1007/978-3-540-87779-0_35DOI: 10.1007/978-3-540-87779-0_35
Weighted Random Sampling (Chapter)
Efraimidis, P., & Spirakis, P. (2008). Weighted Random Sampling. In Encyclopedia of Algorithms (pp. 1024-1027). Springer US. doi:10.1007/978-0-387-30162-4_478DOI: 10.1007/978-0-387-30162-4_478
2007
Atomic Selfish Routing in Networks (Chapter)
Kontogiannis, S., & Spirakis, P. (2007). Atomic Selfish Routing in Networks. In Handbook of Parallel Computing. Chapman and Hall/CRC. doi:10.1201/9781420011296.ch20DOI: 10.1201/9781420011296.ch20
Agent-based Distributed Group Key Establishment in Wireless Sensor Networks (Conference Paper)
Chatzigiannakis, I., Konstantinou, E., Liagkou, V., & Spirakis, P. (2007). Agent-based Distributed Group Key Establishment in Wireless Sensor Networks. In 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks. IEEE. doi:10.1109/wowmom.2007.4351807DOI: 10.1109/wowmom.2007.4351807
Trust in global computing systems as a limit property emerging from short range random interactions (Conference Paper)
Liagkou, V., Makri, E., Spirakis, P., & Stamatiou, Y. C. (2007). Trust in global computing systems as a limit property emerging from short range random interactions. In The Second International Conference on Availability, Reliability and Security (ARES'07). IEEE. doi:10.1109/ares.2007.154DOI: 10.1109/ares.2007.154
The increase of the instability of networks due to Quasi-Static link capacities (Journal article)
Koukopoulos, D., Mavronicolas, M., & Spirakis, P. (2007). The increase of the instability of networks due to Quasi-Static link capacities. Theoretical Computer Science, 381(1-3), 44-56. doi:10.1016/j.tcs.2007.04.008DOI: 10.1016/j.tcs.2007.04.008
Game authority for robust andscalable distributed selfish-computer systems (Conference Paper)
Dolev, S., Schiller, E. M., Spirakis, P. G., & Tsigas, P. (2007). Game authority for robust andscalable distributed selfish-computer systems. In Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing. ACM. doi:10.1145/1281100.1281171DOI: 10.1145/1281100.1281171
The Price of Selfish Routing (Journal article)
Mavronicolas, M., & Spirakis, P. (2007). The Price of Selfish Routing. Algorithmica, 48(1), 91-126. doi:10.1007/s00453-006-0056-1DOI: 10.1007/s00453-006-0056-1
Randomized Approximation Techniques (Chapter)
Spirakis, P., & Nikoletseas, S. (2007). Randomized Approximation Techniques. In Chapman & Hall/CRC Computer & Information Science Series. Chapman and Hall/CRC. doi:10.1201/9781420010749.ch12DOI: 10.1201/9781420010749.ch12
Design, Analysis and Performance Evaluation of Group Key Establishment in Wireless Sensor Networks (Journal article)
Chatzigiannakis, I., Konstantinou, E., Liagkou, V., & Spirakis, P. (2007). Design, Analysis and Performance Evaluation of Group Key Establishment in Wireless Sensor Networks. Electronic Notes in Theoretical Computer Science, 171(1), 17-31. doi:10.1016/j.entcs.2006.11.007DOI: 10.1016/j.entcs.2006.11.007
Performance and stability bounds for dynamic networks (Journal article)
Koukopoulos, D., Mavronicolas, M., & Spirakis, P. (2007). Performance and stability bounds for dynamic networks. Journal of Parallel and Distributed Computing, 67(4), 386-399. doi:10.1016/j.jpdc.2006.11.005DOI: 10.1016/j.jpdc.2006.11.005
Algorithms for pure Nash equilibria in weighted congestion games (Journal article)
Panagopoulou, P. N., & Spirakis, P. G. (2007). Algorithms for pure Nash equilibria in weighted congestion games. ACM Journal of Experimental Algorithmics, 11. doi:10.1145/1187436.1216584DOI: 10.1145/1187436.1216584
A Trust-Centered Approach for Building E-Voting Systems (Chapter)
Antoniou, A., Korakas, C., Manolopoulos, C., Panagiotaki, A., Sofotassios, D., Spirakis, P., & Stamatiou, Y. C. (n.d.). A Trust-Centered Approach for Building E-Voting Systems. In Lecture Notes in Computer Science (pp. 366-377). Springer Berlin Heidelberg. doi:10.1007/978-3-540-74444-3_31DOI: 10.1007/978-3-540-74444-3_31
An Optimization Approach for Approximate Nash Equilibria (Chapter)
Tsaknakis, H., & Spirakis, P. G. (n.d.). An Optimization Approach for Approximate Nash Equilibria. In Lecture Notes in Computer Science (pp. 42-56). Springer Berlin Heidelberg. doi:10.1007/978-3-540-77105-0_8DOI: 10.1007/978-3-540-77105-0_8
Cost-Balancing Tolls for Atomic Network Congestion Games (Chapter)
Fotakis, D., & Spirakis, P. G. (n.d.). Cost-Balancing Tolls for Atomic Network Congestion Games. In Lecture Notes in Computer Science (pp. 179-190). Springer Berlin Heidelberg. doi:10.1007/978-3-540-77105-0_19DOI: 10.1007/978-3-540-77105-0_19
Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games (Chapter)
Kontogiannis, S. C., & Spirakis, P. G. (n.d.). Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games. In Automata, Languages and Programming (pp. 595-606). Springer Berlin Heidelberg. doi:10.1007/978-3-540-73420-8_52DOI: 10.1007/978-3-540-73420-8_52
Expander Properties and the Cover Time of Random Intersection Graphs (Chapter)
Nikoletseas, S. E., Raptopoulos, C., & Spirakis, P. G. (n.d.). Expander Properties and the Cover Time of Random Intersection Graphs. In Mathematical Foundations of Computer Science 2007 (pp. 44-55). Springer Berlin Heidelberg. doi:10.1007/978-3-540-74456-6_6DOI: 10.1007/978-3-540-74456-6_6
Handbook of Approximation Algorithms and Metaheuristics (Chapter)
Gonzalez, T. F. (Ed.) (n.d.). Handbook of Approximation Algorithms and Metaheuristics. In . Chapman and Hall/CRC. doi:10.1201/9781420010749DOI: 10.1201/9781420010749
Handbook of Parallel Computing (Chapter)
Rajasekaran, S., & Reif, J. (Eds.) (n.d.). Handbook of Parallel Computing. In . Chapman and Hall/CRC. doi:10.1201/9781420011296DOI: 10.1201/9781420011296
On the Support Size of Stable Strategies in Random Games (Chapter)
Kontogiannis, S. C., & Spirakis, P. G. (n.d.). On the Support Size of Stable Strategies in Random Games. In Stochastic Algorithms: Foundations and Applications (pp. 154-165). Springer Berlin Heidelberg. doi:10.1007/978-3-540-74871-7_14DOI: 10.1007/978-3-540-74871-7_14
Probabilistic Techniques in Algorithmic Game Theory (Chapter)
Kontogiannis, S. C., & Spirakis, P. G. (n.d.). Probabilistic Techniques in Algorithmic Game Theory. In Stochastic Algorithms: Foundations and Applications (pp. 30-53). Springer Berlin Heidelberg. doi:10.1007/978-3-540-74871-7_4DOI: 10.1007/978-3-540-74871-7_4
Selfish Load Balancing Under Partial Knowledge (Chapter)
Koutsoupias, E., Panagopoulou, P. N., & Spirakis, P. G. (n.d.). Selfish Load Balancing Under Partial Knowledge. In Mathematical Foundations of Computer Science 2007 (pp. 609-620). Springer Berlin Heidelberg. doi:10.1007/978-3-540-74456-6_54DOI: 10.1007/978-3-540-74456-6_54
The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs (Chapter)
Nikoletseas, S., Raptopoulos, C., & Spirakis, P. G. (n.d.). The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs. In Algebraic Informatics (pp. 236-246). Springer Berlin Heidelberg. doi:10.1007/978-3-540-75414-5_15DOI: 10.1007/978-3-540-75414-5_15
The Survival of the Weakest in Networks (Chapter)
Nikoletseas, S., Raptopoulos, C., & Spirakis, P. (2007). The Survival of the Weakest in Networks. In Approximation and Online Algorithms (pp. 316-329). Springer Berlin Heidelberg. doi:10.1007/11970125_25DOI: 10.1007/11970125_25
Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach (Chapter)
Kontogiannis, S. C., & Spirakis, P. G. (n.d.). Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach. In Mathematical Foundations of Computer Science 2007 (pp. 596-608). Springer Berlin Heidelberg. doi:10.1007/978-3-540-74456-6_53DOI: 10.1007/978-3-540-74456-6_53
2006
Internet and network economics: Preface (Book)
Spirakis, P., Mavronicolas, M., & Kontogiannis, S. (2006). Internet and network economics: Preface (Vol. 4286 LNCS).
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games (Chapter)
Kontogiannis, S. C., Panagopoulou, P. N., & Spirakis, P. G. (2006). Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games. In Lecture Notes in Computer Science (pp. 286-296). Springer Berlin Heidelberg. doi:10.1007/11944874_26DOI: 10.1007/11944874_26
The Price of Defense and Fractional Matchings (Chapter)
Mavronicolas, M., Papadopoulou, V., Persiano, G., Philippou, A., & Spirakis, P. (2006). The Price of Defense and Fractional Matchings. In Distributed Computing and Networking (pp. 115-126). Springer Berlin Heidelberg. doi:10.1007/11947950_13DOI: 10.1007/11947950_13
The Threshold Behaviour of the Fixed Radius Random Graph Model and Applications to the Key Management Problem of Sensor Networks (Chapter)
Liagkou, V., Makri, E., Spirakis, P., & Stamatiou, Y. C. (2006). The Threshold Behaviour of the Fixed Radius Random Graph Model and Applications to the Key Management Problem of Sensor Networks. In Algorithmic Aspects of Wireless Sensor Networks (pp. 130-139). Springer Berlin Heidelberg. doi:10.1007/11963271_12DOI: 10.1007/11963271_12
The infection time of graphs (Journal article)
Dimitriou, T., Nikoletseas, S., & Spirakis, P. (2006). The infection time of graphs. Discrete Applied Mathematics, 154(18), 2577-2589. doi:10.1016/j.dam.2006.04.026DOI: 10.1016/j.dam.2006.04.026
A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks (Journal article)
Chatzigiannakis, I., Dimitriou, T., Nikoletseas, S., & Spirakis, P. (2006). A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks. Ad Hoc Networks, 4(5), 621-635. doi:10.1016/j.adhoc.2005.06.006DOI: 10.1016/j.adhoc.2005.06.006
Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies (Journal article)
Fotakis, D. A., Nikoletseas, S. E., Papadopoulou, V. G., & Spirakis, P. G. (2006). Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies. Journal of Discrete Algorithms, 4(3), 433-454. doi:10.1016/j.jda.2005.12.007DOI: 10.1016/j.jda.2005.12.007
Approximation schemes for scheduling and covering on unrelated machines (Journal article)
Efraimidis, P. S., & Spirakis, P. G. (2006). Approximation schemes for scheduling and covering on unrelated machines. Theoretical Computer Science, 359(1-3), 400-417. doi:10.1016/j.tcs.2006.05.025DOI: 10.1016/j.tcs.2006.05.025
The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions (Conference Paper)
Kaporis, A. C., & Spirakis, P. G. (2006). The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions. In Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures. ACM. doi:10.1145/1148109.1148113DOI: 10.1145/1148109.1148113
Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost (Chapter)
Fotakis, D., Kontogiannis, S., & Spirakis, P. (2006). Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost. In Approximation and Online Algorithms (pp. 161-175). Springer Berlin Heidelberg. doi:10.1007/11671411_13DOI: 10.1007/11671411_13
Keynote Talk Summary: Algorithmic Aspects of Sensor Networks (Chapter)
Spirakis, P. (2006). Keynote Talk Summary: Algorithmic Aspects of Sensor Networks. In Lecture Notes in Computer Science (pp. 277). Springer Berlin Heidelberg. doi:10.1007/11687818_23DOI: 10.1007/11687818_23
Direct routing: Algorithms and complexity (Journal article)
Busch, C., Magdon-Ismail, M., Mavronicolas, M., & Spirakis, P. (2006). Direct routing: Algorithms and complexity. Algorithmica, 45(1), 45-68. doi:10.1007/s00453-005-1189-3DOI: 10.1007/s00453-005-1189-3
INTRODUCTION (Journal article)
Monien, B., Gao, G., Simon, H., Spirakis, P., & Stenström, P. (2006). INTRODUCTION. Journal of Parallel and Distributed Computing, 66(5), 615-616. doi:10.1016/j.jpdc.2005.06.006DOI: 10.1016/j.jpdc.2005.06.006
Weighted random sampling with a reservoir (Journal article)
Efraimidis, P. S., & Spirakis, P. G. (2006). Weighted random sampling with a reservoir. Information Processing Letters, 97(5), 181-185. doi:10.1016/j.ipl.2005.11.003DOI: 10.1016/j.ipl.2005.11.003
A Cost Mechanism for Fair Pricing of Resource Usage (Chapter)
Mavronicolas, M., Panagopoulou, P. N., & Spirakis, P. G. (2005). A Cost Mechanism for Fair Pricing of Resource Usage. In Lecture Notes in Computer Science (pp. 210-224). Springer Berlin Heidelberg. doi:10.1007/11600930_21DOI: 10.1007/11600930_21
Atomic Congestion Games Among Coalitions (Chapter)
Fotakis, D., Kontogiannis, S., & Spirakis, P. (2006). Atomic Congestion Games Among Coalitions. In Automata, Languages and Programming (pp. 572-583). Springer Berlin Heidelberg. doi:10.1007/11786986_50DOI: 10.1007/11786986_50
Computing on a Partially Eponymous Ring (Chapter)
Mavronicolas, M., Michael, L., & Spirakis, P. (2006). Computing on a Partially Eponymous Ring. In Lecture Notes in Computer Science (pp. 380-394). Springer Berlin Heidelberg. doi:10.1007/11945529_27DOI: 10.1007/11945529_27
The Power of the Defender (Conference Paper)
Gelastou, M., Mavronicolas, M., Papadopoulou, V., Philippou, A., & Spirakis, P. (2006). The Power of the Defender. In 26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06). IEEE. doi:10.1109/icdcsw.2006.107DOI: 10.1109/icdcsw.2006.107
The Price of Defense (Chapter)
Mavronicolas, M., Michael, L., Papadopoulou, V., Philippou, A., & Spirakis, P. (2006). The Price of Defense. In Lecture Notes in Computer Science (pp. 717-728). Springer Berlin Heidelberg. doi:10.1007/11821069_62DOI: 10.1007/11821069_62
2005
The chromatic and clique numbers of random scaled sector graphs (Journal article)
Díaz, J., Sanwalani, V., Serna, M., & Spirakis, P. G. (2005). The chromatic and clique numbers of random scaled sector graphs. Theoretical Computer Science, 349(1), 40-51. doi:10.1016/j.tcs.2005.09.050DOI: 10.1016/j.tcs.2005.09.050
Selfish unsplittable flows (Journal article)
Fotakis, D., Kontogiannis, S., & Spirakis, P. (2005). Selfish unsplittable flows. Theoretical Computer Science, 348(2-3), 226-239. doi:10.1016/j.tcs.2005.09.024DOI: 10.1016/j.tcs.2005.09.024
A Graph-Theoretic Network Security Game (Chapter)
Mavronicolas, M., Papadopoulou, V., Philippou, A., & Spirakis, P. (2005). A Graph-Theoretic Network Security Game. In Lecture Notes in Computer Science (pp. 969-978). Springer Berlin Heidelberg. doi:10.1007/11600930_98DOI: 10.1007/11600930_98
A cost mechanism for fair pricing of resource usage (Conference Paper)
Mavronicolas, M., Panagopoulou, P. N., & Spirakis, P. G. (2005). A cost mechanism for fair pricing of resource usage. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 3828 LNCS (pp. 210-224). doi:10.1007/11600930_21DOI: 10.1007/11600930_21
Annual ACM Symposium on Parallelism in Algorithms and Architectures: Preface (Conference Paper)
Spirakis, P. (2005). Annual ACM Symposium on Parallelism in Algorithms and Architectures: Preface. In Annual ACM Symposium on Parallelism in Algorithms and Architectures.
Atomic Selfish Routing in Networks: A Survey (Chapter)
Kontogiannis, S., & Spirakis, P. (2005). Atomic Selfish Routing in Networks: A Survey. In Lecture Notes in Computer Science (pp. 989-1002). Springer Berlin Heidelberg. doi:10.1007/11600930_100DOI: 10.1007/11600930_100
Counting Stable Strategies in Random Evolutionary Games (Chapter)
Kontogiannis, S., & Spirakis, P. (2005). Counting Stable Strategies in Random Evolutionary Games. In Algorithms and Computation (pp. 839-848). Springer Berlin Heidelberg. doi:10.1007/11602613_84DOI: 10.1007/11602613_84
Network Game with Attacker and Protector Entities (Chapter)
Mavronicolas, M., Papadopoulou, V., Philippou, A., & Spirakis, P. (2005). Network Game with Attacker and Protector Entities. In Algorithms and Computation (pp. 288-297). Springer Berlin Heidelberg. doi:10.1007/11602613_30DOI: 10.1007/11602613_30
Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection Graphs (Chapter)
Raptopoulos, C., & Spirakis, P. (2005). Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection Graphs. In Algorithms and Computation (pp. 493-504). Springer Berlin Heidelberg. doi:10.1007/11602613_50DOI: 10.1007/11602613_50
The Contribution of Game Theory to Complex Systems (Chapter)
Kontogiannis, S., & Spirakis, P. (2005). The Contribution of Game Theory to Complex Systems. In Advances in Informatics (pp. 101-111). Springer Berlin Heidelberg. doi:10.1007/11573036_10DOI: 10.1007/11573036_10
Distributed Algorithms for Some Fundamental Problems in Ad Hoc Mobile Environments (Chapter)
Nikoletseas, S., & Spirakis, P. (2005). Distributed Algorithms for Some Fundamental Problems in Ad Hoc Mobile Environments. In Handbook of Algorithms for Wireless Networking and Mobile Computing. Chapman and Hall/CRC. doi:10.1201/9781420035094.sec2DOI: 10.1201/9781420035094.sec2
Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control (Journal article)
Fatourou, P., Mavronicolas, M., & Spirakis, P. (2005). Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control. SIAM Journal on Computing, 34(5), 1216-1252. doi:10.1137/s009753970343275xDOI: 10.1137/s009753970343275x
Structure and complexity of extreme Nash equilibria (Journal article)
Gairing, M., Lücking, T., Mavronicolas, M., Monien, B., & Spirakis, P. (2005). Structure and complexity of extreme Nash equilibria. Theoretical Computer Science, 343(1-2), 133-157. doi:10.1016/j.tcs.2005.05.011DOI: 10.1016/j.tcs.2005.05.011
Radiocoloring in planar graphs: Complexity and approximations (Journal article)
Fotakis, D. A., Nikoletseas, S. E., Papadopoulou, V. G., & Spirakis, P. G. (2005). Radiocoloring in planar graphs: Complexity and approximations. Theoretical Computer Science, 340(3), 514-538. doi:10.1016/j.tcs.2005.03.013DOI: 10.1016/j.tcs.2005.03.013
Session details: Joint session (Conference Paper)
Spirakis, P. (2005). Session details: Joint session. In Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing. ACM. doi:10.1145/3259550DOI: 10.1145/3259550
The Impact of Network Structure on the Stability of Greedy Protocols (Journal article)
Koukopoulos, D., Mavronicolas, M., Nikoletseas, S., & Spirakis, P. (2005). The Impact of Network Structure on the Stability of Greedy Protocols. Theory of Computing Systems, 38(4), 425-460. doi:10.1007/s00224-004-1181-3DOI: 10.1007/s00224-004-1181-3
MAX-MIN FAIR FLOW CONTROL SENSITIVE TO PRIORITIES (Journal article)
FATOUROU, P., MAVRONICOLAS, M., & SPIRAKIS, P. (2005). MAX-MIN FAIR FLOW CONTROL SENSITIVE TO PRIORITIES. Journal of Interconnection Networks, 06(02), 85-114. doi:10.1142/s0219265905001332DOI: 10.1142/s0219265905001332
The cost of concurrent, low-contention Read&Modify&Write (Journal article)
Busch, C., Mavronicolas, M., & Spirakis, P. (2005). The cost of concurrent, low-contention Read&Modify&Write. Theoretical Computer Science, 333(3), 373-400. doi:10.1016/j.tcs.2004.04.018DOI: 10.1016/j.tcs.2004.04.018
Space Efficient Hash Tables with Worst Case Constant Access Time (Journal article)
Fotakis, D., Pagh, R., Sanders, P., & Spirakis, P. (2005). Space Efficient Hash Tables with Worst Case Constant Access Time. Theory of Computing Systems, 38(2), 229-248. doi:10.1007/s00224-004-1195-xDOI: 10.1007/s00224-004-1195-x
Efficient Convergence to Pure Nash Equilibria in Weighted Network Congestion Games (Chapter)
Panagopoulou, P. N., & Spirakis, P. G. (2005). Efficient Convergence to Pure Nash Equilibria in Weighted Network Congestion Games. In Experimental and Efficient Algorithms (pp. 203-215). Springer Berlin Heidelberg. doi:10.1007/11427186_19DOI: 10.1007/11427186_19
Efficient Information Propagation Algorithms in Smart Dust and NanoPeer Networks (Chapter)
Nikoletseas, S., & Spirakis, P. (2005). Efficient Information Propagation Algorithms in Smart Dust and NanoPeer Networks. In Global Computing (pp. 127-145). Springer Berlin Heidelberg. doi:10.1007/978-3-540-31794-4_8DOI: 10.1007/978-3-540-31794-4_8
Efficient and Robust Protocols for Local Detection and Propagation in Smart Dust Networks (Journal article)
Chatzigiannakis, I., Nikoletseas, S., & Spirakis, P. (2005). Efficient and Robust Protocols for Local Detection and Propagation in Smart Dust Networks. Mobile Networks and Applications, 10(1/2), 133-149. doi:10.1023/b:mone.0000048551.54039.f0DOI: 10.1023/b:mone.0000048551.54039.f0
Evolutionary Games: An Algorithmic View (Chapter)
Kontogiannis, S., & Spirakis, P. (2005). Evolutionary Games: An Algorithmic View. In Self-star Properties in Complex Information Systems (pp. 97-111). Springer Berlin Heidelberg. doi:10.1007/11428589_7DOI: 10.1007/11428589_7
Experimental Results for Stackelberg Scheduling Strategies (Chapter)
Kaporis, A. C., Kirousis, L. M., Politopoulou, E. I., & Spirakis, P. G. (2005). Experimental Results for Stackelberg Scheduling Strategies. In Experimental and Efficient Algorithms (pp. 77-88). Springer Berlin Heidelberg. doi:10.1007/11427186_9DOI: 10.1007/11427186_9
Generating and Radiocoloring Families of Perfect Graphs (Chapter)
Andreou, M. I., Papadopoulou, V. G., Spirakis, P. G., Theodorides, B., & Xeros, A. (2005). Generating and Radiocoloring Families of Perfect Graphs. In Experimental and Efficient Algorithms (pp. 302-314). Springer Berlin Heidelberg. doi:10.1007/11427186_27DOI: 10.1007/11427186_27
Handbook of Algorithms for Wireless Networking and Mobile Computing (Chapter)
Boukerche, A. (Ed.) (n.d.). Handbook of Algorithms for Wireless Networking and Mobile Computing. In . Chapman and Hall/CRC. doi:10.1201/9781420035094DOI: 10.1201/9781420035094
On the Existence of Hamiltonian Cycles in Random Intersection Graphs (Chapter)
Efthymiou, C., & Spirakis, P. G. (2005). On the Existence of Hamiltonian Cycles in Random Intersection Graphs. In Automata, Languages and Programming (pp. 690-701). Springer Berlin Heidelberg. doi:10.1007/11523468_56DOI: 10.1007/11523468_56
“Trust Engineering:” From Requirements to System Design and Maintenance – A Working National Lottery System Experience (Chapter)
Konstantinou, E., Liagkou, V., Spirakis, P., Stamatiou, Y. C., & Yung, M. (2005). “Trust Engineering:” From Requirements to System Design and Maintenance – A Working National Lottery System Experience. In Lecture Notes in Computer Science (pp. 44-58). Springer Berlin Heidelberg. doi:10.1007/11556992_4DOI: 10.1007/11556992_4
2004
A Comparative Study of Protocols for Efficient Data Propagation in Smart Dust Networks (Chapter)
Chatzigiannakis, I., Dimitriou, T., Mavronicolas, M., Nikoletseas, S., & Spirakis, P. (2003). A Comparative Study of Protocols for Efficient Data Propagation in Smart Dust Networks. In Euro-Par 2003 Parallel Processing (pp. 1003-1016). Springer Berlin Heidelberg. doi:10.1007/978-3-540-45209-6_138DOI: 10.1007/978-3-540-45209-6_138
Performance and stability bounds for dynamic networks (Conference Paper)
Koukopoulos, D., Mavronicolas, M., & Spirakis, P. (2004). Performance and stability bounds for dynamic networks. In 7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.. IEEE. doi:10.1109/ispan.2004.1300487DOI: 10.1109/ispan.2004.1300487
DISTRIBUTED COMMUNICATION ALGORITHMS FOR AD-HOC MOBILE NETWORKS (Chapter)
CHATZIGIANNAKIS, I., NIKOLETSEAS, S., & SPIRAKIS, P. (2004). DISTRIBUTED COMMUNICATION ALGORITHMS FOR AD-HOC MOBILE NETWORKS. In Current Trends in Theoretical Computer Science (pp. 337-372). WORLD SCIENTIFIC. doi:10.1142/9789812562494_0019DOI: 10.1142/9789812562494_0019
A hierarchical adaptive distributed algorithm for load balancing (Journal article)
Antonis, K., Garofalakis, J., Mourtos, I., & Spirakis, P. (2004). A hierarchical adaptive distributed algorithm for load balancing. Journal of Parallel and Distributed Computing, 64(1), 151-162. doi:10.1016/j.jpdc.2003.07.002DOI: 10.1016/j.jpdc.2003.07.002
Algorithmic and Foundational Aspects of Sensor Systems (Chapter)
Spirakis, P. G. (2004). Algorithmic and Foundational Aspects of Sensor Systems. In Algorithmic Aspects of Wireless Sensor Networks (pp. 3-8). Springer Berlin Heidelberg. doi:10.1007/978-3-540-27820-7_2DOI: 10.1007/978-3-540-27820-7_2
Algorithmic and foundational aspects of sensor systems (invited talk) (Journal article)
Spirakis, P. G. (2004). Algorithmic and foundational aspects of sensor systems (invited talk). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3121, 3-8. doi:10.1007/978-3-540-27820-7_2DOI: 10.1007/978-3-540-27820-7_2
Analysis of the Information Propagation Time Among Mobile Hosts (Chapter)
Dimitriou, T., Nikoletseas, S., & Spirakis, P. (2004). Analysis of the Information Propagation Time Among Mobile Hosts. In Ad-Hoc, Mobile, and Wireless Networks (pp. 122-134). Springer Berlin Heidelberg. doi:10.1007/978-3-540-28634-9_10DOI: 10.1007/978-3-540-28634-9_10
Direct Routing: Algorithms and Complexity (Chapter)
Busch, C., Magdon-Ismail, M., Mavronicolas, M., & Spirakis, P. (2004). Direct Routing: Algorithms and Complexity. In Algorithms – ESA 2004 (pp. 134-145). Springer Berlin Heidelberg. doi:10.1007/978-3-540-30140-0_14DOI: 10.1007/978-3-540-30140-0_14
Electronic National Lotteries (Chapter)
Konstantinou, E., Liagkou, V., Spirakis, P., Stamatiou, Y. C., & Yung, M. (2004). Electronic National Lotteries. In Financial Cryptography (pp. 147-163). Springer Berlin Heidelberg. doi:10.1007/978-3-540-27809-2_18DOI: 10.1007/978-3-540-27809-2_18
How to Tell a Good Neighborhood from a Bad One: Satisfiability of Boolean Formulas (Chapter)
Dimitriou, T., & Spirakis, P. (2004). How to Tell a Good Neighborhood from a Bad One: Satisfiability of Boolean Formulas. In Experimental and Efficient Algorithms (pp. 199-212). Springer Berlin Heidelberg. doi:10.1007/978-3-540-24838-5_15DOI: 10.1007/978-3-540-24838-5_15
SPEED: Scalable Protocols for Efficient Event Delivery in Sensor Networks (Chapter)
Dimitriou, T., Krontiris, I., Nikakis, F., & Spirakis, P. (2004). SPEED: Scalable Protocols for Efficient Event Delivery in Sensor Networks. In Lecture Notes in Computer Science (pp. 1300-1305). Springer Berlin Heidelberg. doi:10.1007/978-3-540-24693-0_110DOI: 10.1007/978-3-540-24693-0_110
Selfish Unsplittable Flows (Chapter)
Fotakis, D., Kontogiannis, S., & Spirakis, P. (2004). Selfish Unsplittable Flows. In Automata, Languages and Programming (pp. 593-605). Springer Berlin Heidelberg. doi:10.1007/978-3-540-27836-8_51DOI: 10.1007/978-3-540-27836-8_51
The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs (Chapter)
Nikoletseas, S., Raptopoulos, C., & Spirakis, P. (2004). The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs. In Automata, Languages and Programming (pp. 1029-1040). Springer Berlin Heidelberg. doi:10.1007/978-3-540-27836-8_86DOI: 10.1007/978-3-540-27836-8_86
2003
A COMPARATIVE STUDY OF PROTOCOLS FOR EFFICIENT DATA PROPAGATION IN SMART DUST NETWORKS (Journal article)
CHATZIGIANNAKIS, I., DIMITRIOU, T., MAVRONICOLAS, M., NIKOLETSEAS, S., & SPIRAKIS, P. (2003). A COMPARATIVE STUDY OF PROTOCOLS FOR EFFICIENT DATA PROPAGATION IN SMART DUST NETWORKS. Parallel Processing Letters, 13(04), 615-627. doi:10.1142/s0129626403001550DOI: 10.1142/s0129626403001550
Approximate Equilibria and Ball Fusion (Journal article)
Koutsoupias, E., Mavronicolas, M., & Spirakis, P. (2003). Approximate Equilibria and Ball Fusion. Theory of Computing Systems, 36(6), 683-693. doi:10.1007/s00224-003-1131-5DOI: 10.1007/s00224-003-1131-5
Attack Propagation in Networks (Journal article)
Nikoletseas, S., Prasinos, G., Spirakis, P., & Zaroliagis, C. (2003). Attack Propagation in Networks. Theory of Computing Systems, 36(5), 553-574. doi:10.1007/s00224-003-1087-5DOI: 10.1007/s00224-003-1087-5
Competitive video on demand schedulers for popular movies (Journal article)
Bouras, C., Kapoulas, V., Pantziou, G., & Spirakis, P. (2003). Competitive video on demand schedulers for popular movies. Discrete Applied Mathematics, 129(1), 49-61. doi:10.1016/s0166-218x(02)00233-0DOI: 10.1016/s0166-218x(02)00233-0
An efficient deterministic parallel algorithm for two processors precedence constraint scheduling (Journal article)
Jung, H., Serna, M., & Spirakis, P. (2003). An efficient deterministic parallel algorithm for two processors precedence constraint scheduling. Theoretical Computer Science, 292(3), 639-652. doi:10.1016/s0304-3975(01)00120-7DOI: 10.1016/s0304-3975(01)00120-7
Preface (Journal article)
Kutten, S., & Spirakis, P. (2003). Preface. Theoretical Computer Science, 291(1), 1. doi:10.1016/s0304-3975(01)00393-0DOI: 10.1016/s0304-3975(01)00393-0
Algorithms and Experiments on Colouring Squares of Planar Graphs (Chapter)
Andreou, M. I., Nikoletseas, S. E., & Spirakis, P. G. (2003). Algorithms and Experiments on Colouring Squares of Planar Graphs. In Experimental and Efficient Algorithms (pp. 15-32). Springer Berlin Heidelberg. doi:10.1007/3-540-44867-5_2DOI: 10.1007/3-540-44867-5_2
Distributed communication algorithms for ad hoc mobile networks (Journal article)
Chatzigiannakis, I., Nikoletseas, S., & Spirakis, P. (2003). Distributed communication algorithms for ad hoc mobile networks. Journal of Parallel and Distributed Computing, 63(1), 58-74. doi:10.1016/s0743-7315(02)00034-5DOI: 10.1016/s0743-7315(02)00034-5
Extreme Nash Equilibria (Conference Paper)
Gairing, M., Lücking, T., Mavronicolas, M., Monien, B., & Spirakis, P. (2003). Extreme Nash Equilibria. In Unknown Conference (pp. 1-20). Springer Berlin Heidelberg. doi:10.1007/978-3-540-45208-9_1DOI: 10.1007/978-3-540-45208-9_1
Space Efficient Hash Tables with Worst Case Constant Access Time (Chapter)
Fotakis, D., Pagh, R., Sanders, P., & Spirakis, P. (2003). Space Efficient Hash Tables with Worst Case Constant Access Time. In Lecture Notes in Computer Science (pp. 271-282). Springer Berlin Heidelberg. doi:10.1007/3-540-36494-3_25DOI: 10.1007/3-540-36494-3_25
Stability Behavior of FIFO Protocol in the Adversarial Queuing Model (Chapter)
Koukopoulos, D. K., Nikoletseas, S. E., & Spirakis, P. G. (2003). Stability Behavior of FIFO Protocol in the Adversarial Queuing Model. In Advances in Informatics (pp. 464-479). Springer Berlin Heidelberg. doi:10.1007/3-540-38076-0_30DOI: 10.1007/3-540-38076-0_30
The Impact of Network Structure on the Stability of Greedy Protocols (Chapter)
Koukopoulos, D., Mavronicolas, M., Nikoletseas, S., & Spirakis, P. (2003). The Impact of Network Structure on the Stability of Greedy Protocols. In Lecture Notes in Computer Science (pp. 251-263). Springer Berlin Heidelberg. doi:10.1007/3-540-44849-7_29DOI: 10.1007/3-540-44849-7_29
Which Is the Worst-Case Nash Equilibrium? (Chapter)
Lücking, T., Mavronicolas, M., Monien, B., Rode, M., Spirakis, P., & Vrto, I. (2003). Which Is the Worst-Case Nash Equilibrium?. In Mathematical Foundations of Computer Science 2003 (pp. 551-561). Springer Berlin Heidelberg. doi:10.1007/978-3-540-45138-9_49DOI: 10.1007/978-3-540-45138-9_49
2002
Competitive Call Control in Mobile Networks (Journal article)
Pantziou., Pentaris., & Spirakis. (2002). Competitive Call Control in Mobile Networks. Theory of Computing Systems, 35(6), 625-639. doi:10.1007/s00224-002-1032-zDOI: 10.1007/s00224-002-1032-z
Smart dust protocols for local detection and propagation (Conference Paper)
Chatzigiannakis, I., Nikoletseas, S., & Spirakis, P. (2002). Smart dust protocols for local detection and propagation. In Proceedings of the second ACM international workshop on Principles of mobile computing. ACM. doi:10.1145/584490.584493DOI: 10.1145/584490.584493
On the robustness of interconnections in random graphs: a symbolic approach (Journal article)
Flajolet, P., Hatzis, K., Nikoletseas, S., & Spirakis, P. (2002). On the robustness of interconnections in random graphs: a symbolic approach. Theoretical Computer Science, 287(2), 515-534. doi:10.1016/s0304-3975(01)00259-6DOI: 10.1016/s0304-3975(01)00259-6
Session details: Session 2B (Conference Paper)
Spirakis, P. (2002). Session details: Session 2B. In Proceedings of the thiry-fourth annual ACM symposium on Theory of computing. ACM. doi:10.1145/3247661DOI: 10.1145/3247661
Session details: Session 4B (Conference Paper)
Spirakis, P. (2002). Session details: Session 4B. In Proceedings of the thiry-fourth annual ACM symposium on Theory of computing. ACM. doi:10.1145/3247665DOI: 10.1145/3247665
Assignment of Reusable and Non-Reusable Frequencies (Chapter)
Fotakis, D. A., & Spirakis, P. G. (2002). Assignment of Reusable and Non-Reusable Frequencies. In Combinatorial and Global Optimization (pp. 75-95). WORLD SCIENTIFIC. doi:10.1142/9789812778215_0006DOI: 10.1142/9789812778215_0006
(Journal article)
Bouras, C., Lampsas, P., & Spirakis, P. (2002). Unknown Title. Multimedia Tools and Applications, 16(3), 251-276. doi:10.1023/a:1013964221404DOI: 10.1023/a:1013964221404
Distributed Algorithm Engineering (Chapter)
Spirakis, P. G., & Zaroliagis, C. D. (2002). Distributed Algorithm Engineering. In Experimental Algorithmics (pp. 197-228). Springer Berlin Heidelberg. doi:10.1007/3-540-36383-1_10DOI: 10.1007/3-540-36383-1_10
Minimum Congestion Redundant Assignments to Tolerate Random Faults (Journal article)
Fotakis., & Spirakis. (2002). Minimum Congestion Redundant Assignments to Tolerate Random Faults. Algorithmica, 32(3), 396-422. doi:10.1007/s00453-001-0080-0DOI: 10.1007/s00453-001-0080-0
Mobile Computing, Mobile Networks (Chapter)
auf der Heide, F. M., Kumar, M., Nikoletseas, S., & Spirakis, P. (2002). Mobile Computing, Mobile Networks. In Euro-Par 2002 Parallel Processing (pp. 933-934). Springer Berlin Heidelberg. doi:10.1007/3-540-45706-2_133DOI: 10.1007/3-540-45706-2_133
On Radiocoloring Hierarchically Specified Planar Graphs: $$ \mathcal{P}\mathcal{S}\mathcal{P}\mathcal{A}\mathcal{C}\mathcal{E} $$ -Completeness and Approximations (Chapter)
Andreou, M. I., Fotakis, D. A., Nikoletseas, S. E., Papadopoulou, V. G., & Spirakis, P. G. (2002). On Radiocoloring Hierarchically Specified Planar Graphs: $$ \mathcal{P}\mathcal{S}\mathcal{P}\mathcal{A}\mathcal{C}\mathcal{E} $$ -Completeness and Approximations. In Lecture Notes in Computer Science (pp. 81-92). Springer Berlin Heidelberg. doi:10.1007/3-540-45687-2_6DOI: 10.1007/3-540-45687-2_6
On radiocoloring hierarchically specified planar graphs: PSPACE-completeness and approximations (Conference Paper)
Andreou, M. I., Fotakis, D. A., Nikoletseas, S. E., Papadopoulou, V. G., & Spirakis, P. G. (2002). On radiocoloring hierarchically specified planar graphs: PSPACE-completeness and approximations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 2420 (pp. 81-92). doi:10.1007/3-540-45687-2_6DOI: 10.1007/3-540-45687-2_6
On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols (Chapter)
Koukopoulos, D., Mavronicolas, M., Nikoletseas, S., & Spirakis, P. (2002). On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols. In Lecture Notes in Computer Science (pp. 88-102). Springer Berlin Heidelberg. doi:10.1007/3-540-36108-1_6DOI: 10.1007/3-540-36108-1_6
Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies (Chapter)
Fotakis, D. A., Nikoletseas, S. E., Papadopoulou, V. G., & Spirakis, P. G. (2002). Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies. In Graph-Theoretic Concepts in Computer Science (pp. 223-234). Springer Berlin Heidelberg. doi:10.1007/3-540-36379-3_20DOI: 10.1007/3-540-36379-3_20
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game (Chapter)
Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., & Spirakis, P. (2002). The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. In Automata, Languages and Programming (pp. 123-134). Springer Berlin Heidelberg. doi:10.1007/3-540-45465-9_12DOI: 10.1007/3-540-45465-9_12
2001
An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks (Chapter)
Chatzigiannakis, I., Nikoletseas, S., Paspallis, N., Spirakis, P., & Zaroliagis, C. (2001). An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks. In Algorithm Engineering (pp. 159-171). Springer Berlin Heidelberg. doi:10.1007/3-540-44688-5_13DOI: 10.1007/3-540-44688-5_13
Preface (Book)
Orejas, F., Spirakis, P. G., & Van Leeuwen, J. (2001). Preface (Vol. 2076 LNCS).
An efficient communication strategy for ad-hoc mobile networks (Conference Paper)
Chatzigiannakis, I., Nikoletseas, S., & Spirakis, P. (2001). An efficient communication strategy for ad-hoc mobile networks. In Proceedings of the twentieth annual ACM symposium on Principles of distributed computing. ACM. doi:10.1145/383962.384053DOI: 10.1145/383962.384053
The price of selfish routing (Conference Paper)
Mavronicolas, M., & Spirakis, P. (2001). The price of selfish routing. In Proceedings of the thirty-third annual ACM symposium on Theory of computing. ACM. doi:10.1145/380752.380846DOI: 10.1145/380752.380846
Attack propagation in networks (Conference Paper)
Nikoletseas, S., Prasinos, G., Spirakis, P., & Zaroliagis, C. (2001). Attack propagation in networks. In Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures. ACM. doi:10.1145/378580.378591DOI: 10.1145/378580.378591
Stability and non-stability of the FIFO protocol (Conference Paper)
Díaz, J., Koukopoulos, D., Nikoletseas, S., Serna, M., Spirakis, P., & Thilikos, D. M. (2001). Stability and non-stability of the FIFO protocol. In Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures. ACM. doi:10.1145/378580.378588DOI: 10.1145/378580.378588
An Efficient Communication Strategy for Ad-hoc Mobile Networks (Chapter)
Chatzigiannakis, I., Nikoletseas, S., & Spirakis, P. (2001). An Efficient Communication Strategy for Ad-hoc Mobile Networks. In Lecture Notes in Computer Science (pp. 285-299). Springer Berlin Heidelberg. doi:10.1007/3-540-45414-4_20DOI: 10.1007/3-540-45414-4_20
Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks (Chapter)
Chatzigiannakis, I., Nikoletseas, S., & Spirakis, P. (2001). Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks. In Algorithm Engineering (pp. 99-110). Springer Berlin Heidelberg. doi:10.1007/3-540-44691-5_9DOI: 10.1007/3-540-44691-5_9
Brief announcement: An efficient communication strategy for Ad-hoc mobile networks (Conference Paper)
Chatzigiannakis, I., Nikoletseas, S., & Spirakis, P. (2001). Brief announcement: An efficient communication strategy for Ad-hoc mobile networks. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (pp. 320-322).
Combinatorial Randomized Rounding: Boosting Randomized Rounding with Combinatorial Arguments (Chapter)
Efraimidis, P. S., & Spirakis, P. G. (2001). Combinatorial Randomized Rounding: Boosting Randomized Rounding with Combinatorial Arguments. In Applied Optimization (pp. 31-53). Springer US. doi:10.1007/978-1-4757-6594-6_2DOI: 10.1007/978-1-4757-6594-6_2
Hardness results and efficient approximations for frequency assignment problems: Radio labelling and radio coloring (Journal article)
Fotakis, D. A., Nikoletseas, S. E., Papadopoulou, V. G., & Spirakis, P. G. (2001). Hardness results and efficient approximations for frequency assignment problems: Radio labelling and radio coloring. Computing and Informatics, 20(2), 121-180.
Randomized Techniques for Modelling Faults and Achieving Robust Computing (Chapter)
Nikoletseas, S. E., & Spirakis, P. G. (2001). Randomized Techniques for Modelling Faults and Achieving Robust Computing. In Handbook of Randomized Computing (pp. 313-399). Springer US. doi:10.1007/978-1-4615-0013-1_10DOI: 10.1007/978-1-4615-0013-1_10
Stability Issues in Heterogeneous and FIFO Networks under the Adversarial Queueing Model (Chapter)
Koukopoulos, D. K., Nikoletseas, S. E., & Spirakis, P. G. (2001). Stability Issues in Heterogeneous and FIFO Networks under the Adversarial Queueing Model. In High Performance Computing — HiPC 2001 (pp. 3-14). Springer Berlin Heidelberg. doi:10.1007/3-540-45307-5_1DOI: 10.1007/3-540-45307-5_1
The Lagrangian Search Method (Chapter)
Efraimidis, P. S., & Spirakis, P. G. (2001). The Lagrangian Search Method. In Nonconvex Optimization and Its Applications (pp. 283-294). Springer US. doi:10.1007/978-1-4613-0279-7_15DOI: 10.1007/978-1-4613-0279-7_15
2000
CONNECTIVITY PROPERTIES IN RANDOM REGULAR GRAPHS WITH EDGE FAULTS (Journal article)
NIKOLETSEAS, S., PALEM, K., SPIRAKIS, P., & YUNG, M. (2000). CONNECTIVITY PROPERTIES IN RANDOM REGULAR GRAPHS WITH EDGE FAULTS. International Journal of Foundations of Computer Science, 11(02), 247-262. doi:10.1142/s0129054100000156DOI: 10.1142/s0129054100000156
Efficient Scheduling of Strict Multithreaded Computations (Journal article)
Fatourou, P. (2000). Efficient Scheduling of Strict Multithreaded Computations. Theory of Computing Systems, 33(3), 173-232. doi:10.1007/s002240010002DOI: 10.1007/s002240010002
Machine Partitioning and Scheduling under Fault-Tolerance Constraints (Chapter)
Fotakis, D. A., & Spirakis, P. G. (2000). Machine Partitioning and Scheduling under Fault-Tolerance Constraints. In Nonconvex Optimization and Its Applications (pp. 209-244). Springer US. doi:10.1007/978-1-4757-3145-3_14DOI: 10.1007/978-1-4757-3145-3_14
NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs (Chapter)
Fotakis, D. A., Nikoletseas, S. E., Papadopoulou, V. G., & Spirakis, P. G. (2000). NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs. In Lecture Notes in Computer Science (pp. 363-372). Springer Berlin Heidelberg. doi:10.1007/3-540-44612-5_32DOI: 10.1007/3-540-44612-5_32
Positive Linear Programming Extensions: Parallel Complexity and Applications (Chapter)
Efraimidis, P. S., & Spirakis, P. G. (2000). Positive Linear Programming Extensions: Parallel Complexity and Applications. In Euro-Par 2000 Parallel Processing (pp. 456-460). Springer Berlin Heidelberg. doi:10.1007/3-540-44520-x_60DOI: 10.1007/3-540-44520-x_60
Robust Parallel Computations through Randomization (Journal article)
Kontogiannis, S. C., Pantziou, G. E., Spirakis, P. G., & Yung, M. (2000). Robust Parallel Computations through Randomization. Theory of Computing Systems, 33(5-6), 427-464. doi:10.1007/s002240010009DOI: 10.1007/s002240010009
Trade-Offs between Density and Robustness in Random Interconnection Graphs (Chapter)
Flajolet, P., Hatzis, K., Nikoletseas, S., & Spirakis, P. (2000). Trade-Offs between Density and Robustness in Random Interconnection Graphs. In Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics (pp. 152-168). Springer Berlin Heidelberg. doi:10.1007/3-540-44929-9_13DOI: 10.1007/3-540-44929-9_13
1999
Optimal High-Performance Parallel Text Retrieval via Fat-Trees (Journal article)
Mamalis, B. (1999). Optimal High-Performance Parallel Text Retrieval via Fat-Trees. Theory of Computing Systems, 32(6), 591-623. doi:10.1007/s002240000133DOI: 10.1007/s002240000133
Optimal, distributed decision-making (Conference Paper)
Mavronicolas, M., & Spirakis, P. (1999). Optimal, distributed decision-making. In Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing. ACM. doi:10.1145/301308.301387DOI: 10.1145/301308.301387
A New Scheduling Algorithm for General Strict Multithreaded Computations (Chapter)
Fatourou, P., & Spirakis, P. (1999). A New Scheduling Algorithm for General Strict Multithreaded Computations. In Lecture Notes in Computer Science (pp. 297-311). Springer Berlin Heidelberg. doi:10.1007/3-540-48169-9_21DOI: 10.1007/3-540-48169-9_21
BSP versus LogP (Journal article)
Bilardi, G., Pietracaprina, A., Pucci, G., Herley, K. T., & Spirakis, P. (1999). BSP versus LogP. Algorithmica, 24(3-4), 405-422. doi:10.1007/pl00008270DOI: 10.1007/pl00008270
Counting in Mobile Networks: Theory and Experimentation (Chapter)
Hatzis, K., Pentaris, G., Spirakis, P., & Tampakas, B. (1999). Counting in Mobile Networks: Theory and Experimentation. In Algorithm Engineering (pp. 95-109). Springer Berlin Heidelberg. doi:10.1007/3-540-48318-7_10DOI: 10.1007/3-540-48318-7_10
Efficient Redundant Assignments under Fault-Tolerance Constraints (Chapter)
Fotakis, D. A., & Spirakis, P. G. (1999). Efficient Redundant Assignments under Fault-Tolerance Constraints. In Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques (pp. 156-167). Springer Berlin Heidelberg. doi:10.1007/978-3-540-48413-4_17DOI: 10.1007/978-3-540-48413-4_17
Fundamental control algorithms in mobile networks (Conference Paper)
Hatzis, K. P., Pentaris, G. P., Spirakis, P. G., Tampakas, V. T., & Tan, R. B. (1999). Fundamental control algorithms in mobile networks. In Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures. ACM. doi:10.1145/305619.305649DOI: 10.1145/305619.305649
Fundamental distributed protocols in mobile networks (Conference Paper)
Hatzis, K. P., Pentaris, G. P., Spirakis, P. G., Tampakas, V. T., & Tan, R. B. (1999). Fundamental distributed protocols in mobile networks. In Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing. ACM. doi:10.1145/301308.301379DOI: 10.1145/301308.301379
Implementation and Experimental Evaluation of Graph Connectivity Algorithms Using LEDA (Chapter)
Fatourou, P., Spirakis, P., Zarafidis, P., & Zoura, A. (1999). Implementation and Experimental Evaluation of Graph Connectivity Algorithms Using LEDA. In Algorithm Engineering (pp. 124-138). Springer Berlin Heidelberg. doi:10.1007/3-540-48318-7_12DOI: 10.1007/3-540-48318-7_12
Optimal, distributed decision-making: The case of no communication (Chapter)
Georgiades, S., Mavronicolas, M., & Spirakis, P. (1999). Optimal, distributed decision-making: The case of no communication. In Fundamentals of Computation Theory (pp. 293-303). Springer Berlin Heidelberg. doi:10.1007/3-540-48321-7_24DOI: 10.1007/3-540-48321-7_24
Parallel Processing of Multiple Text Queries on Hypercube Interconnection Networks⋆ (Chapter)
Mamalis, B., Spirakis, P., & Tampakas, B. (1999). Parallel Processing of Multiple Text Queries on Hypercube Interconnection Networks⋆. In Euro-Par’99 Parallel Processing (pp. 482-486). Springer Berlin Heidelberg. doi:10.1007/3-540-48311-x_65DOI: 10.1007/3-540-48311-x_65
1998
A Hamiltonian Approach to the Assignment of Non-reusable Frequencies (Chapter)
Fotakis, D. A., & Spirakis, P. G. (1998). A Hamiltonian Approach to the Assignment of Non-reusable Frequencies. In Lecture Notes in Computer Science (pp. 18-29). Springer Berlin Heidelberg. doi:10.1007/978-3-540-49382-2_3DOI: 10.1007/978-3-540-49382-2_3
An analytical performance model for multistage interconnection networks with finite, infinite and zero length buffers (Journal article)
Bouras, C., Garofalakis, J., Spirakis, P., & Triantafillou, V. (1998). An analytical performance model for multistage interconnection networks with finite, infinite and zero length buffers. Performance Evaluation, 34(3), 169-182. doi:10.1016/s0166-5316(98)00035-2DOI: 10.1016/s0166-5316(98)00035-2
On the random generation and counting of matchings in dense graphs (Journal article)
Diaz, J., Serna, M., & Spirakis, P. (1998). On the random generation and counting of matchings in dense graphs. Theoretical Computer Science, 201(1-2), 281-290. doi:10.1016/s0304-3975(97)00297-1DOI: 10.1016/s0304-3975(97)00297-1
A competitive symmetrical transfer policy for load sharing (Chapter)
Antonis, K., Garofalakis, J., & Spirakis, P. (1998). A competitive symmetrical transfer policy for load sharing. In Euro-Par’98 Parallel Processing (pp. 352-355). Springer Berlin Heidelberg. doi:10.1007/bfb0057873DOI: 10.1007/bfb0057873
MRP II-based Production Management Using Intelligent Decision Making (Chapter)
Hatzilygeroudis, I., Sofotassios, D., Dendris, N., Triantafillou, V., Tsakalidis, A., & Spirakis, P. (1998). MRP II-based Production Management Using Intelligent Decision Making. In Beyond Manufacturing Resource Planning (MRP II) (pp. 379-411). Springer Berlin Heidelberg. doi:10.1007/978-3-662-03742-3_15DOI: 10.1007/978-3-662-03742-3_15
The global efficiency of distributed, rate-based, flow control algorithms (Conference Paper)
Fatourou, P., Mavronicolas, M., & Spirakis, P. (1998). The global efficiency of distributed, rate-based, flow control algorithms. In Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98. ACM Press. doi:10.1145/277697.277763DOI: 10.1145/277697.277763
“Dynamic-fault-prone BSP” (Conference Paper)
Kontogiannis, S. C., Pantziou, G. E., Spirakis, P. G., & Yung, M. (1998). “Dynamic-fault-prone BSP”. In Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures - SPAA '98. ACM Press. doi:10.1145/277651.277666DOI: 10.1145/277651.277666
1997
Parallel algorithms for the minimum cut and the minimum length tree layout problems (Journal article)
Díaz, J., Gibbons, A., Pantziou, G. E., Serna, M. J., Spirakis, P. G., & Toran, J. (1997). Parallel algorithms for the minimum cut and the minimum length tree layout problems. Theoretical Computer Science, 181(2), 267-287. doi:10.1016/s0304-3975(96)00274-5DOI: 10.1016/s0304-3975(96)00274-5
Paradigms for Fast Parallel Approximability (Book)
Díaz, J., Serna, M., Spirakis, P., & Torán, J. (1997). Paradigms for Fast Parallel Approximability. Cambridge University Press. doi:10.1017/cbo9780511666407DOI: 10.1017/cbo9780511666407
Editor’s foreword (Journal article)
Spirakis, P. (1997). Editor’s foreword. Theory of Computing Systems, 30(1), 1. doi:10.1007/bf02679450DOI: 10.1007/bf02679450
A general performance model for multistage interconnection networks (Chapter)
Bouras, C. J., Garofalakis, J. D., Spirakis, P. G., & Triantafillou, V. D. (1997). A general performance model for multistage interconnection networks. In Euro-Par'97 Parallel Processing (pp. 993-1000). Springer Berlin Heidelberg. doi:10.1007/bfb0002843DOI: 10.1007/bfb0002843
Competitive call control in mobile networks (Chapter)
Pantziou, G. E., Pentaris, G. P., & Spirakis, P. G. (1997). Competitive call control in mobile networks. In Algorithms and Computation (pp. 404-413). Springer Berlin Heidelberg. doi:10.1007/3-540-63890-3_43DOI: 10.1007/3-540-63890-3_43
Efficiency of oblivious versus non-oblivious schedulers for optimistic, rate-based flow control (extended abstract) (Conference Paper)
Fatourou, P., Mavronicolas, M., & Spirakis, P. (1997). Efficiency of oblivious versus non-oblivious schedulers for optimistic, rate-based flow control (extended abstract). In Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97. ACM Press. doi:10.1145/259380.259434DOI: 10.1145/259380.259434
Efficient computations on fault-prone BSP machines (Conference Paper)
Kontogiannis, S. C., Pantziou, G. E., & Spirakis, P. G. (1997). Efficient computations on fault-prone BSP machines. In Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures - SPAA '97. ACM Press. doi:10.1145/258492.258501DOI: 10.1145/258492.258501
On the fault tolerance of fat-trees (Chapter)
Nikoletseas, S., Pantziou, G., Psycharis, P., & Spirakis, P. (1997). On the fault tolerance of fat-trees. In Euro-Par'97 Parallel Processing (pp. 208-217). Springer Berlin Heidelberg. doi:10.1007/bfb0002735DOI: 10.1007/bfb0002735
Pure Greedy Hot-Potato in the 2-D Mesh with Random Destinations (Journal article)
Spirakis, P., & Triantafillou, V. (1997). Pure Greedy Hot-Potato in the 2-D Mesh with Random Destinations. Parallel Processing Letters, 07(03), 249-258. doi:10.1142/s0129626497000267DOI: 10.1142/s0129626497000267
1996
Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems (Journal article)
Kavvadias, D. J., Pantziou, G. E., Spirakis, P. G., & Zaroliagis, C. D. (1996). Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems. Theoretical Computer Science, 168(1), 121-154. doi:10.1016/s0304-3975(96)00065-5DOI: 10.1016/s0304-3975(96)00065-5
Simple atomic snapshots: A linear complexity solution with unbounded time-stamps (Journal article)
Kirousis, L. M., Spirakis, P., & Tsigas, P. (1996). Simple atomic snapshots: A linear complexity solution with unbounded time-stamps. Information Processing Letters, 58(1), 47-53. doi:10.1016/0020-0190(95)00198-0DOI: 10.1016/0020-0190(95)00198-0
(poly(log log n), poly(log log n))—Restricted verifiers are unlikely to exist for languages in $$\mathcal{N}\mathcal{P}$$ * (Chapter)
Fotakis, D., & Spirakis, P. (1996). (poly(log log n), poly(log log n))—Restricted verifiers are unlikely to exist for languages in $$\mathcal{N}\mathcal{P}$$ *. In Mathematical Foundations of Computer Science 1996 (pp. 360-371). Springer Berlin Heidelberg. doi:10.1007/3-540-61550-4_162DOI: 10.1007/3-540-61550-4_162
Attack modeling in open network environments (Chapter)
Katsikas, S. K., Gritzalis, D., & Spirakis, P. (1996). Attack modeling in open network environments. In IFIP Advances in Information and Communication Technology (pp. 268-277). Springer US. doi:10.1007/978-0-387-35083-7_24DOI: 10.1007/978-0-387-35083-7_24
BSP vs LogP (Conference Paper)
Bilardi, G., Herley, K. T., Pietracaprina, A., Pucci, G., & Spirakis, P. (1996). BSP vs LogP. In Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures - SPAA '96. ACM Press. doi:10.1145/237502.237504DOI: 10.1145/237502.237504
On-demand hypermedia/multimedia service over broadband networks (Conference Paper)
Bouras, C., Kapoulas, V., Spirakis, P., Miras, D., Ouzounis, V., & Tatakis, A. (1996). On-demand hypermedia/multimedia service over broadband networks. In Proceedings of 5th IEEE International Symposium on High Performance Distributed Computing HPDC-96. IEEE. doi:10.1109/hpdc.1996.546192DOI: 10.1109/hpdc.1996.546192
Performance modeling of distributed timestamp ordering: Perfect and imperfect clocks (Journal article)
Bouras, C. J., & Spirakis, P. G. (1996). Performance modeling of distributed timestamp ordering: Perfect and imperfect clocks. Performance Evaluation, 25(2), 105-130. doi:10.1016/0166-5316(94)00041-7DOI: 10.1016/0166-5316(94)00041-7
Randomized adaptive video on demand (Conference Paper)
Bouras, C., Kapoulas, V., Pantziou, T., & Spirakis, P. (1996). Randomized adaptive video on demand. In Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96. ACM Press. doi:10.1145/248052.248087DOI: 10.1145/248052.248087
Scheduling algorithms for strict multithreaded computations (Chapter)
Fatourou, P., & Spirakis, P. (1996). Scheduling algorithms for strict multithreaded computations. In Algorithms and Computation (pp. 407-416). Springer Berlin Heidelberg. doi:10.1007/bfb0009517DOI: 10.1007/bfb0009517
Wormhole versus deflection routing: A case study on the mesh (Chapter)
Karaivazoglou, E., Spirakis, P., & Triantafilou, V. (1996). Wormhole versus deflection routing: A case study on the mesh. In Lecture Notes in Computer Science (pp. 31-40). Springer Berlin Heidelberg. doi:10.1007/3-540-61332-3_136DOI: 10.1007/3-540-61332-3_136
1995
The fourth moment in Luby's distribution (Journal article)
Dubhashi, D. P., Pantziou, G. E., Spirakis, P. G., & Zaroliagis, C. D. (1995). The fourth moment in Luby's distribution. Theoretical Computer Science, 148(1), 133-140. doi:10.1016/0304-3975(95)00056-3DOI: 10.1016/0304-3975(95)00056-3
The Fourth Moment in Luby's Distribution (Journal article)
Dubhashi, D. P., Pantziou, G. E., Spirakis, P. G., & Zaroliagis, C. D. (n.d.). The Fourth Moment in Luby's Distribution. BRICS Report Series, 2(15). doi:10.7146/brics.v2i15.19883DOI: 10.7146/brics.v2i15.19883
Distributed protocols against mobile eavesdroppers (Conference Paper)
Spirakis, P., Tampakas, B., & Antonopoulou, H. (1995). Distributed protocols against mobile eavesdroppers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 972 (pp. 161-167). doi:10.1007/bfb0022145DOI: 10.1007/bfb0022145
Distributed protocols against mobile eavesdroppers (Chapter)
Spirakis, P., Tampakas, B., & Antonopoulou, H. (1995). Distributed protocols against mobile eavesdroppers. In Distributed Algorithms (pp. 160-167). Springer Berlin Heidelberg. doi:10.1007/bfb0022145DOI: 10.1007/bfb0022145
Efficient parallel algorithms for some tree layout problems (Chapter)
Díaz, J., Gibbons, A., Pantziou, G., Serna, M., Spirakis, P., & Toran, J. (1995). Efficient parallel algorithms for some tree layout problems. In Lecture Notes in Computer Science (pp. 313-323). Springer Berlin Heidelberg. doi:10.1007/bfb0030846DOI: 10.1007/bfb0030846
Expander properties in random regular graphs with edge faults (Chapter)
Nikoletseas, S. E., & Spirakis, P. G. (1995). Expander properties in random regular graphs with edge faults. In STACS 95 (pp. 421-432). Springer Berlin Heidelberg. doi:10.1007/3-540-59042-0_93DOI: 10.1007/3-540-59042-0_93
Parallel text retrieval on a high performance supercomputer using the Vector Space Model (Conference Paper)
Efraimidis, P., Glymidakis, C., Mamalis, B., Spirakis, P., & Tampakas, B. (1995). Parallel text retrieval on a high performance supercomputer using the Vector Space Model. In Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '95. ACM Press. doi:10.1145/215206.215332DOI: 10.1145/215206.215332
Preface (Book)
Spirakis, P. (1995). Preface (Vol. 979).
Randomized competitive algorithms for admission control in general networks (Conference Paper)
Kapoulas, V., & Spirakis, P. (1995). Randomized competitive algorithms for admission control in general networks. In Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95. ACM Press. doi:10.1145/224964.224992DOI: 10.1145/224964.224992
Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time (Conference Paper)
Nikoletseas, S., Reif, J., Spirakis, P., & Yung, M. (1995). Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 944 (pp. 160-170). doi:10.1007/3-540-60084-1_71DOI: 10.1007/3-540-60084-1_71
Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time (Chapter)
Nikoletseas, S., Reif, J., Spirakis, P., & Yung, M. (1995). Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time. In Automata, Languages and Programming (pp. 159-170). Springer Berlin Heidelberg. doi:10.1007/3-540-60084-1_71DOI: 10.1007/3-540-60084-1_71
Tail bounds for occupancy and the satisfiability threshold conjecture (Journal article)
Kamath, A., Motwani, R., Palem, K., & Spirakis, P. (1995). Tail bounds for occupancy and the satisfiability threshold conjecture. Random Structures & Algorithms, 7(1), 59-80. doi:10.1002/rsa.3240070105DOI: 10.1002/rsa.3240070105
1994
Tentative and definite distributed computations: an optimistic approach to network synchronization (Journal article)
Garofalakis, J., Spirakis, P., Tampakas, B., & Rajsbaum, S. (1994). Tentative and definite distributed computations: an optimistic approach to network synchronization. Theoretical Computer Science, 128(1-2), 63-74. doi:10.1016/0304-3975(94)90164-3DOI: 10.1016/0304-3975(94)90164-3
A conceptual database approach for modelling 3D objects of irregular geometry (Chapter)
Krotopoulou, A., Spirakis, P., Terpou, D., & Tsakalidis, A. (1994). A conceptual database approach for modelling 3D objects of irregular geometry. In Lecture Notes in Computer Science (pp. 290-299). Springer Berlin Heidelberg. doi:10.1007/3-540-58435-8_193DOI: 10.1007/3-540-58435-8_193
Distributed pursuit-evasion (Conference Paper)
Spirakis, P., & Tampakas, B. (1994). Distributed pursuit-evasion. In Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94. ACM Press. doi:10.1145/197917.198191DOI: 10.1145/197917.198191
Efficient sequential and parallel algorithms for the negative cycle problem (Chapter)
Kavvadias, D., Pantziou, G. E., Spirakis, P. G., & Zaroliagis, C. D. (1994). Efficient sequential and parallel algorithms for the negative cycle problem. In Algorithms and Computation (pp. 270-278). Springer Berlin Heidelberg. doi:10.1007/3-540-58325-4_190DOI: 10.1007/3-540-58325-4_190
Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems (Chapter)
Kavvadias, D., Pantziou, G. E., Spirakis, P. G., & Zaroliagis, C. D. (1994). Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems. In Mathematical Foundations of Computer Science 1994 (pp. 462-472). Springer Berlin Heidelberg. doi:10.1007/3-540-58338-6_93DOI: 10.1007/3-540-58338-6_93
Intrusion detection: Approach and performance issues of the SECURENET system (Journal article)
Denault, M., Karagiannis, D., Gritzalis, D., & Spirakis, P. (1994). Intrusion detection: Approach and performance issues of the SECURENET system. Computers & Security, 13(6), 495-508. doi:10.1016/0167-4048(91)90138-4DOI: 10.1016/0167-4048(91)90138-4
Near-optimal dominating sets in dense random graphs in polynomial expected time (Chapter)
Nikoletseas, S. E., & Spirakis, P. G. (1994). Near-optimal dominating sets in dense random graphs in polynomial expected time. In Graph-Theoretic Concepts in Computer Science (pp. 1-10). Springer Berlin Heidelberg. doi:10.1007/3-540-57899-4_36DOI: 10.1007/3-540-57899-4_36
Reading many variables in one atomic operation: solutions with linear or sublinear complexity (Journal article)
Kirousis, L. M., Spirakis, P., & Tsigas, P. (1994). Reading many variables in one atomic operation: solutions with linear or sublinear complexity. IEEE Transactions on Parallel and Distributed Systems, 5(7), 688-696. doi:10.1109/71.296315DOI: 10.1109/71.296315
Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing (Chapter)
Nikoletseas, S., Palem, K., Spirakis, P., & Yung, M. (1994). Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing. In Automata, Languages and Programming (pp. 508-519). Springer Berlin Heidelberg. doi:10.1007/3-540-58201-0_94DOI: 10.1007/3-540-58201-0_94
Surveillance and protection in IBC management (Chapter)
Androutsopoulos, D., Kaijser, P., Katsikas, S., Presttun, K., Salmon, D., & Spirakis, P. (1994). Surveillance and protection in IBC management. In Towards a Pan-European Telecommunication Service Infrastructure — IS&N '94 (pp. 61-72). Springer Berlin Heidelberg. doi:10.1007/bfb0013398DOI: 10.1007/bfb0013398
Surveillance and protection in IBC management: The applicability of two RACE security projects - SecureNet II and SESAME (Conference Paper)
Androutsopoulos, D., Kaijser, P., Katsikas, S., Presttun, K., Salmon, D., & Spirakis, P. (1994). Surveillance and protection in IBC management: The applicability of two RACE security projects - SecureNet II and SESAME. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 851 LNCS (pp. 61-72). doi:10.1007/bfb0013398DOI: 10.1007/bfb0013398
1993
A Formal Treatment of Relevance Information in Ill-Structured Environments (Chapter)
Androutsopoulos, D., & Spirakis, P. (1993). A Formal Treatment of Relevance Information in Ill-Structured Environments. In Operations Research ’92 (pp. 245-248). Physica-Verlag HD. doi:10.1007/978-3-662-12629-5_72DOI: 10.1007/978-3-662-12629-5_72
Brain data base (BDB) (Chapter)
Anogianakis, G., Krotopoulou, A., Spirakis, P., Terpou, D., & Tsakalidis, A. (1993). Brain data base (BDB). In Lecture Notes in Computer Science (pp. 361-364). Springer Berlin Heidelberg. doi:10.1007/3-540-57234-1_32DOI: 10.1007/3-540-57234-1_32
Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays (Journal article)
Jung, H., Kirousis, L. M., & Spirakis, P. (1993). Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays. Information and Computation, 105(1), 94-104. doi:10.1006/inco.1993.1041DOI: 10.1006/inco.1993.1041
Parallel Complexity of the Connected Subgraph Problem (Journal article)
Kirousis, L. M., Serna, M., & Spirakis, P. (1993). Parallel Complexity of the Connected Subgraph Problem. SIAM Journal on Computing, 22(3), 573-586. doi:10.1137/0222039DOI: 10.1137/0222039
1992
Efficient parallel algorithms for shortest paths in planar digraphs (Journal article)
Pantziou, G. E., Spirakis, P. G., & Zaroliagis, C. D. (1992). Efficient parallel algorithms for shortest paths in planar digraphs. BIT, 32(2), 215-236. doi:10.1007/bf01994878DOI: 10.1007/bf01994878
Expected parallel time and sequential space complexity of graph and digraph problems (Journal article)
Reif, J., & Spirakis, P. (1992). Expected parallel time and sequential space complexity of graph and digraph problems. Algorithmica, 7(1-6), 597-630. doi:10.1007/bf01758779DOI: 10.1007/bf01758779
Distributed algorithms: 5th International Workshop, WDAG '91 Delphi, Greece, October 7-9, 1991 Proceedings (Conference Paper)
Toueg, S., Spirakis, P. G., & Kirousis, L. (1992). Distributed algorithms: 5th International Workshop, WDAG '91 Delphi, Greece, October 7-9, 1991 Proceedings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 579 LNCS.
Distributed system simulator (DSS) (Chapter)
Spirakis, P., Tampakas, B., Papatriantafillou, M., Konstantoulis, K., Vlaxodimitropoulos, K., Antonopoulos, V., . . . Spartiotis, D. (1992). Distributed system simulator (DSS). In STACS 92 (pp. 615-616). Springer Berlin Heidelberg. doi:10.1007/3-540-55210-3_222DOI: 10.1007/3-540-55210-3_222
Fast parallel algorithms for coloring random graphs (Chapter)
Kedem, Z. M., Palem, K. V., Pantziou, G. E., Spirakis, P. G., & Zaroliagis, C. D. (1992). Fast parallel algorithms for coloring random graphs. In Graph-Theoretic Concepts in Computer Science (pp. 135-147). Springer Berlin Heidelberg. doi:10.1007/3-540-55121-2_13DOI: 10.1007/3-540-55121-2_13
Preface (Book)
Toueg, S., Spirakis, P., & Kirousis, L. (1992). Preface (Vol. 579 LNCS).
Reading many variables in one atomic operation solutions with linear or sublinear complexity (Chapter)
Kirousis, L. M., Spirakis, P., & Tsigas, P. (n.d.). Reading many variables in one atomic operation solutions with linear or sublinear complexity. In Distributed Algorithms (pp. 229-241). Springer-Verlag. doi:10.1007/bfb0022450DOI: 10.1007/bfb0022450
Tentative and definite distributed computations: An optimistic approach to network synchronization (Chapter)
Garofalakis, J., Rajsbaum, S., Spirakis, P., & Tampakas, B. (1992). Tentative and definite distributed computations: An optimistic approach to network synchronization. In Distributed Algorithms (pp. 110-119). Springer Berlin Heidelberg. doi:10.1007/3-540-56188-9_8DOI: 10.1007/3-540-56188-9_8
1991
The complexity of the reliable connectivity problem (Journal article)
Kavadias, D., Kirousis, L. M., & Spirakis, P. (1991). The complexity of the reliable connectivity problem. Information Processing Letters, 39(5), 245-252. doi:10.1016/0020-0190(91)90023-bDOI: 10.1016/0020-0190(91)90023-b
Combining tentative and definite executions for very fast dependable parallel computing (Conference Paper)
Kedem, Z. M., Palem, K. V., Raghunathan, A., & Spirakis, P. G. (1991). Combining tentative and definite executions for very fast dependable parallel computing. In Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91. ACM Press. doi:10.1145/103418.103459DOI: 10.1145/103418.103459
A parallel algorithm for two processors precedence constraint scheduling (Chapter)
Jung, H., Serna, M., & Spirakis, P. (1991). A parallel algorithm for two processors precedence constraint scheduling. In Automata, Languages and Programming (pp. 417-428). Springer Berlin Heidelberg. doi:10.1007/3-540-54233-7_152DOI: 10.1007/3-540-54233-7_152
Optimal parallel algorithms for sparse graphs (Chapter)
Pantziou, G. E., Spirakis, P. G., & Zaroliagis, C. D. (1991). Optimal parallel algorithms for sparse graphs. In Graph-Theoretic Concepts in Computer Science (pp. 1-17). Springer Berlin Heidelberg. doi:10.1007/3-540-53832-1_27DOI: 10.1007/3-540-53832-1_27
Simple atomic snapshots a linear complexity solution with unbounded time-stamps (Chapter)
Kirousis, L. M., Spirakis, P., & Tsigas, P. (1991). Simple atomic snapshots a linear complexity solution with unbounded time-stamps. In Advances in Computing and Information — ICCI '91 (pp. 582-587). Springer Berlin Heidelberg. doi:10.1007/3-540-54029-6_207DOI: 10.1007/3-540-54029-6_207
The complexity of the reliable connectivity problem (Chapter)
Kavadias, D., Kirousis, L. M., & Spirakis, P. (1991). The complexity of the reliable connectivity problem. In Mathematical Foundations of Computer Science 1991 (pp. 259-266). Springer Berlin Heidelberg. doi:10.1007/3-540-54345-7_69DOI: 10.1007/3-540-54345-7_69
Tight RNC approximations to Max Flow (Chapter)
Serna, M., & Spirakis, P. (n.d.). Tight RNC approximations to Max Flow. In STACS 91 (pp. 118-126). Springer-Verlag. doi:10.1007/bfb0020792DOI: 10.1007/bfb0020792
1990
Efficient parallel algorithms for shortest paths in planar graphs (Chapter)
Pantziou, G. E., Spirakis, P. G., & Zaroliagis, C. D. (1990). Efficient parallel algorithms for shortest paths in planar graphs. In SWAT 90 (pp. 288-300). Springer Berlin Heidelberg. doi:10.1007/3-540-52846-6_98DOI: 10.1007/3-540-52846-6_98
Efficient robust parallel computations (Conference Paper)
Kedem, Z. M., Palem, K. V., & Spirakis, P. G. (1990). Efficient robust parallel computations. In Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90. ACM Press. doi:10.1145/100216.100231DOI: 10.1145/100216.100231
The performance of multistage interconnection networks with finite buffers (Conference Paper)
Garofalakis, J. D., & Spirakis, P. G. (1990). The performance of multistage interconnection networks with finite buffers. In Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems - SIGMETRICS '90. ACM Press. doi:10.1145/98457.98779DOI: 10.1145/98457.98779
The performance of multistage interconnection networks with finite buffers (Journal article)
Garofalakis, J. D., & Spirakis, P. G. (1990). The performance of multistage interconnection networks with finite buffers. ACM SIGMETRICS Performance Evaluation Review, 18(1), 263-264. doi:10.1145/98460.98779DOI: 10.1145/98460.98779
1989
Lower bounds and efficient algorithms for multiprocessor scheduling of dags with communication delays (Conference Paper)
Jung, H., Kirousis, L., & Spirakis, P. (1989). Lower bounds and efficient algorithms for multiprocessor scheduling of dags with communication delays. In Proceedings of the first annual ACM symposium on Parallel algorithms and architectures. ACM. doi:10.1145/72935.72962DOI: 10.1145/72935.72962
Efficient distributed algorithms by using the archimedean time assumption (Journal article)
Spirakis, P., & Tampakas, B. (1989). Efficient distributed algorithms by using the archimedean time assumption. RAIRO - Theoretical Informatics and Applications, 23(1), 113-128. doi:10.1051/ita/1989230101131DOI: 10.1051/ita/1989230101131
Fast parallel algorithms and the complexity of parallelism (basic issues and recent advances) (Chapter)
Spirakis, P. G. (1989). Fast parallel algorithms and the complexity of parallelism (basic issues and recent advances). In Lecture Notes in Computer Science (pp. 177-189). Springer Berlin Heidelberg. doi:10.1007/3-540-50647-0_110DOI: 10.1007/3-540-50647-0_110
Fast parallel approximations of the maximum weighted cut problem through derandomization (Chapter)
Pantziou, G., Spirakis, P., & Zaroliagis, C. (1989). Fast parallel approximations of the maximum weighted cut problem through derandomization. In Lecture Notes in Computer Science (pp. 20-29). Springer Berlin Heidelberg. doi:10.1007/3-540-52048-1_29DOI: 10.1007/3-540-52048-1_29
Pythia and Tyche: An Eternal Golden Braid (Chapter)
Kirousis, L. M., & Spirakis, P. (1989). Pythia and Tyche: An Eternal Golden Braid. In The Concept of Probability (pp. 395-404). Springer Netherlands. doi:10.1007/978-94-009-1175-8_34DOI: 10.1007/978-94-009-1175-8_34
Symmetry breaking in asynchronous rings with o(n) messages (Chapter)
Spirakis, P., Tampakas, B., & Tsiolis, A. (1989). Symmetry breaking in asynchronous rings with o(n) messages. In Distributed Algorithms (pp. 233-241). Springer Berlin Heidelberg. doi:10.1007/3-540-51687-5_46DOI: 10.1007/3-540-51687-5_46
The approximability of problems complete for P (Chapter)
Serna, M., & Spirakis, P. (1989). The approximability of problems complete for P. In Lecture Notes in Computer Science (pp. 193-204). Springer Berlin Heidelberg. doi:10.1007/3-540-51859-2_16DOI: 10.1007/3-540-51859-2_16
The parallel complexity of the subgraph connectivity problem (Conference Paper)
Kirousis, L., Serna, M., & Spirakis, P. (1989). The parallel complexity of the subgraph connectivity problem. In 30th Annual Symposium on Foundations of Computer Science. IEEE. doi:10.1109/sfcs.1989.63493DOI: 10.1109/sfcs.1989.63493
1988
Fast parallel algorithms and the complexity of parallelism (Basic issues and recent advances) (Chapter)
Spirakis, P. (1988). Fast parallel algorithms and the complexity of parallelism (Basic issues and recent advances). In Parcella ‘88 (pp. 177-190). De Gruyter. doi:10.1515/9783112528365-010DOI: 10.1515/9783112528365-010
Efficient distributed algorithms by using the archimedean time assumption (Chapter)
Spirakis, P., & Tampakas, B. (n.d.). Efficient distributed algorithms by using the archimedean time assumption. In STACS 88 (pp. 248-263). Springer-Verlag. doi:10.1007/bfb0035849DOI: 10.1007/bfb0035849
Fast parallel algorithms for processing of joins (Chapter)
Shasha, D., & Spirakis, P. (1988). Fast parallel algorithms for processing of joins. In Lecture Notes in Computer Science (pp. 939-953). Springer Berlin Heidelberg. doi:10.1007/3-540-18991-2_55DOI: 10.1007/3-540-18991-2_55
Optimal parallel randomized algorithms for sparse addition and identification (Journal article)
Spirakis, P. G. (1988). Optimal parallel randomized algorithms for sparse addition and identification. Information and Computation, 76(1), 1-12. doi:10.1016/0890-5401(88)90039-9DOI: 10.1016/0890-5401(88)90039-9
Probabilistic log-space reductions and problems probabilistically hard for p (Chapter)
Kirousis, L. M., & Spirakis, P. (1988). Probabilistic log-space reductions and problems probabilistically hard for p. In SWAT 88 (pp. 163-175). Springer Berlin Heidelberg. doi:10.1007/3-540-19487-8_19DOI: 10.1007/3-540-19487-8_19
1987
Queueing delays in buffered multistage interconnection networks (Journal article)
Bouras, C., & Garofalakis, J. (1987). Queueing delays in buffered multistage interconnection networks. ACM SIGMETRICS Performance Evaluation Review, 15(1), 111-121. doi:10.1145/29904.29918DOI: 10.1145/29904.29918
The diameter of connected components of random graphs (Chapter)
Spirakis, P. (1987). The diameter of connected components of random graphs. In Graph-Theoretic Concepts in Computer Science (pp. 264-276). Springer Berlin Heidelberg. doi:10.1007/3-540-17218-1_64DOI: 10.1007/3-540-17218-1_64
The parallel complexity of deadlock detection (Journal article)
Spirakis, P. (1987). The parallel complexity of deadlock detection. Theoretical Computer Science, 52(1-2), 155-163. doi:10.1016/0304-3975(87)90084-3DOI: 10.1016/0304-3975(87)90084-3
1986
LOGICAL 'FIRST MILE-LAST MILE' DIGITAL TERMINAL SYSTEMS. (Conference Paper)
Spirakis, P. (1986). LOGICAL 'FIRST MILE-LAST MILE' DIGITAL TERMINAL SYSTEMS.. In Conference Record - International Conference on Communications (pp. 1763).
A very fast, practical algorithm for finding a negative cycle in a digraph (Chapter)
Spirakis, P., & Tsakalidis, A. (1986). A very fast, practical algorithm for finding a negative cycle in a digraph. In Automata, Languages and Programming (pp. 397-406). Springer Berlin Heidelberg. doi:10.1007/3-540-16761-7_89DOI: 10.1007/3-540-16761-7_89
Foreword (Book)
Makedon, F., Mehlhorn, K., Papatheodorou, T., & Spirakis, P. (1986). Foreword (Vol. 227 LNCS).
Input sensitive, optimal parallel randomized algorithms for addition and identification (Chapter)
Spirakis, P. G. (1986). Input sensitive, optimal parallel randomized algorithms for addition and identification. In STACS 86 (pp. 73-86). Springer Berlin Heidelberg. doi:10.1007/3-540-16078-7_66DOI: 10.1007/3-540-16078-7_66
The parallel complexity of deadlock detection (Chapter)
Spirakis, P. (n.d.). The parallel complexity of deadlock detection. In Lecture Notes in Computer Science (pp. 582-593). Springer-Verlag. doi:10.1007/bfb0016285DOI: 10.1007/bfb0016285
1985
A semantic approach to correctness of concurrent transaction executions (Conference Paper)
Tuzhilin, A., & Spirakis, P. G. (1985). A semantic approach to correctness of concurrent transaction executions. In Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems. ACM. doi:10.1145/325405.325416DOI: 10.1145/325405.325416
The volume of the union of many spheres and point inclusion problems (Chapter)
Spirakis, P. G. (n.d.). The volume of the union of many spheres and point inclusion problems. In STACS 85 (pp. 328-338). Springer-Verlag. doi:10.1007/bfb0024021DOI: 10.1007/bfb0024021
Unbounded Speed Variability in Distributed Communications Systems (Journal article)
Reif, J. H., & Spirakis, P. G. (1985). Unbounded Speed Variability in Distributed Communications Systems. SIAM Journal on Computing, 14(1), 75-92. doi:10.1137/0214005DOI: 10.1137/0214005
k-connectivity in random undirected graphs (Journal article)
Reif, J. H., & Spirakis, P. G. (1985). k-connectivity in random undirected graphs. Discrete Mathematics, 54(2), 181-191. doi:10.1016/0012-365x(85)90079-2DOI: 10.1016/0012-365x(85)90079-2
1984
Strong np-hardness of moving many discs (Journal article)
Spirakis, P., & Yap, C. K. (1984). Strong np-hardness of moving many discs. Information Processing Letters, 19(1), 55-59. doi:10.1016/0020-0190(84)90130-3DOI: 10.1016/0020-0190(84)90130-3
Real-Time Synchronization of Interprocess Communications (Journal article)
Reif, J. H., & Spirakis, P. G. (1984). Real-Time Synchronization of Interprocess Communications. ACM Transactions on Programming Languages and Systems, 6(2), 215-238. doi:10.1145/2993.357244DOI: 10.1145/2993.357244
Coordinating Pebble Motion On Graphs, The Diameter Of Permutation Groups, And Applications (Conference Paper)
Kornhauser, D., Miller, G., & Spirakis, P. (1984). Coordinating Pebble Motion On Graphs, The Diameter Of Permutation Groups, And Applications. In 25th Annual Symposium onFoundations of Computer Science, 1984.. IEEE. doi:10.1109/sfcs.1984.715921DOI: 10.1109/sfcs.1984.715921
Probabilistic bidding gives optimal distributed resource allocation (Chapter)
Reif, J., & Spirakis, P. (1984). Probabilistic bidding gives optimal distributed resource allocation. In Automata, Languages and Programming (pp. 391-402). Springer Berlin Heidelberg. doi:10.1007/3-540-13345-3_36DOI: 10.1007/3-540-13345-3_36
1982
REAL TIME RESOURCE ALLOCATION IN DISTRIBUTED SYSTEMS. (Conference Paper)
Reif, J., & Spirakis, P. (1982). REAL TIME RESOURCE ALLOCATION IN DISTRIBUTED SYSTEMS.. In Unknown Conference (pp. 84-94).
Real time resource allocation in distributed systems (Conference Paper)
Reif, J., & Spirakis, P. (1982). Real time resource allocation in distributed systems. In Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '82. ACM Press. doi:10.1145/800220.806685DOI: 10.1145/800220.806685
Unbounded speed variability in distributed communication systems (Conference Paper)
Reif, J., & Spirakis, P. (1982). Unbounded speed variability in distributed communication systems. In Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '82. ACM Press. doi:10.1145/582153.582159DOI: 10.1145/582153.582159
1981
Random Independence Systems (Journal article)
Reif, J. H., & Spirakis, P. G. (1981). Random Independence Systems. doi:10.21236/ada109046DOI: 10.21236/ada109046
Strong K-Connectivity in Digraphs and Random Digraphs (Journal article)
Reif, J. H., & Spirakis, P. G. (1981). Strong K-Connectivity in Digraphs and Random Digraphs. doi:10.21236/ada109034DOI: 10.21236/ada109034
Distributed algorithms for synchronizing interprocess communication within real time (Conference Paper)
Reif, J., & Spirakis, P. (1981). Distributed algorithms for synchronizing interprocess communication within real time. In Proceedings of the thirteenth annual ACM symposium on Theory of computing - STOC '81. ACM Press. doi:10.1145/800076.802467DOI: 10.1145/800076.802467
K-Connectivity in Random Undirected Graphs. (Journal article)
Reif, J. H., & Spirakis, P. G. (1981). K-Connectivity in Random Undirected Graphs.. doi:10.21236/ada108826DOI: 10.21236/ada108826
1980
Random matroids (Conference Paper)
Reif, J. H., & Spirakis, P. G. (1980). Random matroids. In Proceedings of the twelfth annual ACM symposium on Theory of computing - STOC '80. ACM Press. doi:10.1145/800141.804688DOI: 10.1145/800141.804688