Skip to main content

Professor Paul Spirakis
PhD - Member of Academia Europaea

Professor in Computer Science
Computer Science
Part of
School of Electrical Engineering, Electronics and Computer Science
Faculty of Science and Engineering

Contact

P.Spirakis@liverpool.ac.uk

Publications

What type of publication do you want to show?

2024

Approximate and Randomized Algorithms for Computing a Second Hamiltonian Cycle

Deligkas, A., Mertzios, G. B., Spirakis, P. G., & Zamaraev, V. (2024). Approximate and Randomized Algorithms for Computing a Second Hamiltonian Cycle. Algorithmica, 86(9), 2766-2785. doi:10.1007/s00453-024-01238-z

DOI
10.1007/s00453-024-01238-z
Journal article

Collision-Free Robot Scheduling.

Preprint

On the Existence of Consensus Converging Organized Groups in Large Social Networks

Liagkou, V., Nastou, P. E., Spirakis, P., & Stamatiou, Y. C. (2024). On the Existence of Consensus Converging Organized Groups in Large Social Networks. In Lecture Notes in Computer Science (pp. 507-512). Springer Nature Switzerland. doi:10.1007/978-3-031-60603-8_30

DOI
10.1007/978-3-031-60603-8_30
Chapter

Structural and Combinatorial Properties of 2-Swap Word Permutation Graphs.

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

Conference Paper

2023

A Shared Memory SMC Sampler for Decision Trees

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) Vol. 386 (pp. 209-218). IEEE. doi:10.1109/sbac-pad59825.2023.00030

DOI
10.1109/sbac-pad59825.2023.00030
Conference Paper

Preface

Doty, D., & Spirakis, P. (2023). Preface. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 257. doi:10.4230/LIPIcs.SAND.2023.0

DOI
10.4230/LIPIcs.SAND.2023.0
Conference Paper

On the existence of highly organized communities in networks of locally interacting agents

DOI
10.48550/arxiv.2304.04480
Preprint

GestureSet: Public Domain Dataset for Human Gesture Recognition using Wrist-worn Devices: A Preliminary Version

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.00071

DOI
10.1109/dcoss-iot58021.2023.00071
Conference Paper

Realizing Predictive Maintenance in Production Machinery Through Low-Cost IIoT Framework and Anomaly Detection: A Case Study in a Real-World Manufacturing Environment

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.00062

DOI
10.1109/dcoss-iot58021.2023.00062
Conference Paper

2022

A spectral algorithm for finding maximum cliques in dense random intersection graphs

DOI
10.48550/arxiv.2210.02121
Preprint

The Complexity of Temporal Vertex Cover in Small-Degree Graphs

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/

Conference Paper

Simple and fast approximate counting and leader election in populations

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.104698

DOI
10.1016/j.ic.2021.104698
Journal article

Distributed Computation and Reconfiguration in Actively Dynamic Networks

Michail, O., Skretas, G., & Spirakis, P. (2022). Distributed Computation and Reconfiguration in Actively Dynamic Networks. Distributed Computing. doi:10.1007/s00446-021-00415-5

DOI
10.1007/s00446-021-00415-5
Journal article

Data-driven soft sensing towards quality monitoring of industrial pasteurization processes

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) Vol. 21 (pp. 167-174). IEEE. doi:10.1109/dcoss54816.2022.00039

DOI
10.1109/dcoss54816.2022.00039
Conference Paper

The Complexity of Growing a Graph

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_9

DOI
10.1007/978-3-031-22050-0_9
Conference Paper

2021

ASPIDA: An Observatory for Security and Privacy in the Greek e-Business Sector

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.3503890

DOI
10.1145/3503823.3503890
Conference Paper

ASPIDA: A client-oriented platform for assessing websites security practices adoption and reward

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.9653275

DOI
10.1109/TELFOR52709.2021.9653275
Conference Paper

Computing exact solutions of consensus halving and the Borsuk-Ulam theorem

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.006

DOI
10.1016/j.jcss.2020.10.006
Conference Paper

The Price of Defense

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-7

DOI
10.1007/s00453-020-00783-7
Journal article

A human-centered Web-based tool for the effective real-time motion data collection and annotation from BLE IoT devices

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.00067

DOI
10.1109/DCOSS52077.2021.00067
Conference Paper

New Clocks, Optimal Line Formation and Efficient Replication Population Protocols (Making Population Protocols Alive).

Preprint

Walrasian equilibria in markets with small demands

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).

Conference Paper

2020

MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems

DOI
10.48550/arxiv.2009.01567
Preprint

Gathering in 1-Interval Connected Graphs

Michail, O., Spirakis, P. G., & Theofilatos, M. (n.d.). Gathering in 1-Interval Connected Graphs. Retrieved from http://arxiv.org/abs/2008.07455v1

Journal article

Distributed Computation and Reconfiguration in Actively Dynamic Networks

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.3405744

DOI
10.1145/3382734.3405744
Conference Paper

Matching in Stochastically Evolving Graphs

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

Report

A smart energy management power supply unit for low-power IoT systems

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) (pp. 227-235). IEEE. doi:10.1109/dcoss49796.2020.00045

DOI
10.1109/dcoss49796.2020.00045
Conference Paper

An IoT based Solar Park Health Monitoring System for PID and Hotspots Effects

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) Vol. 10 (pp. 396-403). IEEE. doi:10.1109/dcoss49796.2020.00069

DOI
10.1109/dcoss49796.2020.00069
Conference Paper

Preface

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.021

DOI
10.1016/j.tcs.2019.12.021
Journal article

Temporal Vertex Cover with a Sliding Time Window

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.002

DOI
10.1016/j.jcss.2019.08.002
Journal article

Crystal Structure Prediction via Oblivious Local Search.

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

Conference Paper

Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle.

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

Conference Paper

2019

Fault Tolerant Network Constructors

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

Journal article

Connected Subgraph Defense Games

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

Conference Paper

Preface

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.003

DOI
10.1016/j.tcs.2019.05.003
Journal article

The temporal explorer who returns to the base

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

Journal article

Binary Search in Graphs Revisited.

Deligkas, A., Mertzios, G. B., & Spirakis, P. G. (2019). Binary Search in Graphs Revisited.. Algorithmica, 81, 1757-1780. doi:10.1007/s00453-018-0501-y

DOI
10.1007/s00453-018-0501-y
Journal article

Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem.

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

Conference Paper

Connected Subgraph Defense Games

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_15

DOI
10.1007/978-3-030-30473-7_15
Chapter

Data-Driven Intrusion Detection for Ambient Intelligence

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_16

DOI
10.1007/978-3-030-34255-5_16
Conference Paper

Fault Tolerant Network Constructors

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_19

DOI
10.1007/978-3-030-34992-9_19
Chapter

On the transformation capability of feasible mechanisms for programmable matter.

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.

Journal article

Randomized and Set-System Based Collusion Resistant Key Predistribution Schemes (Brief Announcement)

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_28

DOI
10.1007/978-3-030-20951-3_28
Chapter

Randomized and set-system based collusion resistant key predistribution schemes

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_28

DOI
10.1007/978-3-030-20951-3_28
Conference Paper

The Price of Stability of Weighted Congestion Games

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/18M1207880

DOI
10.1137/18M1207880
Journal article

The Temporal Explorer Who Returns to the Base

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_2

DOI
10.1007/978-3-030-17402-6_2
Chapter

2018

How many cooks spoil the soup?

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

DOI
10.1007/s00446-017-0317-z
Journal article

Binary Search in Graphs Revisited

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

Journal article

Preface

Potapov, I., Spirakis, P., & Worrell, J. (2018). Preface. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 117. doi:10.4230/LIPIcs.MFCS.2018.0

DOI
10.4230/LIPIcs.MFCS.2018.0
Conference Paper

The Price of Stability of Weighted Congestion Games

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.150

DOI
10.4230/LIPIcs.ICALP.2018.150
Conference Paper

Randomized Approximation Techniques

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-11

DOI
10.1201/9781351236423-11
Chapter

Mutants and Residents with Different Connection Graphs in the Moran Process.

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

Conference Paper

Communications of ACM (CACM)

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

Journal article

Approximating the Existential Theory of the Reals.

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

Conference Paper

Random input helps searching predecessors

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

Conference Paper

Strategic Contention Resolution in Multiple Channels.

Christodoulou, G., Melissourgos, T., & Spirakis, P. G. (2018). Strategic Contention Resolution in Multiple Channels.. CoRR, abs/1810.04565.

Journal article

The Price of Stability of Weighted Congestion Games.

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.

Conference Paper

2017

Mutants and Residents with Different Connection Graphs in the Moran Process

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

DOI
10.1007/978-3-319-77404-6_57
Journal article

A 3-player protocol preventing persistence in strategic contention with limited feedback

DOI
10.48550/arxiv.1707.01439
Preprint

Binary Search in Graphs Revisited

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

Conference Paper

Computing Approximate Nash Equilibria in Polymatrix Games

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

DOI
10.1007/s00453-015-0078-7
Journal article

Determining majority in networks with local interactions and very small local memory

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

DOI
10.1007/s00446-016-0277-8
Journal article

Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff Values

DOI
10.48550/arxiv.1701.08108
Preprint

A 3-Player Protocol Preventing Persistence in Strategic Contention with Limited Feedback.

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

Conference Paper

Cover Time in Edge-Uniform Stochastically-Evolving Graphs

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_33

DOI
10.1007/978-3-319-69084-1_33
Chapter

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

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

Conference Paper

Preface

Spirakis, P., & Tsigas, P. (2017). Preface (Vol. 10616 LNCS).

Book

Temporal Flows in Temporal Networks

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_5

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

The Computational Complexity of Weighted Greedy Matching

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/

Conference Paper

2016

How Many Cooks Spoil the Soup ?

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).

Conference Paper

Traveling Salesman Problems in Temporal Graphs

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.006

DOI
10.1016/j.tcs.2016.04.006
Journal article

Simple and efficient local codes for distributed stable network construction

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

DOI
10.1007/s00446-015-0257-4
Journal article

Approximations of Bimatrix Nash Equilibria

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_30

DOI
10.1007/978-1-4939-2864-4_30
Chapter

Best Response Algorithms for Selfish Routing

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_46

DOI
10.1007/978-1-4939-2864-4_46
Chapter

Flows in Temporal networks.

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

Journal article

Hamilton Cycles in Random Intersection Graphs

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_176

DOI
10.1007/978-1-4939-2864-4_176
Chapter

How Many Cooks Spoil the Soup?

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_1

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

INTERVIEW WITH PAUL SPIRAKIS PRESIDENT OF THE EATCS

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/

Journal article

Independent Sets in Random Intersection Graphs

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_187

DOI
10.1007/978-1-4939-2864-4_187
Chapter

Lipschitz Continuity and Approximate Equilibria

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_2

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

Minimum Congestion Redundant Assignments

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_232

DOI
10.1007/978-1-4939-2864-4_232
Chapter

Selfish Unsplittable Flows: Algorithms for Pure Equilibria

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_360

DOI
10.1007/978-1-4939-2864-4_360
Chapter

Stackelberg Games: The Price of Optimum

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_398

DOI
10.1007/978-1-4939-2864-4_398
Chapter

Strategic Contention Resolution with Limited Feedback.

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

Conference Paper

Tail Bounds for Occupancy Problems

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_419

DOI
10.1007/978-1-4939-2864-4_419
Chapter

Weighted Random Sampling

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_478

DOI
10.1007/978-1-4939-2864-4_478
Chapter

2015

Lipschitz Continuity and Approximate Equilibria

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

DOI
10.1007/978-3-662-53354-3_2
Journal article

PODC 2015 Chairs' welcome

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).

Conference Paper

Session details: Session 2

Spirakis, P. G. (2015). Session details: Session 2. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing. ACM. doi:10.1145/3260478

DOI
10.1145/3260478
Conference Paper

On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols

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

DOI
10.1007/978-3-662-47672-7_32
Conference Paper

On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols

DOI
10.48550/arxiv.1503.09168
Preprint

On Temporally Connected Graphs of Small Cost

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

DOI
10.1007/978-3-319-28684-6_8
Conference Paper

Temporal Network Optimization Subject to Connectivity Constraints

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/

Conference Paper

Approximations of Bimatrix Nash Equilibria

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-2

DOI
10.1007/978-3-642-27848-8_30-2
Chapter

Designing and Testing Temporally Connected Graphs.

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

Journal article

On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols.

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

Conference Paper

On Equilibrium Computation in Biased Games with Quadratic Penalties.

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

Journal article

On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations

Andreou, M., Fotakis, D., Lesta, V. P., Nikoletseas, S., & Spirakis, P. (2015). On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations. In Lecture Notes in Computer Science (pp. 97-132). Springer International Publishing. doi:10.1007/978-3-319-24024-4_8

DOI
10.1007/978-3-319-24024-4_8
Chapter

On Temporally Connected Graphs of Small Cost

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_8

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

On Verifying and Maintaining Connectivity of Interval Temporal Networks

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_11

DOI
10.1007/978-3-319-28472-9_11
Conference Paper

On the discrete dynamics of probabilistic (finite) population protocols

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.

Conference Paper

Rationality Authority for Provable Rational Behavior

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_5

DOI
10.1007/978-3-319-24024-4_5
Conference Paper

The Match-Maker: Constant-Space Distributed Majority via Random Walks

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_5

DOI
10.1007/978-3-319-21741-3_5
Conference Paper

2014

Computing Approximate Nash Equilibria in Polymatrix Games

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/

Conference Paper

Session details: Session 10

Spirakis, P. (2014). Session details: Session 10. In Proceedings of the 2014 ACM symposium on Principles of distributed computing. ACM. doi:10.1145/3246724

DOI
10.1145/3246724
Conference Paper

Ephemeral Networks with Random Availability of Links: Diameter and Connectivity

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.2612693

DOI
10.1145/2612669.2612693
Conference Paper

Determining Majority in Networks with Local Interactions and Very Small Local Memory

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/

Conference Paper

Determining Majority in Networks with Local Interactions and very Small Local Memory

DOI
10.48550/arxiv.1404.7671
Preprint

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

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

DOI
10.1007/s00224-013-9446-3
Journal article

Computing Approximate Nash Equilibria in Polymatrix Games

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_5

DOI
10.1007/978-3-319-13129-0_5
Chapter

Determining Majority in Networks with Local Interactions and Very Small Local Memory

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_72

DOI
10.1007/978-3-662-43948-7_72
Chapter

Information security for sensors by overwhelming random sequences and permutations

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

DOI
10.1016/j.adhoc.2011.09.002
Journal article

On the Design of Agent Agreement Protocol using Linear Error-Correcting Codes

Nastou, P. E., Pardalos, P., Spirakis, P., & Stamatiou, Y. C. (2014). On the Design of Agent Agreement Protocol using Linear Error-Correcting Codes. In Springer Optimization and Its Applications (pp. 389-403). Springer International Publishing. doi:10.1007/978-3-319-04720-1_24

DOI
10.1007/978-3-319-04720-1_24
Chapter

Privacy Preserving Course Evaluations in Greek Higher Education Institutes: An e-Participation Case Study with the Empowerment of Attribute Based Credentials

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 Lecture Notes in Computer Science (pp. 140-156). Springer Berlin Heidelberg. doi:10.1007/978-3-642-54069-1_9

DOI
10.1007/978-3-642-54069-1_9
Chapter

Stackelberg Games: The Price of Optimum

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-2

DOI
10.1007/978-3-642-27848-8_398-2
Chapter

Traveling Salesman Problems in Temporal Graphs

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/

Conference Paper

2013

Agent agreement protocols based on golay error-correcting code

Nastou, P. E., Spirakis, P., Stamatiou, Y., & Vichou, C. (2013). Agent agreement protocols based on golay error-correcting code. In IISA 2013 (pp. 1-6). IEEE. doi:10.1109/iisa.2013.6623689

DOI
10.1109/iisa.2013.6623689
Conference Paper

Resolving Braess’s Paradox in Random Networks

Fotakis, D., Kaporis, A. C., Lianeas, T., & Spirakis, P. G. (2013). Resolving Braess’s Paradox in Random Networks. In Lecture Notes in Computer Science (pp. 188-201). Springer Berlin Heidelberg. doi:10.1007/978-3-642-45046-4_16

DOI
10.1007/978-3-642-45046-4_16
Chapter

On the Derivation of a Closed-Form Expression for the Solutions of a Subclass of Generalized Abel Differential Equations

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/929286

DOI
10.1155/2013/929286
Journal article

The computational power of simple protocols for self-awareness on graphs

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.026

DOI
10.1016/j.tcs.2012.08.026
Journal article

Simple and Efficient Local Codes for Distributed Stable Network Construction

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.2611466

DOI
10.1145/2611462.2611466
Conference Paper

Algorithms and Complexity

Spirakis, P. G., & Serna, M. (Eds.) (2013). Algorithms and Complexity. Springer Berlin Heidelberg. doi:10.1007/978-3-642-38233-8

DOI
10.1007/978-3-642-38233-8
Book

On the Structure of Equilibria in Basic Network Formation

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_25

DOI
10.1007/978-3-642-40164-0_25
Conference Paper

The Price of Anarchy is Unbounded for Congestion Games with Superpolynomial Latency Costs

DOI
10.48550/arxiv.1308.4101
Preprint

On the fixation probability of superstars

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.0193

DOI
10.1098/rspa.2013.0193
Journal article

A Guided Tour in Random Intersection Graphs

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/

Conference Paper

Strong Bounds for Evolution in Networks

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/

Conference Paper

Preface to Special Issue on Algorithmic Game Theory

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-z

DOI
10.1007/s00224-013-9466-z
Journal article

On the structure of equilibria in basic network formation

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

DOI
10.1016/j.tcs.2015.03.029
Journal article

A Framework for Protecting Voters’ Privacy In Electronic Voting Procedures

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.2013040101

DOI
10.4018/jcit.2013040101
Journal article

Natural models for evolution on networks

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.032

DOI
10.1016/j.tcs.2012.11.032
Journal article

Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs

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_29

DOI
10.1007/978-3-642-35843-2_29
Chapter

Attribute Based Credentials Towards Refined Public Consultation Results and Effective eGovernance

Spirakis, P., & Stamatiou, Y. C. (2013). Attribute Based Credentials Towards Refined Public Consultation Results and Effective eGovernance. In Communications in Computer and Information Science (pp. 115-126). Springer Berlin Heidelberg. doi:10.1007/978-3-642-41205-9_10

DOI
10.1007/978-3-642-41205-9_10
Chapter

Naming and Counting in Anonymous Unknown Dynamic Networks

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_20

DOI
10.1007/978-3-319-03089-0_20
Chapter

Potential Functions in Strategic Games

Spirakis, P. G., & Panagopoulou, P. N. (2013). Potential Functions in Strategic Games. In Lecture Notes in Computer Science (pp. 283-297). Springer Berlin Heidelberg. doi:10.1007/978-3-642-38536-0_25

DOI
10.1007/978-3-642-38536-0_25
Chapter

Temporal Network Optimization Subject to Connectivity Constraints

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_57

DOI
10.1007/978-3-642-39212-2_57
Chapter

2012

Causality, Influence, and Computation in Possibly Disconnected Synchronous Dynamic Networks

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_19

DOI
10.1007/978-3-642-35476-2_19
Conference Paper

Brief Announcement: Naming and Counting in Anonymous Unknown Dynamic Networks

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/

Conference Paper

On the Hardness of Network Design for Bottleneck Routing Games

Fotakis, D., Kaporis, A. C., Lianeas, T., & Spirakis, P. G. (2012). On the Hardness of Network Design for Bottleneck Routing Games. In Lecture Notes in Computer Science (pp. 156-167). Springer Berlin Heidelberg. doi:10.1007/978-3-642-33996-7_14

DOI
10.1007/978-3-642-33996-7_14
Chapter

A Probabilistic Key Agreement Scheme for Sensor Networks without Key Predistribution

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_11

DOI
10.1007/978-3-642-33448-1_11
Chapter

Terminating Population Protocols via Some Minimal Global Knowledge Assumptions

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_8

DOI
10.1007/978-3-642-33536-5_8
Conference Paper

Efficient methods for selfish network design

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.033

DOI
10.1016/j.tcs.2012.04.033
Journal article

Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs

Nikoletseas, S., Raptopoulos, C., & Spirakis, P. G. (2012). Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs. In Lecture Notes in Computer Science (pp. 728-739). Springer Berlin Heidelberg. doi:10.1007/978-3-642-32589-2_63

DOI
10.1007/978-3-642-32589-2_63
Chapter

Naming and Counting in Anonymous Unknown Dynamic Networks

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/

Conference Paper

On the hardness of network design for bottleneck routing games

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

DOI
10.1016/j.tcs.2013.11.035
Journal article

Adaptive Hierarchical Network Structures for Wireless Sensor Networks

Amaxilatis, D., Chatzigiannakis, I., Dolev, S., Koninis, C., Pyrgelis, A., & Spirakis, P. G. (2012). Adaptive Hierarchical Network Structures for Wireless Sensor Networks. In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering (pp. 65-80). Springer Berlin Heidelberg. doi:10.1007/978-3-642-29096-1_5

DOI
10.1007/978-3-642-29096-1_5
Chapter

On mutual concavity and strategically-zero-sum bimatrix games

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.016

DOI
10.1016/j.tcs.2012.01.016
Journal article

Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs

DOI
10.48550/arxiv.1204.4054
Preprint

The Impact of Social Ignorance on Weighted Congestion Games

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-2

DOI
10.1007/s00224-011-9355-2
Journal article

Algorithms and Almost Tight Results for -Colorability of Small Diameter Graphs

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

DOI
10.1007/s00453-014-9949-6
Journal article

Approximating Fixation Probabilities in the Generalized Moran Process

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 (pp. 954-960). Society for Industrial and Applied Mathematics. doi:10.1137/1.9781611973099.76

DOI
10.1137/1.9781611973099.76
Conference Paper

Playing a Game to Bound the Chromatic Number

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.771

DOI
10.4169/amer.math.monthly.119.09.771
Journal article

2011

Elliptic Curve Based Zero Knowledge Proofs and their Applicability on Resource Constrained Devices

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 Vol. 537 (pp. 715-720). IEEE. doi:10.1109/mass.2011.77

DOI
10.1109/mass.2011.77
Conference Paper

ICT and eGovernance

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.ch007

DOI
10.4018/978-1-60960-839-2.ch007
Chapter

Selected Combinatorial Properties of Random Intersection Graphs

Nikoletseas, S., Raptopoulos, C., & Spirakis, P. G. (2011). Selected Combinatorial Properties of Random Intersection Graphs. In Lecture Notes in Computer Science (pp. 347-362). Springer Berlin Heidelberg. doi:10.1007/978-3-642-24897-9_15

DOI
10.1007/978-3-642-24897-9_15
Chapter

Approximating Fixation Probabilities in the Generalized Moran Process

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

DOI
10.1007/s00453-012-9722-7
Journal article

On the independence number and Hamiltonicity of uniform random intersection graphs

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.003

DOI
10.1016/j.tcs.2011.09.003
Journal article

The Computational Power of Simple Protocols for Self-awareness on Graphs

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/

Conference Paper

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

Panagopoulou, P. N., & Spirakis, P. G. (2011). Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof). In Lecture Notes in Computer Science (pp. 190-199). Springer Berlin Heidelberg. doi:10.1007/978-3-642-24829-0_18

DOI
10.1007/978-3-642-24829-0_18
Chapter

Communication and security in random intersection graphs models

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 Vol. 48 (pp. 1-6). IEEE. doi:10.1109/wowmom.2011.5986170

DOI
10.1109/wowmom.2011.5986170
Conference Paper

On the Performance of Approximate Equilibria in Congestion Games

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-2

DOI
10.1007/s00453-010-9449-2
Journal article

Selfish splittable flows and -completeness

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.002

DOI
10.1016/j.cosrev.2011.04.002
Journal article

Elliptic Curve Based Zero Knowledge Proofs and Their Applicability on Resource Constrained Devices

DOI
10.48550/arxiv.1107.1626
Preprint

Passively mobile communicating machines that use restricted space

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 Vol. 93 (pp. 6-15). ACM. doi:10.1145/1998476.1998480

DOI
10.1145/1998476.1998480
Conference Paper

Rationality authority for provable rational behavior

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 (pp. 289-290). ACM. doi:10.1145/1993806.1993858

DOI
10.1145/1993806.1993858
Conference Paper

Approximability of Symmetric Bimatrix Games and Related Experiments

Kontogiannis, S., & Spirakis, P. (2011). Approximability of Symmetric Bimatrix Games and Related Experiments. In Lecture Notes in Computer Science (pp. 1-20). Springer Berlin Heidelberg. doi:10.1007/978-3-642-20662-7_1

DOI
10.1007/978-3-642-20662-7_1
Chapter

New Models for Population Protocols

Michail, O., Chatzigiannakis, I., & Spirakis, P. G. (2011). New Models for Population Protocols (Vol. 2). Springer Science and Business Media LLC. doi:10.2200/s00328ed1v01y201101dct006

DOI
10.2200/s00328ed1v01y201101dct006
Book

Computational models for networks of tiny artifacts: A survey

À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.001

DOI
10.1016/j.cosrev.2010.09.001
Journal article

Innovative approaches for security of small artefacts

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.002

DOI
10.1016/j.cosrev.2010.09.002
Journal article

Introduction to the special issue on foundations of adaptive networked societies of tiny artefacts

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.003

DOI
10.1016/j.cosrev.2010.11.003
Journal article

Robust and scalable middleware for selfish-computer systems

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.008

DOI
10.1016/j.cosrev.2010.09.008
Journal article

Natural Models for Evolution on Networks

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_25

DOI
10.1007/978-3-642-25510-6_25
Chapter

New Models for Population Protocols

Michail, O., Chatzigiannakis, I., & Spirakis, P. G. (2011). New Models for Population Protocols. Springer International Publishing. doi:10.1007/978-3-031-02004-9

DOI
10.1007/978-3-031-02004-9
Book

Population Protocols and Related Models

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_5

DOI
10.1007/978-3-642-14849-1_5
Chapter

Probabilistic Data Propagation in Wireless Sensor Networks

Nikoletseas, S., & Spirakis, P. G. (2011). Probabilistic Data Propagation in Wireless Sensor Networks. In Monographs in Theoretical Computer Science. An EATCS Series (pp. 353-380). Springer Berlin Heidelberg. doi:10.1007/978-3-642-14849-1_12

DOI
10.1007/978-3-642-14849-1_12
Chapter

Strategies for repeated games with subsystem takeovers implementable by deterministic and self-stabilising automata

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.037747

DOI
10.1504/ijaacs.2011.037747
Journal article

2010

Passively mobile communicating machines that use restricted space

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.001

DOI
10.1016/j.tcs.2011.07.001
Journal article

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

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).

Book

A Secure Data Management Model for Cultural Organizations

Liagkou, V., & Spirakis, P. (2010). A Secure Data Management Model for Cultural Organizations. In 2010 International Conference on Multimedia Information Networking and Security Vol. 19 (pp. 616-620). IEEE. doi:10.1109/mines.2010.135

DOI
10.1109/mines.2010.135
Conference Paper

Can Formalism Alone Provide an Answer to the Quest of a Viable Definition of Trust in the WWW Society?

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 Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering (pp. 199-208). Springer Berlin Heidelberg. doi:10.1007/978-3-642-11631-5_19

DOI
10.1007/978-3-642-11631-5_19
Chapter

Distributed Game-Theoretic Vertex Coloring

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_9

DOI
10.1007/978-3-642-17653-1_9
Chapter

Fun with Games

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_3

DOI
10.1007/978-3-642-13122-6_3
Chapter

MURPESS - MUlti radio pedestrian energy scavenging sensor network

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.

Conference Paper

Practical and Efficient Approximations of Nash Equilibria for Win-Lose Games Based on Graph Spectra

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_31

DOI
10.1007/978-3-642-17572-5_31
Chapter

The Impact of the Web and Political Balance to e-Democracy

Manolopoulos, C., Efstathiadou, R., & Spirakis, P. (2010). The Impact of the Web and Political Balance to e-Democracy. In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering (pp. 13-28). Springer Berlin Heidelberg. doi:10.1007/978-3-642-11631-5_2

DOI
10.1007/978-3-642-11631-5_2
Chapter

Blueprints for a Large-Scale Early Warning System

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.27

DOI
10.1109/pci.2010.27
Conference Paper

All Symmetric Predicates in <i>NSPACE</i>(<i>n</i><SUP>2</SUP>) Are Stably Computable by the Mediated Population Protocol Model

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/

Conference Paper

Algorithmic Verification of Population Protocols

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/

Conference Paper

Stably Decidable Graph Languages by Mediated Population Protocols

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/

Conference Paper

Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses

Kontogiannis, S., & Spirakis, P. (2010). Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses. In Lecture Notes in Computer Science (pp. 312-325). Springer Berlin Heidelberg. doi:10.1007/978-3-642-15369-3_24

DOI
10.1007/978-3-642-15369-3_24
Chapter

Information security for sensors by overwhelming random sequences and permutations

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 (pp. 669-671). ACM. doi:10.1145/1866307.1866392

DOI
10.1145/1866307.1866392
Conference Paper

Information security for sensors by overwhelming random sequences and permutations

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 (pp. 43-48). ACM. doi:10.1145/1860684.1860694

DOI
10.1145/1860684.1860694
Conference Paper

Sharp thresholds for Hamiltonicity in random intersection graphs

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.022

DOI
10.1016/j.tcs.2010.06.022
Journal article

Well Supported Approximate Equilibria in Bimatrix Games

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-6

DOI
10.1007/s00453-008-9227-6
Journal article

Atomic Congestion Games: Fast, Myopic and Concurrent

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-2

DOI
10.1007/s00224-009-9198-2
Journal article

Brief announcement

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 (pp. 76-78). ACM. doi:10.1145/1810479.1810495

DOI
10.1145/1810479.1810495
Conference Paper

Session details: Computing despite an adversary

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/3254392

DOI
10.1145/3254392
Conference Paper

Session details: Graph algorithms

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/3254402

DOI
10.1145/3254402
Conference Paper

Game authority for robust and scalable distributed selfish-computer systems

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.014

DOI
10.1016/j.tcs.2010.02.014
Journal article

Trust in Global Computing Systems as a Limit Property Emerging from Short Range Random Interactions

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/8679

DOI
10.5772/8679
Chapter

The "Hot Potato" Case: Challenges in Multiplayer Pervasive Games Based on Ad hoc Mobile Sensor Networks and the Experimental Evaluation of a Prototype Game

DOI
10.48550/arxiv.1002.1099
Preprint

On the Fairness of Probabilistic Schedulers for Population Protocols

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.

Conference Paper

2009

Not All Fair Probabilistic Schedulers Are Equivalent

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/

Conference Paper

The Impact of Social Ignorance on Weighted Congestion Games

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_29

DOI
10.1007/978-3-642-10841-9_29
Chapter

Combinatorial properties for efficient communication in distributed networks with local interactions

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 &amp; Distributed Processing Vol. 8 (pp. 1-11). IEEE. doi:10.1109/ipdps.2009.5161002

DOI
10.1109/ipdps.2009.5161002
Conference Paper

Computational Game Theory

Spirakis, P., & Panagopoulou, P. (2009). Computational Game Theory. In Chapman &amp; Hall/CRC Applied Algorithms and Data Structures series (pp. 1-27). Chapman and Hall/CRC. doi:10.1201/9781584888215-c21

DOI
10.1201/9781584888215-c21
Chapter

Computational game theory: An introduction

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).

Chapter

Expander properties and the cover time of random intersection graphs

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.028

DOI
10.1016/j.tcs.2009.08.028
Journal article

Efficient Methods for Selfish Network Design

Fotakis, D., Kaporis, A. C., & Spirakis, P. G. (2009). Efficient Methods for Selfish Network Design. In Lecture Notes in Computer Science (pp. 459-471). Springer Berlin Heidelberg. doi:10.1007/978-3-642-02930-1_38

DOI
10.1007/978-3-642-02930-1_38
Chapter

Mediated Population Protocols

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/

Conference Paper

On the Performance of Approximate Equilibria in Congestion Games

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_22

DOI
10.1007/978-3-642-04128-0_22
Conference Paper

Developing multiplayer pervasive games and networked interactive installations using ad hoc mobile sensor nets

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 (pp. 174-181). ACM. doi:10.1145/1690388.1690418

DOI
10.1145/1690388.1690418
Conference Paper

Multiplayer pervasive games and networked interactive installations using ad hoc mobile sensor networks

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 (pp. 453). ACM. doi:10.1145/1690388.1690500

DOI
10.1145/1690388.1690500
Conference Paper

Colouring Non-sparse Random Intersection Graphs

Nikoletseas, S., Raptopoulos, C., & Spirakis, P. G. (2009). Colouring Non-sparse Random Intersection Graphs. In Lecture Notes in Computer Science (pp. 600-611). Springer Berlin Heidelberg. doi:10.1007/978-3-642-03816-7_51

DOI
10.1007/978-3-642-03816-7_51
Chapter

Recent Advances in Population Protocols

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/

Conference Paper

The structure and complexity of Nash equilibria for a selfish routing game

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.004

DOI
10.1016/j.tcs.2008.01.004
Journal article

A glimpse at Christos H. Papadimitriou

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.001

DOI
10.1016/j.cosrev.2009.04.001
Journal article

A note on proofs of existence of Nash equilibria in finite strategic games, of two players

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.002

DOI
10.1016/j.cosrev.2009.03.002
Journal article

Polynomial algorithms for approximating Nash equilibria of bimatrix games

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.033

DOI
10.1016/j.tcs.2008.12.033
Journal article

Preface

Spirakis, P. G., Mavronicolas, M., & Kontogiannis, S. C. (2009). Preface. Theoretical Computer Science, 410(17), 1551. doi:10.1016/j.tcs.2008.12.026

DOI
10.1016/j.tcs.2008.12.026
Journal article

On the support size of stable strategies in random games

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.056

DOI
10.1016/j.tcs.2008.12.056
Journal article

Probabilistic Distributed Algorithms for Energy Efficient Routing and Tracking in Wireless Sensor Networks

Nikoletseas, S., & Spirakis, P. G. (n.d.). Probabilistic Distributed Algorithms for Energy Efficient Routing and Tracking in Wireless Sensor Networks. Algorithms, 2(1), 121-157. doi:10.3390/a2010121

DOI
10.3390/a2010121
Journal article

The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions

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.002

DOI
10.1016/j.tcs.2008.11.002
Journal article

Computing on a partially eponymous ring

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.010

DOI
10.1016/j.tcs.2008.10.010
Journal article

Spirakis, P. G. (2009). . Computer Science Review, 3(1), 41-46. doi:10.1016/j.cosrev.2008.11.001

DOI
10.1016/j.cosrev.2008.11.001
Journal article

Brief Announcement: Decidable Graph Languages by Mediated Population Protocols

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_24

DOI
10.1007/978-3-642-04355-0_24
Chapter

Preface to special issue on cooperation in selfish systems

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-y

DOI
10.1007/s10588-008-9054-y
Journal article

The survival of the weakest in networks

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-2

DOI
10.1007/s10588-008-9050-2
Journal article

2008

Adaptive probabilistic secure routing in mobile wireless sensor networks

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 (pp. 208-212). IEEE. doi:10.1109/softcom.2008.4669481

DOI
10.1109/softcom.2008.4669481
Conference Paper

Brief announcement: Scheduling tasks with dependencies on asymmetric multiprocessors

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).

Conference Paper

A Game Theoretic Approach for Efficient Graph Coloring

Panagopoulou, P. N., & Spirakis, P. G. (2008). A Game Theoretic Approach for Efficient Graph Coloring. In Lecture Notes in Computer Science (pp. 183-195). Springer Berlin Heidelberg. doi:10.1007/978-3-540-92182-0_19

DOI
10.1007/978-3-540-92182-0_19
Chapter

A step-wise refinement approach for enhancing e-voting acceptance

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 (pp. 275-280). ACM. doi:10.1145/1509096.1509153

DOI
10.1145/1509096.1509153
Conference Paper

A trusted architectural model for interconnecting testbeds of wireless sensor networks

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).

Conference Paper

Equilibrium Points in Fear of Correlated Threats

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_28

DOI
10.1007/978-3-540-92185-1_28
Chapter

Performance Evaluation of a Descent Algorithm for Bi-matrix Games

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_29

DOI
10.1007/978-3-540-92185-1_29
Chapter

The Dynamics of Adaptive Networked Societies of Tiny Artefacts

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 Vol. 4167 (pp. 67-72). IEEE. doi:10.1109/sasow.2008.45

DOI
10.1109/sasow.2008.45
Conference Paper

A Security Model for Internet-Based Digital Asset Management Systems

Chatzigiannakis, I., Liagkou, V., Salouros, D., & Spirakis, P. (2008). A Security Model for Internet-Based Digital Asset Management Systems. In Lecture Notes in Computer Science (pp. 326-329). Springer Berlin Heidelberg. doi:10.1007/978-3-540-88030-1_29

DOI
10.1007/978-3-540-88030-1_29
Chapter

Large independent sets in general random intersection graphs

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.047

DOI
10.1016/j.tcs.2008.06.047
Journal article

Cost Sharing Mechanisms for Fair Pricing of Resource Usage

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-4

DOI
10.1007/s00453-007-9108-4
Journal article

Efficient Sensor Network Design for Continuous Monitoring of Moving Objects

Nikoletseas, S., & Spirakis, P. G. (n.d.). Efficient Sensor Network Design for Continuous Monitoring of Moving Objects. In Lecture Notes in Computer Science (pp. 18-31). Springer Berlin Heidelberg. doi:10.1007/978-3-540-77871-4_4

DOI
10.1007/978-3-540-77871-4_4
Chapter

Full and Local Information in Distributed Decision Making

Panagopoulou, P. N., & Spirakis, P. G. (n.d.). Full and Local Information in Distributed Decision Making. In Lecture Notes in Computer Science (pp. 156-169). Springer Berlin Heidelberg. doi:10.1007/978-3-540-77918-6_13

DOI
10.1007/978-3-540-77918-6_13
Chapter

Optimal Algorithms for Detecting Network Stability

Koukopoulos, D., Nikolopoulos, S. D., Palios, L., & Spirakis, P. G. (n.d.). Optimal Algorithms for Detecting Network Stability. In Lecture Notes in Computer Science (pp. 188-199). Springer Berlin Heidelberg. doi:10.1007/978-3-540-77891-2_18

DOI
10.1007/978-3-540-77891-2_18
Chapter

Scheduling tasks with dependencies on asymmetric multiprocessors

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 (pp. 454). ACM. doi:10.1145/1400751.1400851

DOI
10.1145/1400751.1400851
Conference Paper

Atomic congestion games among coalitions

Fotakis, D., Kontogiannis, S., & Spirakis, P. (2008). Atomic congestion games among coalitions. ACM Transactions on Algorithms, 4(4), 1-27. doi:10.1145/1383369.1383383

DOI
10.1145/1383369.1383383
Journal article

Efficient sensor network design for continuous monitoring of moving objects

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.005

DOI
10.1016/j.tcs.2008.03.005
Journal article

A Network Game with Attackers and a Defender

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-3

DOI
10.1007/s00453-007-9109-3
Journal article

Myopic Distributed Protocols for Singleton and Independent-Resource Congestion Games

Kalles, D., Kaporis, A. C., & Spirakis, P. G. (n.d.). Myopic Distributed Protocols for Singleton and Independent-Resource Congestion Games. In Lecture Notes in Computer Science (pp. 181-193). Springer Berlin Heidelberg. doi:10.1007/978-3-540-68552-4_14

DOI
10.1007/978-3-540-68552-4_14
Chapter

A probabilistic key agreement scheme for sensor networks without key predistribution

DOI
10.48550/arxiv.0806.1812
Preprint

Approximate Equilibria for Strategic Two Person Games

Spirakis, P. G. (2008). Approximate Equilibria for Strategic Two Person Games. In Lecture Notes in Computer Science (pp. 5-21). Springer Berlin Heidelberg. doi:10.1007/978-3-540-79309-0_3

DOI
10.1007/978-3-540-79309-0_3
Chapter

Atomic Congestion Games: Fast, Myopic and Concurrent

Fotakis, D., Kaporis, A. C., & Spirakis, P. G. (2008). Atomic Congestion Games: Fast, Myopic and Concurrent. In Lecture Notes in Computer Science (pp. 121-132). Springer Berlin Heidelberg. doi:10.1007/978-3-540-79309-0_12

DOI
10.1007/978-3-540-79309-0_12
Chapter

Energy and Time Efficient Scheduling of Tasks with Dependencies on Asymmetric Multiprocessors

DOI
10.48550/arxiv.0804.4039
Preprint

Random sampling of colourings of sparse random graphs with a constant number of colours

DOI
10.48550/arxiv.0804.2343
Preprint

Algorithmic Game Theory and Applications

Mavronicolas, M., Papadopoulou, V., & Spirakis, P. (2008). Algorithmic Game Theory and Applications. In Unknown Book (pp. 287-315). Wiley. doi:10.1002/9780470175668.ch10

DOI
10.1002/9780470175668.ch10
Chapter

A graph-theoretic network security game

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.021488

DOI
10.1504/ijaacs.2008.021488
Journal article

An Optimization Approach for Approximate Nash Equilibria

Tsaknakis, H., & Spirakis, P. G. (2008). An Optimization Approach for Approximate Nash Equilibria. Internet Mathematics, 5(4), 365-382. doi:10.1080/15427951.2008.10129172

DOI
10.1080/15427951.2008.10129172
Journal article

Approximations of Bimatrix Nash Equilibria

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_30

DOI
10.1007/978-0-387-30162-4_30
Chapter

Best Response Algorithms for Selfish Routing

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_46

DOI
10.1007/978-0-387-30162-4_46
Chapter

Cost-Balancing Tolls for Atomic Network Congestion Games

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.10129175

DOI
10.1080/15427951.2008.10129175
Journal article

Hamilton Cycles in Random Intersection Graphs

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_176

DOI
10.1007/978-0-387-30162-4_176
Chapter

Independent Sets in Random Intersection Graphs

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_187

DOI
10.1007/978-0-387-30162-4_187
Chapter

Minimum Congestion Redundant Assignments

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_232

DOI
10.1007/978-0-387-30162-4_232
Chapter

Preface

Spirakis, P. G. (2008). Preface. Theory of Computing Systems, 42(1), 1. doi:10.1007/s00224-007-9012-y

DOI
10.1007/s00224-007-9012-y
Journal article

Selfish Unsplittable Flows: Algorithms for Pure Equilibria

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_360

DOI
10.1007/978-0-387-30162-4_360
Chapter

Stackelberg Games: The Price of Optimum

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_398

DOI
10.1007/978-0-387-30162-4_398
Chapter

Strategies for repeated games with subsystem takeovers: implementable by deterministic and self-stabilizing automata (extended abstract)

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.4626

DOI
10.4108/icst.autonomics2008.4626
Conference Paper

Tail Bounds for Occupancy Problems

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_419

DOI
10.1007/978-0-387-30162-4_419
Chapter

The Dynamics of Probabilistic Population Protocols

Chatzigiannakis, I., & Spirakis, P. G. (2008). 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_35

DOI
10.1007/978-3-540-87779-0_35
Chapter

Weighted Random Sampling

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_478

DOI
10.1007/978-0-387-30162-4_478
Chapter

2007

Atomic Selfish Routing in Networks

Kontogiannis, S., & Spirakis, P. (2007). Atomic Selfish Routing in Networks. In Chapman &amp; Hall/CRC Computer &amp; Information Science Series. Chapman and Hall/CRC. doi:10.1201/9781420011296.ch20

DOI
10.1201/9781420011296.ch20
Chapter

Agent-based Distributed Group Key Establishment in Wireless Sensor Networks

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 Vol. 18 (pp. 1-6). IEEE. doi:10.1109/wowmom.2007.4351807

DOI
10.1109/wowmom.2007.4351807
Conference Paper

Trust in global computing systems as a limit property emerging from short range random interactions

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) (pp. 741-748). IEEE. doi:10.1109/ares.2007.154

DOI
10.1109/ares.2007.154
Conference Paper

The increase of the instability of networks due to Quasi-Static link capacities

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.008

DOI
10.1016/j.tcs.2007.04.008
Journal article

Game authority for robust andscalable distributed selfish-computer systems

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 (pp. 356-357). ACM. doi:10.1145/1281100.1281171

DOI
10.1145/1281100.1281171
Conference Paper

The Price of Selfish Routing

Mavronicolas, M., & Spirakis, P. (2007). The Price of Selfish Routing. Algorithmica, 48(1), 91-126. doi:10.1007/s00453-006-0056-1

DOI
10.1007/s00453-006-0056-1
Journal article

Randomized Approximation Techniques

Spirakis, P., & Nikoletseas, S. (2007). Randomized Approximation Techniques. In Chapman &amp; Hall/CRC Computer &amp; Information Science Series. Chapman and Hall/CRC. doi:10.1201/9781420010749.ch12

DOI
10.1201/9781420010749.ch12
Chapter

Design, Analysis and Performance Evaluation of Group Key Establishment in Wireless Sensor Networks

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.007

DOI
10.1016/j.entcs.2006.11.007
Journal article

Performance and stability bounds for dynamic networks

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.005

DOI
10.1016/j.jpdc.2006.11.005
Journal article

Algorithms for pure Nash equilibria in weighted congestion games

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.1216584

DOI
10.1145/1187436.1216584
Journal article

A Trust-Centered Approach for Building E-Voting Systems

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_31

DOI
10.1007/978-3-540-74444-3_31
Chapter

An Optimization Approach for Approximate Nash Equilibria

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_8

DOI
10.1007/978-3-540-77105-0_8
Chapter

Cost-Balancing Tolls for Atomic Network Congestion Games

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_19

DOI
10.1007/978-3-540-77105-0_19
Chapter

Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games

Kontogiannis, S. C., & Spirakis, P. G. (n.d.). Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games. In Lecture Notes in Computer Science (pp. 595-606). Springer Berlin Heidelberg. doi:10.1007/978-3-540-73420-8_52

DOI
10.1007/978-3-540-73420-8_52
Chapter

Expander Properties and the Cover Time of Random Intersection Graphs

Nikoletseas, S. E., Raptopoulos, C., & Spirakis, P. G. (n.d.). Expander Properties and the Cover Time of Random Intersection Graphs. In Lecture Notes in Computer Science (pp. 44-55). Springer Berlin Heidelberg. doi:10.1007/978-3-540-74456-6_6

DOI
10.1007/978-3-540-74456-6_6
Chapter

Handbook of Approximation Algorithms and Metaheuristics

Gonzalez, T. F. (Ed.) (n.d.). Handbook of Approximation Algorithms and Metaheuristics. In . Chapman and Hall/CRC. doi:10.1201/9781420010749

DOI
10.1201/9781420010749
Chapter

Handbook of Parallel Computing

Rajasekaran, S., & Reif, J. (Eds.) (n.d.). Handbook of Parallel Computing. In . Chapman and Hall/CRC. doi:10.1201/9781420011296

DOI
10.1201/9781420011296
Chapter

On the Support Size of Stable Strategies in Random Games

Kontogiannis, S. C., & Spirakis, P. G. (n.d.). On the Support Size of Stable Strategies in Random Games. In Lecture Notes in Computer Science (pp. 154-165). Springer Berlin Heidelberg. doi:10.1007/978-3-540-74871-7_14

DOI
10.1007/978-3-540-74871-7_14
Chapter

Probabilistic Techniques in Algorithmic Game Theory

Kontogiannis, S. C., & Spirakis, P. G. (n.d.). Probabilistic Techniques in Algorithmic Game Theory. In Lecture Notes in Computer Science (pp. 30-53). Springer Berlin Heidelberg. doi:10.1007/978-3-540-74871-7_4

DOI
10.1007/978-3-540-74871-7_4
Chapter

Selfish Load Balancing Under Partial Knowledge

Koutsoupias, E., Panagopoulou, P. N., & Spirakis, P. G. (n.d.). Selfish Load Balancing Under Partial Knowledge. In Lecture Notes in Computer Science (pp. 609-620). Springer Berlin Heidelberg. doi:10.1007/978-3-540-74456-6_54

DOI
10.1007/978-3-540-74456-6_54
Chapter

The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs

Nikoletseas, S., Raptopoulos, C., & Spirakis, P. G. (n.d.). The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs. In Lecture Notes in Computer Science (pp. 236-246). Springer Berlin Heidelberg. doi:10.1007/978-3-540-75414-5_15

DOI
10.1007/978-3-540-75414-5_15
Chapter

The Survival of the Weakest in Networks

Nikoletseas, S., Raptopoulos, C., & Spirakis, P. (2007). The Survival of the Weakest in Networks. In Lecture Notes in Computer Science (pp. 316-329). Springer Berlin Heidelberg. doi:10.1007/11970125_25

DOI
10.1007/11970125_25
Chapter

Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach

Kontogiannis, S. C., & Spirakis, P. G. (n.d.). Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach. In Lecture Notes in Computer Science (pp. 596-608). Springer Berlin Heidelberg. doi:10.1007/978-3-540-74456-6_53

DOI
10.1007/978-3-540-74456-6_53
Chapter

2006

Internet and network economics: Preface

Spirakis, P., Mavronicolas, M., & Kontogiannis, S. (2006). Internet and network economics: Preface (Vol. 4286 LNCS).

Book

Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games

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_26

DOI
10.1007/11944874_26
Chapter

The Price of Defense and Fractional Matchings

Mavronicolas, M., Papadopoulou, V., Persiano, G., Philippou, A., & Spirakis, P. (2006). The Price of Defense and Fractional Matchings. In Lecture Notes in Computer Science (pp. 115-126). Springer Berlin Heidelberg. doi:10.1007/11947950_13

DOI
10.1007/11947950_13
Chapter

The Threshold Behaviour of the Fixed Radius Random Graph Model and Applications to the Key Management Problem of Sensor Networks

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 Lecture Notes in Computer Science (pp. 130-139). Springer Berlin Heidelberg. doi:10.1007/11963271_12

DOI
10.1007/11963271_12
Chapter

The infection time of graphs

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.026

DOI
10.1016/j.dam.2006.04.026
Journal article

A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks

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.006

DOI
10.1016/j.adhoc.2005.06.006
Journal article

Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies

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.007

DOI
10.1016/j.jda.2005.12.007
Journal article

Approximation schemes for scheduling and covering on unrelated machines

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.025

DOI
10.1016/j.tcs.2006.05.025
Journal article

The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions

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 Vol. 1563 (pp. 19-28). ACM. doi:10.1145/1148109.1148113

DOI
10.1145/1148109.1148113
Conference Paper

Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost

Fotakis, D., Kontogiannis, S., & Spirakis, P. (2006). Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost. In Lecture Notes in Computer Science (pp. 161-175). Springer Berlin Heidelberg. doi:10.1007/11671411_13

DOI
10.1007/11671411_13
Chapter

Keynote Talk Summary: Algorithmic Aspects of Sensor Networks

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_23

DOI
10.1007/11687818_23
Chapter

Direct routing: Algorithms and complexity

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-3

DOI
10.1007/s00453-005-1189-3
Journal article

INTRODUCTION

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.006

DOI
10.1016/j.jpdc.2005.06.006
Journal article

Weighted random sampling with a reservoir

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.003

DOI
10.1016/j.ipl.2005.11.003
Journal article

A Cost Mechanism for Fair Pricing of Resource Usage

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_21

DOI
10.1007/11600930_21
Chapter

Atomic Congestion Games Among Coalitions

Fotakis, D., Kontogiannis, S., & Spirakis, P. (2006). Atomic Congestion Games Among Coalitions. In Lecture Notes in Computer Science (pp. 572-583). Springer Berlin Heidelberg. doi:10.1007/11786986_50

DOI
10.1007/11786986_50
Chapter

Computing on a Partially Eponymous Ring

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_27

DOI
10.1007/11945529_27
Chapter

The Power of the Defender

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) (pp. 37). IEEE. doi:10.1109/icdcsw.2006.107

DOI
10.1109/icdcsw.2006.107
Conference Paper

The Price of Defense

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_62

DOI
10.1007/11821069_62
Chapter

2005

The chromatic and clique numbers of random scaled sector graphs

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.050

DOI
10.1016/j.tcs.2005.09.050
Journal article

Selfish unsplittable flows

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.024

DOI
10.1016/j.tcs.2005.09.024
Journal article

A Graph-Theoretic Network Security Game

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_98

DOI
10.1007/11600930_98
Chapter

A cost mechanism for fair pricing of resource usage

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_21

DOI
10.1007/11600930_21
Conference Paper

Annual ACM Symposium on Parallelism in Algorithms and Architectures: Preface

Spirakis, P. (2005). Annual ACM Symposium on Parallelism in Algorithms and Architectures: Preface. In Annual ACM Symposium on Parallelism in Algorithms and Architectures.

Conference Paper

Atomic Selfish Routing in Networks: A Survey

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_100

DOI
10.1007/11600930_100
Chapter

Counting Stable Strategies in Random Evolutionary Games

Kontogiannis, S., & Spirakis, P. (2005). Counting Stable Strategies in Random Evolutionary Games. In Lecture Notes in Computer Science (pp. 839-848). Springer Berlin Heidelberg. doi:10.1007/11602613_84

DOI
10.1007/11602613_84
Chapter

Network Game with Attacker and Protector Entities

Mavronicolas, M., Papadopoulou, V., Philippou, A., & Spirakis, P. (2005). Network Game with Attacker and Protector Entities. In Lecture Notes in Computer Science (pp. 288-297). Springer Berlin Heidelberg. doi:10.1007/11602613_30

DOI
10.1007/11602613_30
Chapter

Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection Graphs

Raptopoulos, C., & Spirakis, P. (2005). Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection Graphs. In Lecture Notes in Computer Science (pp. 493-504). Springer Berlin Heidelberg. doi:10.1007/11602613_50

DOI
10.1007/11602613_50
Chapter

The Contribution of Game Theory to Complex Systems

Kontogiannis, S., & Spirakis, P. (2005). The Contribution of Game Theory to Complex Systems. In Lecture Notes in Computer Science (pp. 101-111). Springer Berlin Heidelberg. doi:10.1007/11573036_10

DOI
10.1007/11573036_10
Chapter

Distributed Algorithms for Some Fundamental Problems in Ad Hoc Mobile Environments

Nikoletseas, S., & Spirakis, P. (2005). Distributed Algorithms for Some Fundamental Problems in Ad Hoc Mobile Environments. In Chapman &amp; Hall/CRC Computer &amp; Information Science Series. Chapman and Hall/CRC. doi:10.1201/9781420035094.sec2

DOI
10.1201/9781420035094.sec2
Chapter

Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control

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/s009753970343275x

DOI
10.1137/s009753970343275x
Journal article

Structure and complexity of extreme Nash equilibria

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.011

DOI
10.1016/j.tcs.2005.05.011
Journal article

Radiocoloring in planar graphs: Complexity and approximations

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.013

DOI
10.1016/j.tcs.2005.03.013
Journal article

Session details: Joint session

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/3259550

DOI
10.1145/3259550
Conference Paper

The Impact of Network Structure on the Stability of Greedy Protocols

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-3

DOI
10.1007/s00224-004-1181-3
Journal article

MAX-MIN FAIR FLOW CONTROL SENSITIVE TO PRIORITIES

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/s0219265905001332

DOI
10.1142/s0219265905001332
Journal article

The cost of concurrent, low-contention Read&amp;Modify&amp;Write

Busch, C., Mavronicolas, M., & Spirakis, P. (2005). The cost of concurrent, low-contention Read&amp;Modify&amp;Write. Theoretical Computer Science, 333(3), 373-400. doi:10.1016/j.tcs.2004.04.018

DOI
10.1016/j.tcs.2004.04.018
Journal article

Space Efficient Hash Tables with Worst Case Constant Access Time

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-x

DOI
10.1007/s00224-004-1195-x
Journal article

Efficient Convergence to Pure Nash Equilibria in Weighted Network Congestion Games

Panagopoulou, P. N., & Spirakis, P. G. (2005). Efficient Convergence to Pure Nash Equilibria in Weighted Network Congestion Games. In Lecture Notes in Computer Science (pp. 203-215). Springer Berlin Heidelberg. doi:10.1007/11427186_19

DOI
10.1007/11427186_19
Chapter

Efficient Information Propagation Algorithms in Smart Dust and NanoPeer Networks

Nikoletseas, S., & Spirakis, P. (2005). Efficient Information Propagation Algorithms in Smart Dust and NanoPeer Networks. In Lecture Notes in Computer Science (pp. 127-145). Springer Berlin Heidelberg. doi:10.1007/978-3-540-31794-4_8

DOI
10.1007/978-3-540-31794-4_8
Chapter

Efficient and Robust Protocols for Local Detection and Propagation in Smart Dust Networks

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.f0

DOI
10.1023/b:mone.0000048551.54039.f0
Journal article

Evolutionary Games: An Algorithmic View

Kontogiannis, S., & Spirakis, P. (2005). Evolutionary Games: An Algorithmic View. In Lecture Notes in Computer Science (pp. 97-111). Springer Berlin Heidelberg. doi:10.1007/11428589_7

DOI
10.1007/11428589_7
Chapter

Experimental Results for Stackelberg Scheduling Strategies

Kaporis, A. C., Kirousis, L. M., Politopoulou, E. I., & Spirakis, P. G. (2005). Experimental Results for Stackelberg Scheduling Strategies. In Lecture Notes in Computer Science (pp. 77-88). Springer Berlin Heidelberg. doi:10.1007/11427186_9

DOI
10.1007/11427186_9
Chapter

Generating and Radiocoloring Families of Perfect Graphs

Andreou, M. I., Papadopoulou, V. G., Spirakis, P. G., Theodorides, B., & Xeros, A. (2005). Generating and Radiocoloring Families of Perfect Graphs. In Lecture Notes in Computer Science (pp. 302-314). Springer Berlin Heidelberg. doi:10.1007/11427186_27

DOI
10.1007/11427186_27
Chapter

Handbook of Algorithms for Wireless Networking and Mobile Computing

Boukerche, A. (Ed.) (n.d.). Handbook of Algorithms for Wireless Networking and Mobile Computing. In . Chapman and Hall/CRC. doi:10.1201/9781420035094

DOI
10.1201/9781420035094
Chapter

On the Existence of Hamiltonian Cycles in Random Intersection Graphs

Efthymiou, C., & Spirakis, P. G. (2005). On the Existence of Hamiltonian Cycles in Random Intersection Graphs. In Lecture Notes in Computer Science (pp. 690-701). Springer Berlin Heidelberg. doi:10.1007/11523468_56

DOI
10.1007/11523468_56
Chapter

“Trust Engineering:” From Requirements to System Design and Maintenance – A Working National Lottery System Experience

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_4

DOI
10.1007/11556992_4
Chapter

2004

A Comparative Study of Protocols for Efficient Data Propagation in Smart Dust Networks

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 Lecture Notes in Computer Science (pp. 1003-1016). Springer Berlin Heidelberg. doi:10.1007/978-3-540-45209-6_138

DOI
10.1007/978-3-540-45209-6_138
Chapter

Performance and stability bounds for dynamic networks

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. Vol. 2508 (pp. 239-246). IEEE. doi:10.1109/ispan.2004.1300487

DOI
10.1109/ispan.2004.1300487
Conference Paper

DISTRIBUTED COMMUNICATION ALGORITHMS FOR AD-HOC MOBILE NETWORKS

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_0019

DOI
10.1142/9789812562494_0019
Chapter

A hierarchical adaptive distributed algorithm for load balancing

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.002

DOI
10.1016/j.jpdc.2003.07.002
Journal article

Algorithmic and Foundational Aspects of Sensor Systems

Spirakis, P. G. (2004). Algorithmic and Foundational Aspects of Sensor Systems. In Lecture Notes in Computer Science (pp. 3-8). Springer Berlin Heidelberg. doi:10.1007/978-3-540-27820-7_2

DOI
10.1007/978-3-540-27820-7_2
Chapter

Algorithmic and foundational aspects of sensor systems (invited talk)

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_2

DOI
10.1007/978-3-540-27820-7_2
Journal article

Analysis of the Information Propagation Time Among Mobile Hosts

Dimitriou, T., Nikoletseas, S., & Spirakis, P. (2004). Analysis of the Information Propagation Time Among Mobile Hosts. In Lecture Notes in Computer Science (pp. 122-134). Springer Berlin Heidelberg. doi:10.1007/978-3-540-28634-9_10

DOI
10.1007/978-3-540-28634-9_10
Chapter

Direct Routing: Algorithms and Complexity

Busch, C., Magdon-Ismail, M., Mavronicolas, M., & Spirakis, P. (2004). Direct Routing: Algorithms and Complexity. In Lecture Notes in Computer Science (pp. 134-145). Springer Berlin Heidelberg. doi:10.1007/978-3-540-30140-0_14

DOI
10.1007/978-3-540-30140-0_14
Chapter

Electronic National Lotteries

Konstantinou, E., Liagkou, V., Spirakis, P., Stamatiou, Y. C., & Yung, M. (2004). Electronic National Lotteries. In Lecture Notes in Computer Science (pp. 147-163). Springer Berlin Heidelberg. doi:10.1007/978-3-540-27809-2_18

DOI
10.1007/978-3-540-27809-2_18
Chapter

How to Tell a Good Neighborhood from a Bad One: Satisfiability of Boolean Formulas

Dimitriou, T., & Spirakis, P. (2004). How to Tell a Good Neighborhood from a Bad One: Satisfiability of Boolean Formulas. In Lecture Notes in Computer Science (pp. 199-212). Springer Berlin Heidelberg. doi:10.1007/978-3-540-24838-5_15

DOI
10.1007/978-3-540-24838-5_15
Chapter

SPEED: Scalable Protocols for Efficient Event Delivery in Sensor Networks

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_110

DOI
10.1007/978-3-540-24693-0_110
Chapter

Selfish Unsplittable Flows

Fotakis, D., Kontogiannis, S., & Spirakis, P. (2004). Selfish Unsplittable Flows. In Lecture Notes in Computer Science (pp. 593-605). Springer Berlin Heidelberg. doi:10.1007/978-3-540-27836-8_51

DOI
10.1007/978-3-540-27836-8_51
Chapter

The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs

Nikoletseas, S., Raptopoulos, C., & Spirakis, P. (2004). The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs. In Lecture Notes in Computer Science (pp. 1029-1040). Springer Berlin Heidelberg. doi:10.1007/978-3-540-27836-8_86

DOI
10.1007/978-3-540-27836-8_86
Chapter

2003

A COMPARATIVE STUDY OF PROTOCOLS FOR EFFICIENT DATA PROPAGATION IN SMART DUST NETWORKS

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/s0129626403001550

DOI
10.1142/s0129626403001550
Journal article

Approximate Equilibria and Ball Fusion

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-5

DOI
10.1007/s00224-003-1131-5
Journal article

Attack Propagation in Networks

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-5

DOI
10.1007/s00224-003-1087-5
Journal article

Competitive video on demand schedulers for popular movies

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-0

DOI
10.1016/s0166-218x(02)00233-0
Journal article

An efficient deterministic parallel algorithm for two processors precedence constraint scheduling

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-7

DOI
10.1016/s0304-3975(01)00120-7
Journal article

Preface

Kutten, S., & Spirakis, P. (2003). Preface. Theoretical Computer Science, 291(1), 1. doi:10.1016/s0304-3975(01)00393-0

DOI
10.1016/s0304-3975(01)00393-0
Journal article

Algorithms and Experiments on Colouring Squares of Planar Graphs

Andreou, M. I., Nikoletseas, S. E., & Spirakis, P. G. (2003). Algorithms and Experiments on Colouring Squares of Planar Graphs. In Lecture Notes in Computer Science (pp. 15-32). Springer Berlin Heidelberg. doi:10.1007/3-540-44867-5_2

DOI
10.1007/3-540-44867-5_2
Chapter

Distributed communication algorithms for ad hoc mobile networks

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-5

DOI
10.1016/s0743-7315(02)00034-5
Journal article

Extreme Nash Equilibria

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_1

DOI
10.1007/978-3-540-45208-9_1
Conference Paper

Space Efficient Hash Tables with Worst Case Constant Access Time

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_25

DOI
10.1007/3-540-36494-3_25
Chapter

Stability Behavior of FIFO Protocol in the Adversarial Queuing Model

Koukopoulos, D. K., Nikoletseas, S. E., & Spirakis, P. G. (2003). Stability Behavior of FIFO Protocol in the Adversarial Queuing Model. In Lecture Notes in Computer Science (pp. 464-479). Springer Berlin Heidelberg. doi:10.1007/3-540-38076-0_30

DOI
10.1007/3-540-38076-0_30
Chapter

The Impact of Network Structure on the Stability of Greedy Protocols

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_29

DOI
10.1007/3-540-44849-7_29
Chapter

Which Is the Worst-Case Nash Equilibrium?

Lücking, T., Mavronicolas, M., Monien, B., Rode, M., Spirakis, P., & Vrto, I. (2003). Which Is the Worst-Case Nash Equilibrium?. In Lecture Notes in Computer Science (pp. 551-561). Springer Berlin Heidelberg. doi:10.1007/978-3-540-45138-9_49

DOI
10.1007/978-3-540-45138-9_49
Chapter

2002

Competitive Call Control in Mobile Networks

Pantziou., Pentaris., & Spirakis. (2002). Competitive Call Control in Mobile Networks. Theory of Computing Systems, 35(6), 625-639. doi:10.1007/s00224-002-1032-z

DOI
10.1007/s00224-002-1032-z
Journal article

Smart dust protocols for local detection and propagation

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 (pp. 9-16). ACM. doi:10.1145/584490.584493

DOI
10.1145/584490.584493
Conference Paper

On the robustness of interconnections in random graphs: a symbolic approach

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-6

DOI
10.1016/s0304-3975(01)00259-6
Journal article

Session details: Session 2B

Spirakis, P. (2002). Session details: Session 2B. In Proceedings of the thiry-fourth annual ACM symposium on Theory of computing. ACM. doi:10.1145/3247661

DOI
10.1145/3247661
Conference Paper

Session details: Session 4B

Spirakis, P. (2002). Session details: Session 4B. In Proceedings of the thiry-fourth annual ACM symposium on Theory of computing. ACM. doi:10.1145/3247665

DOI
10.1145/3247665
Conference Paper

Assignment of Reusable and Non-Reusable Frequencies

Fotakis, D. A., & Spirakis, P. G. (2002). Assignment of Reusable and Non-Reusable Frequencies. In Series on Applied Mathematics (pp. 75-95). WORLD SCIENTIFIC. doi:10.1142/9789812778215_0006

DOI
10.1142/9789812778215_0006
Chapter

Bouras, C., Lampsas, P., & Spirakis, P. (2002). Unknown Title. Multimedia Tools and Applications, 16(3), 251-276. doi:10.1023/a:1013964221404

DOI
10.1023/a:1013964221404
Journal article

Distributed Algorithm Engineering

Spirakis, P. G., & Zaroliagis, C. D. (2002). Distributed Algorithm Engineering. In Lecture Notes in Computer Science (pp. 197-228). Springer Berlin Heidelberg. doi:10.1007/3-540-36383-1_10

DOI
10.1007/3-540-36383-1_10
Chapter

Minimum Congestion Redundant Assignments to Tolerate Random Faults

Fotakis., & Spirakis. (2002). Minimum Congestion Redundant Assignments to Tolerate Random Faults. Algorithmica, 32(3), 396-422. doi:10.1007/s00453-001-0080-0

DOI
10.1007/s00453-001-0080-0
Journal article

Mobile Computing, Mobile Networks

auf der Heide, F. M., Kumar, M., Nikoletseas, S., & Spirakis, P. (2002). Mobile Computing, Mobile Networks. In Lecture Notes in Computer Science (pp. 933-934). Springer Berlin Heidelberg. doi:10.1007/3-540-45706-2_133

DOI
10.1007/3-540-45706-2_133
Chapter

On Radiocoloring Hierarchically Specified Planar Graphs: $$ \mathcal{P}\mathcal{S}\mathcal{P}\mathcal{A}\mathcal{C}\mathcal{E} $$ -Completeness and Approximations

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_6

DOI
10.1007/3-540-45687-2_6
Chapter

On radiocoloring hierarchically specified planar graphs: PSPACE-completeness and approximations

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_6

DOI
10.1007/3-540-45687-2_6
Conference Paper

On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols

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_6

DOI
10.1007/3-540-36108-1_6
Chapter

Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies

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 Lecture Notes in Computer Science (pp. 223-234). Springer Berlin Heidelberg. doi:10.1007/3-540-36379-3_20

DOI
10.1007/3-540-36379-3_20
Chapter

The Structure and Complexity of Nash Equilibria for a Selfish Routing Game

Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., & Spirakis, P. (2002). The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. In Lecture Notes in Computer Science (pp. 123-134). Springer Berlin Heidelberg. doi:10.1007/3-540-45465-9_12

DOI
10.1007/3-540-45465-9_12
Chapter

2001

An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks

Chatzigiannakis, I., Nikoletseas, S., Paspallis, N., Spirakis, P., & Zaroliagis, C. (2001). An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks. In Lecture Notes in Computer Science (pp. 159-171). Springer Berlin Heidelberg. doi:10.1007/3-540-44688-5_13

DOI
10.1007/3-540-44688-5_13
Chapter

Preface

Orejas, F., Spirakis, P. G., & Van Leeuwen, J. (2001). Preface (Vol. 2076 LNCS).

Book

An efficient communication strategy for ad-hoc mobile networks

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 (pp. 320-322). ACM. doi:10.1145/383962.384053

DOI
10.1145/383962.384053
Conference Paper

The price of selfish routing

Mavronicolas, M., & Spirakis, P. (2001). The price of selfish routing. In Proceedings of the thirty-third annual ACM symposium on Theory of computing Vol. 40 (pp. 510-519). ACM. doi:10.1145/380752.380846

DOI
10.1145/380752.380846
Conference Paper

Attack propagation in networks

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 (pp. 67-76). ACM. doi:10.1145/378580.378591

DOI
10.1145/378580.378591
Conference Paper

Stability and non-stability of the FIFO protocol

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 (pp. 48-52). ACM. doi:10.1145/378580.378588

DOI
10.1145/378580.378588
Conference Paper

An Efficient Communication Strategy for Ad-hoc Mobile Networks

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_20

DOI
10.1007/3-540-45414-4_20
Chapter

Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks

Chatzigiannakis, I., Nikoletseas, S., & Spirakis, P. (2001). Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks. In Lecture Notes in Computer Science (pp. 99-110). Springer Berlin Heidelberg. doi:10.1007/3-540-44691-5_9

DOI
10.1007/3-540-44691-5_9
Chapter

Brief announcement: An efficient communication strategy for Ad-hoc mobile networks

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).

Conference Paper

Combinatorial Randomized Rounding: Boosting Randomized Rounding with Combinatorial Arguments

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_2

DOI
10.1007/978-1-4757-6594-6_2
Chapter

Hardness results and efficient approximations for frequency assignment problems: Radio labelling and radio coloring

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.

Journal article

Randomized Techniques for Modelling Faults and Achieving Robust Computing

Nikoletseas, S. E., & Spirakis, P. G. (2001). Randomized Techniques for Modelling Faults and Achieving Robust Computing. In Combinatorial Optimization (pp. 313-399). Springer US. doi:10.1007/978-1-4615-0013-1_10

DOI
10.1007/978-1-4615-0013-1_10
Chapter

Stability Issues in Heterogeneous and FIFO Networks under the Adversarial Queueing Model

Koukopoulos, D. K., Nikoletseas, S. E., & Spirakis, P. G. (2001). Stability Issues in Heterogeneous and FIFO Networks under the Adversarial Queueing Model. In Lecture Notes in Computer Science (pp. 3-14). Springer Berlin Heidelberg. doi:10.1007/3-540-45307-5_1

DOI
10.1007/3-540-45307-5_1
Chapter

The Lagrangian Search Method

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_15

DOI
10.1007/978-1-4613-0279-7_15
Chapter

2000

CONNECTIVITY PROPERTIES IN RANDOM REGULAR GRAPHS WITH EDGE FAULTS

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/s0129054100000156

DOI
10.1142/s0129054100000156
Journal article

Efficient Scheduling of Strict Multithreaded Computations

Fatourou, P. (2000). Efficient Scheduling of Strict Multithreaded Computations. Theory of Computing Systems, 33(3), 173-232. doi:10.1007/s002240010002

DOI
10.1007/s002240010002
Journal article

Machine Partitioning and Scheduling under Fault-Tolerance Constraints

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_14

DOI
10.1007/978-1-4757-3145-3_14
Chapter

NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs

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_32

DOI
10.1007/3-540-44612-5_32
Chapter

Positive Linear Programming Extensions: Parallel Complexity and Applications

Efraimidis, P. S., & Spirakis, P. G. (2000). Positive Linear Programming Extensions: Parallel Complexity and Applications. In Lecture Notes in Computer Science (pp. 456-460). Springer Berlin Heidelberg. doi:10.1007/3-540-44520-x_60

DOI
10.1007/3-540-44520-x_60
Chapter

Robust Parallel Computations through Randomization

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/s002240010009

DOI
10.1007/s002240010009
Journal article

Trade-Offs between Density and Robustness in Random Interconnection Graphs

Flajolet, P., Hatzis, K., Nikoletseas, S., & Spirakis, P. (2000). Trade-Offs between Density and Robustness in Random Interconnection Graphs. In Lecture Notes in Computer Science (pp. 152-168). Springer Berlin Heidelberg. doi:10.1007/3-540-44929-9_13

DOI
10.1007/3-540-44929-9_13
Chapter

1999

Optimal High-Performance Parallel Text Retrieval via Fat-Trees

Mamalis, B. (1999). Optimal High-Performance Parallel Text Retrieval via Fat-Trees. Theory of Computing Systems, 32(6), 591-623. doi:10.1007/s002240000133

DOI
10.1007/s002240000133
Journal article

Optimal, distributed decision-making

Mavronicolas, M., & Spirakis, P. (1999). Optimal, distributed decision-making. In Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing (pp. 279). ACM. doi:10.1145/301308.301387

DOI
10.1145/301308.301387
Conference Paper

A New Scheduling Algorithm for General Strict Multithreaded Computations

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_21

DOI
10.1007/3-540-48169-9_21
Chapter

BSP versus LogP

Bilardi, G., Pietracaprina, A., Pucci, G., Herley, K. T., & Spirakis, P. (1999). BSP versus LogP. Algorithmica, 24(3-4), 405-422. doi:10.1007/pl00008270

DOI
10.1007/pl00008270
Journal article

Counting in Mobile Networks: Theory and Experimentation

Hatzis, K., Pentaris, G., Spirakis, P., & Tampakas, B. (1999). Counting in Mobile Networks: Theory and Experimentation. In Lecture Notes in Computer Science (pp. 95-109). Springer Berlin Heidelberg. doi:10.1007/3-540-48318-7_10

DOI
10.1007/3-540-48318-7_10
Chapter

Efficient Redundant Assignments under Fault-Tolerance Constraints

Fotakis, D. A., & Spirakis, P. G. (1999). Efficient Redundant Assignments under Fault-Tolerance Constraints. In Lecture Notes in Computer Science (pp. 156-167). Springer Berlin Heidelberg. doi:10.1007/978-3-540-48413-4_17

DOI
10.1007/978-3-540-48413-4_17
Chapter

Fundamental control algorithms in mobile networks

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 Vol. 8 (pp. 251-260). ACM. doi:10.1145/305619.305649

DOI
10.1145/305619.305649
Conference Paper

Fundamental distributed protocols in mobile networks

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 (pp. 274). ACM. doi:10.1145/301308.301379

DOI
10.1145/301308.301379
Conference Paper

Implementation and Experimental Evaluation of Graph Connectivity Algorithms Using LEDA

Fatourou, P., Spirakis, P., Zarafidis, P., & Zoura, A. (1999). Implementation and Experimental Evaluation of Graph Connectivity Algorithms Using LEDA. In Lecture Notes in Computer Science (pp. 124-138). Springer Berlin Heidelberg. doi:10.1007/3-540-48318-7_12

DOI
10.1007/3-540-48318-7_12
Chapter

Optimal, distributed decision-making: The case of no communication

Georgiades, S., Mavronicolas, M., & Spirakis, P. (1999). Optimal, distributed decision-making: The case of no communication. In Lecture Notes in Computer Science (pp. 293-303). Springer Berlin Heidelberg. doi:10.1007/3-540-48321-7_24

DOI
10.1007/3-540-48321-7_24
Chapter

Parallel Processing of Multiple Text Queries on Hypercube Interconnection Networks⋆

Mamalis, B., Spirakis, P., & Tampakas, B. (1999). Parallel Processing of Multiple Text Queries on Hypercube Interconnection Networks⋆. In Lecture Notes in Computer Science (pp. 482-486). Springer Berlin Heidelberg. doi:10.1007/3-540-48311-x_65

DOI
10.1007/3-540-48311-x_65
Chapter

1998

A Hamiltonian Approach to the Assignment of Non-reusable Frequencies

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_3

DOI
10.1007/978-3-540-49382-2_3
Chapter

An analytical performance model for multistage interconnection networks with finite, infinite and zero length buffers

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-2

DOI
10.1016/s0166-5316(98)00035-2
Journal article

Preface

Spirakis, P. (1998). Preface. Theoretical Computer Science, 203(2), iii. doi:10.1016/s0304-3975(98)80022-4

DOI
10.1016/s0304-3975(98)80022-4
Journal article

On the random generation and counting of matchings in dense graphs

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-1

DOI
10.1016/s0304-3975(97)00297-1
Journal article

A competitive symmetrical transfer policy for load sharing

Antonis, K., Garofalakis, J., & Spirakis, P. (1998). A competitive symmetrical transfer policy for load sharing. In Lecture Notes in Computer Science (pp. 352-355). Springer Berlin Heidelberg. doi:10.1007/bfb0057873

DOI
10.1007/bfb0057873
Chapter

MRP II-based Production Management Using Intelligent Decision Making

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_15

DOI
10.1007/978-3-662-03742-3_15
Chapter

The global efficiency of distributed, rate-based, flow control algorithms

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 (pp. 311). ACM Press. doi:10.1145/277697.277763

DOI
10.1145/277697.277763
Conference Paper

“Dynamic-fault-prone BSP”

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 (pp. 37-46). ACM Press. doi:10.1145/277651.277666

DOI
10.1145/277651.277666
Conference Paper

1997

Parallel algorithms for the minimum cut and the minimum length tree layout problems

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-5

DOI
10.1016/s0304-3975(96)00274-5
Journal article

Paradigms for Fast Parallel Approximability

Díaz, J., Serna, M., Spirakis, P., & Torán, J. (1997). Paradigms for Fast Parallel Approximability. Cambridge University Press. doi:10.1017/cbo9780511666407

DOI
10.1017/cbo9780511666407
Book

Editor’s foreword

Spirakis, P. (1997). Editor’s foreword. Theory of Computing Systems, 30(1), 1. doi:10.1007/bf02679450

DOI
10.1007/bf02679450
Journal article

A general performance model for multistage interconnection networks

Bouras, C. J., Garofalakis, J. D., Spirakis, P. G., & Triantafillou, V. D. (1997). A general performance model for multistage interconnection networks. In Lecture Notes in Computer Science (pp. 993-1000). Springer Berlin Heidelberg. doi:10.1007/bfb0002843

DOI
10.1007/bfb0002843
Chapter

Competitive call control in mobile networks

Pantziou, G. E., Pentaris, G. P., & Spirakis, P. G. (1997). Competitive call control in mobile networks. In Lecture Notes in Computer Science (pp. 404-413). Springer Berlin Heidelberg. doi:10.1007/3-540-63890-3_43

DOI
10.1007/3-540-63890-3_43
Chapter

Efficiency of oblivious versus non-oblivious schedulers for optimistic, rate-based flow control (extended abstract)

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 (pp. 139-148). ACM Press. doi:10.1145/259380.259434

DOI
10.1145/259380.259434
Conference Paper

Efficient computations on fault-prone BSP machines

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 (pp. 84-93). ACM Press. doi:10.1145/258492.258501

DOI
10.1145/258492.258501
Conference Paper

On the fault tolerance of fat-trees

Nikoletseas, S., Pantziou, G., Psycharis, P., & Spirakis, P. (1997). On the fault tolerance of fat-trees. In Lecture Notes in Computer Science (pp. 208-217). Springer Berlin Heidelberg. doi:10.1007/bfb0002735

DOI
10.1007/bfb0002735
Chapter

Pure Greedy Hot-Potato in the 2-D Mesh with Random Destinations

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/s0129626497000267

DOI
10.1142/s0129626497000267
Journal article

1996

Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems

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-5

DOI
10.1016/s0304-3975(96)00065-5
Journal article

Simple atomic snapshots: A linear complexity solution with unbounded time-stamps

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-0

DOI
10.1016/0020-0190(95)00198-0
Journal article

(poly(log log n), poly(log log n))—Restricted verifiers are unlikely to exist for languages in $$\mathcal{N}\mathcal{P}$$ *

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 Lecture Notes in Computer Science (pp. 360-371). Springer Berlin Heidelberg. doi:10.1007/3-540-61550-4_162

DOI
10.1007/3-540-61550-4_162
Chapter

Attack modeling in open network environments

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_24

DOI
10.1007/978-0-387-35083-7_24
Chapter

BSP vs LogP

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 (pp. 25-32). ACM Press. doi:10.1145/237502.237504

DOI
10.1145/237502.237504
Conference Paper

On-demand hypermedia/multimedia service over broadband networks

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 (pp. 224-231). IEEE. doi:10.1109/hpdc.1996.546192

DOI
10.1109/hpdc.1996.546192
Conference Paper

Performance modeling of distributed timestamp ordering: Perfect and imperfect clocks

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-7

DOI
10.1016/0166-5316(94)00041-7
Journal article

Randomized adaptive video on demand

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 (pp. 179). ACM Press. doi:10.1145/248052.248087

DOI
10.1145/248052.248087
Conference Paper

Scheduling algorithms for strict multithreaded computations

Fatourou, P., & Spirakis, P. (1996). Scheduling algorithms for strict multithreaded computations. In Lecture Notes in Computer Science (pp. 407-416). Springer Berlin Heidelberg. doi:10.1007/bfb0009517

DOI
10.1007/bfb0009517
Chapter

Wormhole versus deflection routing: A case study on the mesh

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_136

DOI
10.1007/3-540-61332-3_136
Chapter

1995

The fourth moment in Luby's distribution

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-3

DOI
10.1016/0304-3975(95)00056-3
Journal article

The Fourth Moment in Luby's Distribution

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.19883

DOI
10.7146/brics.v2i15.19883
Journal article

Distributed protocols against mobile eavesdroppers

Spirakis, P., Tampakas, B., & Antonopoulou, H. (1995). Distributed protocols against mobile eavesdroppers. In Lecture Notes in Computer Science (pp. 160-167). Springer Berlin Heidelberg. doi:10.1007/bfb0022145

DOI
10.1007/bfb0022145
Chapter

Distributed protocols against mobile eavesdroppers

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/bfb0022145

DOI
10.1007/bfb0022145
Conference Paper

Efficient parallel algorithms for some tree layout problems

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/bfb0030846

DOI
10.1007/bfb0030846
Chapter

Expander properties in random regular graphs with edge faults

Nikoletseas, S. E., & Spirakis, P. G. (1995). Expander properties in random regular graphs with edge faults. In Lecture Notes in Computer Science (pp. 421-432). Springer Berlin Heidelberg. doi:10.1007/3-540-59042-0_93

DOI
10.1007/3-540-59042-0_93
Chapter

Parallel text retrieval on a high performance supercomputer using the Vector Space Model

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 (pp. 58-66). ACM Press. doi:10.1145/215206.215332

DOI
10.1145/215206.215332
Conference Paper

Preface

Spirakis, P. (1995). Preface (Vol. 979).

Book

Randomized competitive algorithms for admission control in general networks

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 (pp. 253). ACM Press. doi:10.1145/224964.224992

DOI
10.1145/224964.224992
Conference Paper

Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time

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_71

DOI
10.1007/3-540-60084-1_71
Conference Paper

Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time

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 (pp. 159-170). Springer Berlin Heidelberg. doi:10.1007/3-540-60084-1_71

DOI
10.1007/3-540-60084-1_71
Chapter

Tail bounds for occupancy and the satisfiability threshold conjecture

Kamath, A., Motwani, R., Palem, K., & Spirakis, P. (1995). Tail bounds for occupancy and the satisfiability threshold conjecture. Random Structures &amp; Algorithms, 7(1), 59-80. doi:10.1002/rsa.3240070105

DOI
10.1002/rsa.3240070105
Journal article

1994

Tentative and definite distributed computations: an optimistic approach to network synchronization

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-3

DOI
10.1016/0304-3975(94)90164-3
Journal article

A conceptual database approach for modelling 3D objects of irregular geometry

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_193

DOI
10.1007/3-540-58435-8_193
Chapter

Distributed pursuit-evasion

Spirakis, P., & Tampakas, B. (1994). Distributed pursuit-evasion. In Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 (pp. 403). ACM Press. doi:10.1145/197917.198191

DOI
10.1145/197917.198191
Conference Paper

Efficient sequential and parallel algorithms for the negative cycle problem

Kavvadias, D., Pantziou, G. E., Spirakis, P. G., & Zaroliagis, C. D. (1994). Efficient sequential and parallel algorithms for the negative cycle problem. In Lecture Notes in Computer Science (pp. 270-278). Springer Berlin Heidelberg. doi:10.1007/3-540-58325-4_190

DOI
10.1007/3-540-58325-4_190
Chapter

Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems

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 Lecture Notes in Computer Science (pp. 462-472). Springer Berlin Heidelberg. doi:10.1007/3-540-58338-6_93

DOI
10.1007/3-540-58338-6_93
Chapter

Intrusion detection: Approach and performance issues of the SECURENET system

Denault, M., Karagiannis, D., Gritzalis, D., & Spirakis, P. (1994). Intrusion detection: Approach and performance issues of the SECURENET system. Computers &amp; Security, 13(6), 495-508. doi:10.1016/0167-4048(91)90138-4

DOI
10.1016/0167-4048(91)90138-4
Journal article

Near-optimal dominating sets in dense random graphs in polynomial expected time

Nikoletseas, S. E., & Spirakis, P. G. (1994). Near-optimal dominating sets in dense random graphs in polynomial expected time. In Lecture Notes in Computer Science (pp. 1-10). Springer Berlin Heidelberg. doi:10.1007/3-540-57899-4_36

DOI
10.1007/3-540-57899-4_36
Chapter

Reading many variables in one atomic operation: solutions with linear or sublinear complexity

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.296315

DOI
10.1109/71.296315
Journal article

Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing

Nikoletseas, S., Palem, K., Spirakis, P., & Yung, M. (1994). Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing. In Lecture Notes in Computer Science (pp. 508-519). Springer Berlin Heidelberg. doi:10.1007/3-540-58201-0_94

DOI
10.1007/3-540-58201-0_94
Chapter

Surveillance and protection in IBC management

Androutsopoulos, D., Kaijser, P., Katsikas, S., Presttun, K., Salmon, D., & Spirakis, P. (1994). Surveillance and protection in IBC management. In Lecture Notes in Computer Science (pp. 61-72). Springer Berlin Heidelberg. doi:10.1007/bfb0013398

DOI
10.1007/bfb0013398
Chapter

Surveillance and protection in IBC management: The applicability of two RACE security projects - SecureNet II and SESAME

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/bfb0013398

DOI
10.1007/bfb0013398
Conference Paper

1993

A Formal Treatment of Relevance Information in Ill-Structured Environments

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_72

DOI
10.1007/978-3-662-12629-5_72
Chapter

Brain data base (BDB)

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_32

DOI
10.1007/3-540-57234-1_32
Chapter

Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays

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.1041

DOI
10.1006/inco.1993.1041
Journal article

Parallel Complexity of the Connected Subgraph Problem

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/0222039

DOI
10.1137/0222039
Journal article

1992

Efficient parallel algorithms for shortest paths in planar digraphs

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/bf01994878

DOI
10.1007/bf01994878
Journal article

Expected parallel time and sequential space complexity of graph and digraph problems

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/bf01758779

DOI
10.1007/bf01758779
Journal article

Distributed algorithms: 5th International Workshop, WDAG '91 Delphi, Greece, October 7-9, 1991 Proceedings

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.

Conference Paper

Distributed system simulator (DSS)

Spirakis, P., Tampakas, B., Papatriantafillou, M., Konstantoulis, K., Vlaxodimitropoulos, K., Antonopoulos, V., . . . Spartiotis, D. (1992). Distributed system simulator (DSS). In Lecture Notes in Computer Science (pp. 615-616). Springer Berlin Heidelberg. doi:10.1007/3-540-55210-3_222

DOI
10.1007/3-540-55210-3_222
Chapter

Fast parallel algorithms for coloring random graphs

Kedem, Z. M., Palem, K. V., Pantziou, G. E., Spirakis, P. G., & Zaroliagis, C. D. (1992). Fast parallel algorithms for coloring random graphs. In Lecture Notes in Computer Science (pp. 135-147). Springer Berlin Heidelberg. doi:10.1007/3-540-55121-2_13

DOI
10.1007/3-540-55121-2_13
Chapter

Preface

Toueg, S., Spirakis, P., & Kirousis, L. (1992). Preface (Vol. 579 LNCS).

Book

Reading many variables in one atomic operation solutions with linear or sublinear complexity

Kirousis, L. M., Spirakis, P., & Tsigas, P. (n.d.). Reading many variables in one atomic operation solutions with linear or sublinear complexity. In Lecture Notes in Computer Science (pp. 229-241). Springer-Verlag. doi:10.1007/bfb0022450

DOI
10.1007/bfb0022450
Chapter

Tentative and definite distributed computations: An optimistic approach to network synchronization

Garofalakis, J., Rajsbaum, S., Spirakis, P., & Tampakas, B. (1992). Tentative and definite distributed computations: An optimistic approach to network synchronization. In Lecture Notes in Computer Science (pp. 110-119). Springer Berlin Heidelberg. doi:10.1007/3-540-56188-9_8

DOI
10.1007/3-540-56188-9_8
Chapter

1991

The complexity of the reliable connectivity problem

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-b

DOI
10.1016/0020-0190(91)90023-b
Journal article

Combining tentative and definite executions for very fast dependable parallel computing

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 (pp. 381-390). ACM Press. doi:10.1145/103418.103459

DOI
10.1145/103418.103459
Conference Paper

A parallel algorithm for two processors precedence constraint scheduling

Jung, H., Serna, M., & Spirakis, P. (1991). A parallel algorithm for two processors precedence constraint scheduling. In Lecture Notes in Computer Science (pp. 417-428). Springer Berlin Heidelberg. doi:10.1007/3-540-54233-7_152

DOI
10.1007/3-540-54233-7_152
Chapter

Optimal parallel algorithms for sparse graphs

Pantziou, G. E., Spirakis, P. G., & Zaroliagis, C. D. (1991). Optimal parallel algorithms for sparse graphs. In Lecture Notes in Computer Science (pp. 1-17). Springer Berlin Heidelberg. doi:10.1007/3-540-53832-1_27

DOI
10.1007/3-540-53832-1_27
Chapter

Simple atomic snapshots a linear complexity solution with unbounded time-stamps

Kirousis, L. M., Spirakis, P., & Tsigas, P. (1991). Simple atomic snapshots a linear complexity solution with unbounded time-stamps. In Lecture Notes in Computer Science (pp. 582-587). Springer Berlin Heidelberg. doi:10.1007/3-540-54029-6_207

DOI
10.1007/3-540-54029-6_207
Chapter

The complexity of the reliable connectivity problem

Kavadias, D., Kirousis, L. M., & Spirakis, P. (1991). The complexity of the reliable connectivity problem. In Lecture Notes in Computer Science (pp. 259-266). Springer Berlin Heidelberg. doi:10.1007/3-540-54345-7_69

DOI
10.1007/3-540-54345-7_69
Chapter

Tight RNC approximations to Max Flow

Serna, M., & Spirakis, P. (n.d.). Tight RNC approximations to Max Flow. In Lecture Notes in Computer Science (pp. 118-126). Springer-Verlag. doi:10.1007/bfb0020792

DOI
10.1007/bfb0020792
Chapter

1990

Efficient parallel algorithms for shortest paths in planar graphs

Pantziou, G. E., Spirakis, P. G., & Zaroliagis, C. D. (1990). Efficient parallel algorithms for shortest paths in planar graphs. In Lecture Notes in Computer Science (pp. 288-300). Springer Berlin Heidelberg. doi:10.1007/3-540-52846-6_98

DOI
10.1007/3-540-52846-6_98
Chapter

Efficient robust parallel computations

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 (pp. 138-148). ACM Press. doi:10.1145/100216.100231

DOI
10.1145/100216.100231
Conference Paper

The performance of multistage interconnection networks with finite buffers

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.98779

DOI
10.1145/98460.98779
Journal article

The performance of multistage interconnection networks with finite buffers

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 (pp. 263-264). ACM Press. doi:10.1145/98457.98779

DOI
10.1145/98457.98779
Conference Paper

1989

Lower bounds and efficient algorithms for multiprocessor scheduling of dags with communication delays

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.72962

DOI
10.1145/72935.72962
Conference Paper

Efficient distributed algorithms by using the archimedean time assumption

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/1989230101131

DOI
10.1051/ita/1989230101131
Journal article

Fast parallel algorithms and the complexity of parallelism (basic issues and recent advances)

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_110

DOI
10.1007/3-540-50647-0_110
Chapter

Fast parallel approximations of the maximum weighted cut problem through derandomization

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_29

DOI
10.1007/3-540-52048-1_29
Chapter

Pythia and Tyche: An Eternal Golden Braid

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_34

DOI
10.1007/978-94-009-1175-8_34
Chapter

Symmetry breaking in asynchronous rings with o(n) messages

Spirakis, P., Tampakas, B., & Tsiolis, A. (1989). Symmetry breaking in asynchronous rings with o(n) messages. In Lecture Notes in Computer Science (pp. 233-241). Springer Berlin Heidelberg. doi:10.1007/3-540-51687-5_46

DOI
10.1007/3-540-51687-5_46
Chapter

The approximability of problems complete for P

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_16

DOI
10.1007/3-540-51859-2_16
Chapter

The parallel complexity of the subgraph connectivity problem

Kirousis, L., Serna, M., & Spirakis, P. (1989). The parallel complexity of the subgraph connectivity problem. In 30th Annual Symposium on Foundations of Computer Science Vol. 3 (pp. 294-299). IEEE. doi:10.1109/sfcs.1989.63493

DOI
10.1109/sfcs.1989.63493
Conference Paper

1988

Fast parallel algorithms and the complexity of parallelism (Basic issues and recent advances)

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-010

DOI
10.1515/9783112528365-010
Chapter

Efficient distributed algorithms by using the archimedean time assumption

Spirakis, P., & Tampakas, B. (n.d.). Efficient distributed algorithms by using the archimedean time assumption. In Lecture Notes in Computer Science (pp. 248-263). Springer-Verlag. doi:10.1007/bfb0035849

DOI
10.1007/bfb0035849
Chapter

Fast parallel algorithms for processing of joins

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_55

DOI
10.1007/3-540-18991-2_55
Chapter

Optimal parallel randomized algorithms for sparse addition and identification

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-9

DOI
10.1016/0890-5401(88)90039-9
Journal article

Probabilistic log-space reductions and problems probabilistically hard for p

Kirousis, L. M., & Spirakis, P. (1988). Probabilistic log-space reductions and problems probabilistically hard for p. In Lecture Notes in Computer Science (pp. 163-175). Springer Berlin Heidelberg. doi:10.1007/3-540-19487-8_19

DOI
10.1007/3-540-19487-8_19
Chapter

1987

Queueing delays in buffered multistage interconnection networks

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.29918

DOI
10.1145/29904.29918
Journal article

The diameter of connected components of random graphs

Spirakis, P. (1987). The diameter of connected components of random graphs. In Lecture Notes in Computer Science (pp. 264-276). Springer Berlin Heidelberg. doi:10.1007/3-540-17218-1_64

DOI
10.1007/3-540-17218-1_64
Chapter

The parallel complexity of deadlock detection

Spirakis, P. (1987). The parallel complexity of deadlock detection. Theoretical Computer Science, 52(1-2), 155-163. doi:10.1016/0304-3975(87)90084-3

DOI
10.1016/0304-3975(87)90084-3
Journal article

1986

LOGICAL 'FIRST MILE-LAST MILE' DIGITAL TERMINAL SYSTEMS.

Spirakis, P. (1986). LOGICAL 'FIRST MILE-LAST MILE' DIGITAL TERMINAL SYSTEMS.. In Conference Record - International Conference on Communications (pp. 1763).

Conference Paper

A very fast, practical algorithm for finding a negative cycle in a digraph

Spirakis, P., & Tsakalidis, A. (1986). A very fast, practical algorithm for finding a negative cycle in a digraph. In Lecture Notes in Computer Science (pp. 397-406). Springer Berlin Heidelberg. doi:10.1007/3-540-16761-7_89

DOI
10.1007/3-540-16761-7_89
Chapter

Foreword

Makedon, F., Mehlhorn, K., Papatheodorou, T., & Spirakis, P. (1986). Foreword (Vol. 227 LNCS).

Book

Input sensitive, optimal parallel randomized algorithms for addition and identification

Spirakis, P. G. (1986). Input sensitive, optimal parallel randomized algorithms for addition and identification. In Lecture Notes in Computer Science (pp. 73-86). Springer Berlin Heidelberg. doi:10.1007/3-540-16078-7_66

DOI
10.1007/3-540-16078-7_66
Chapter

The parallel complexity of deadlock detection

Spirakis, P. (n.d.). The parallel complexity of deadlock detection. In Lecture Notes in Computer Science (pp. 582-593). Springer-Verlag. doi:10.1007/bfb0016285

DOI
10.1007/bfb0016285
Chapter

1985

A semantic approach to correctness of concurrent transaction executions

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 (pp. 85-95). ACM. doi:10.1145/325405.325416

DOI
10.1145/325405.325416
Conference Paper

The volume of the union of many spheres and point inclusion problems

Spirakis, P. G. (n.d.). The volume of the union of many spheres and point inclusion problems. In Lecture Notes in Computer Science (pp. 328-338). Springer-Verlag. doi:10.1007/bfb0024021

DOI
10.1007/bfb0024021
Chapter

Unbounded Speed Variability in Distributed Communications Systems

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/0214005

DOI
10.1137/0214005
Journal article

k-connectivity in random undirected graphs

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-2

DOI
10.1016/0012-365x(85)90079-2
Journal article

1984

Strong np-hardness of moving many discs

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-3

DOI
10.1016/0020-0190(84)90130-3
Journal article

Real-Time Synchronization of Interprocess Communications

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.357244

DOI
10.1145/2993.357244
Journal article

Coordinating Pebble Motion On Graphs, The Diameter Of Permutation Groups, And Applications

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.715921

DOI
10.1109/sfcs.1984.715921
Conference Paper

Probabilistic bidding gives optimal distributed resource allocation

Reif, J., & Spirakis, P. (1984). Probabilistic bidding gives optimal distributed resource allocation. In Lecture Notes in Computer Science (pp. 391-402). Springer Berlin Heidelberg. doi:10.1007/3-540-13345-3_36

DOI
10.1007/3-540-13345-3_36
Chapter

1982

REAL TIME RESOURCE ALLOCATION IN DISTRIBUTED SYSTEMS.

Reif, J., & Spirakis, P. (1982). REAL TIME RESOURCE ALLOCATION IN DISTRIBUTED SYSTEMS.. In Unknown Conference (pp. 84-94).

Conference Paper

Real time resource allocation in distributed systems

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 (pp. 84-94). ACM Press. doi:10.1145/800220.806685

DOI
10.1145/800220.806685
Conference Paper

Unbounded speed variability in distributed communication systems

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 (pp. 46-56). ACM Press. doi:10.1145/582153.582159

DOI
10.1145/582153.582159
Conference Paper

1981

Random Independence Systems

Reif, J. H., & Spirakis, P. G. (1981). Random Independence Systems. doi:10.21236/ada109046

DOI
10.21236/ada109046
Journal article

Strong K-Connectivity in Digraphs and Random Digraphs

Reif, J. H., & Spirakis, P. G. (1981). Strong K-Connectivity in Digraphs and Random Digraphs. doi:10.21236/ada109034

DOI
10.21236/ada109034
Journal article

Distributed algorithms for synchronizing interprocess communication within real time

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 (pp. 133-145). ACM Press. doi:10.1145/800076.802467

DOI
10.1145/800076.802467
Conference Paper

K-Connectivity in Random Undirected Graphs.

Reif, J. H., & Spirakis, P. G. (1981). K-Connectivity in Random Undirected Graphs.. doi:10.21236/ada108826

DOI
10.21236/ada108826
Journal article

1980

Random matroids

Reif, J. H., & Spirakis, P. G. (1980). Random matroids. In Proceedings of the twelfth annual ACM symposium on Theory of computing - STOC '80 (pp. 385-397). ACM Press. doi:10.1145/800141.804688

DOI
10.1145/800141.804688
Conference Paper