Browse by People

Spirakis, PG ORCID: 0000-0001-5396-3749, Christodoulou, G, Gairing, M, Nikoletseas, S and Raptopoulos, C (2017) A 3-player protocol preventing persistence in strategic contention with limited feedback. In: 10th International Symposium on Algorithmic Game Theory (SAGT 2017), 2017-9-12 - 2017-9-14, L'Acquilla Iatly.

Spirakis, PG ORCID: 0000-0001-5396-3749, Deligkas, A and mertzios, george (2018) Binary Search in Graphs Revisited. Algorithmica: an international journal in computer science, 81 (5). pp. 1757-1780.

Spirakis, PG, Deligkas, A and mertzios, george (2018) Binary Search in Graphs Revisited. Algorithmica: an international journal in computer science.

Doty, D, Eftekhari, M, Michail, O ORCID: 0000-0002-6234-3960, Spirakis, PG ORCID: 0000-0001-5396-3749 and Theofilatos, M ORCID: 0000-0002-3699-0179 (2018) Brief announcement: Exact size counting in uniform population protocols in nearly logarithmic time. In: International Symposium on Distributed Computing (DISC).

Spirakis, PG ORCID: 0000-0001-5396-3749 and Michail, Othon ORCID: 0000-0002-6234-3960 (2018) Communications of ACM (CACM). Communications of the ACM.

Klobas, N, Mertzios, GB, Molter, H and Spirakis, PG ORCID: 0000-0001-5396-3749 (2022) The Complexity of Computing Optimum Labelings for Temporal Connectivity. In: Mathematical Foundations of Computer Science (MFCS 2022), 2022-8-22 - 2022-8-26, Vienna , Austria.

Mertzios, GB, Molter, H, Renken, M, Spirakis, PG ORCID: 0000-0001-5396-3749 and Zschoche, P (2021) The Complexity of Transitively Orienting Temporal Graphs. .

Lamprou, I ORCID: 0000-0001-5337-7336, Martin, Russell and Spirakis, PG ORCID: 0000-0001-5396-3749 (2018) Cover Time in Edge-Uniform Stochastically-Evolving Graphs. Algorithms, 11 (10).

Spirakis, PG ORCID: 0000-0001-5396-3749, Gasieniec, L ORCID: 0000-0003-1809-9814, Martin, R ORCID: 0000-0002-7043-503X, Hamilton, D and Stachowiac, G (2017) Deterministic Population Protocols for Exact Majority and Plurality. In: OPODIS 2016, 2016-12-13 - 2016-12-16, Madrit Spain.

Michail, O ORCID: 0000-0002-6234-3960 and Spirakis, PG ORCID: 0000-0001-5396-3749 (2016) How Many Cooks Spoil the Soup ? In: 23rd International Colloquium on Structural Information and Communication Complexity, 2016-7-19 - 2016-7-21, Helsinki , Finland.

Gąsieniec, L ORCID: 0000-0003-1809-9814, Spirakis, PG ORCID: 0000-0001-5396-3749 and Stachowiak, G (2023) New Clocks, Optimal Line Formation and Self-Replication Population Protocols. In: 40th International Symposium on Theoretical Aspects of Computer Science, 2023-3-7 - 2023-3-10, Hamburg, Germany.

Michail, O ORCID: 0000-0002-6234-3960, Skretas, G ORCID: 0000-0003-2514-8004 and Spirakis, PG ORCID: 0000-0001-5396-3749 (2019) On the Transformation Capability of Feasible Mechanisms for Programmable Matter. Journal of Computer and System Sciences, 102. pp. 18-39.

Christodoulou, George, Gairing, M, Giannakopoulos, Yiannis and Spirakis, PG ORCID: 0000-0001-5396-3749 (2019) The Price of Stability of Weighted Congestion Games. SIAM Journal on Computing, 48 (5). pp. 1544-1582.

Christodoulou, George, Gairing, Martin, Giannakopoulos, Yannis and Spirakis, PG ORCID: 0000-0001-5396-3749 (2018) The Price of Stability of Weighted Congestion Games. In: International Colloquium on Automata , Languages and Programming (ICALP), 2018-7-9 - 2018-7-13, Prague.

Spirakis, PG ORCID: 0000-0001-5396-3749, Chatzigiannakis, Ioannis and Liagkou, Vasiliki (2018) Providing End-to-End Secure Communication in Low-Power Wide Area Networks (LPWANs). In: 2nd International Symposium on Cyber Security Cryptography and Macine Learning CSCML, 2018-6-21 - 2018-6-22, Beer Sheva Israel.

Belazzougui, D, Kaporis, AC and Spirakis, PG ORCID: 0000-0001-5396-3749 (2018) Random input helps searching predecessors. .

Fotakis, D, Kaporis, A, Lianeas, T and Spirakis, PG ORCID: 0000-0001-5396-3749 (2017) Resolving Braess's Paradox in Random Networks. Algorithmica, 78 (03). pp. 788-818.

Michail, Othon ORCID: 0000-0002-6234-3960, Spirakis, PG ORCID: 0000-0001-5396-3749 and Theofilatos, Michail ORCID: 0000-0002-3699-0179 (2018) Simple and Fast Approximate Counting and Leader Election in Populations. In: 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 2018-11-4 - 2018-11-7, Tokyo, Japan..

Michail, O ORCID: 0000-0002-6234-3960 and Spirakis, PG ORCID: 0000-0001-5396-3749 (2016) Simple and efficient local codes for distributed stable network construction. Distributed Computing, 29 (3). pp. 207-237.

Michail, O ORCID: 0000-0002-6234-3960 and Spirakis, PG (2016) Simple and efficient local codes for distributed stable network construction. DISTRIBUTED COMPUTING, 29 (3). 207 - 237.

Klobas, N, Mertzios, GB and Spirakis, PG ORCID: 0000-0001-5396-3749 (2023) Sliding into the Future: Investigating Sliding Windows in Temporal Graphs. .

Mertzios, GB, Nikoletseas, SE, Raptopoulos, CL and Spirakis, PG ORCID: 0000-0001-5396-3749 (2016) Stably computing order statistics with arithmetic population protocols. In: Mathematical Foundations of Computer Science, 2016-8-22 - 2016-8-26, Krakow Poland.

Christodoulou, G, Gairing, M, Nikoletseas, S, Raptopoulos, C and Spirakis, PG ORCID: 0000-0001-5396-3749 (2016) Strategic Contention Resolution with Limited Feedback. In: 24th Annual European Symposium on Algorithms (ESA 2016), 2016-8-22 - 2016-8-24, Aarhus , Denmark.

Mertzios, George and Spirakis, PG ORCID: 0000-0001-5396-3749 (2018) Strong Bounds for Evolution in Networks. Journal of Computer and System Sciences, 97. pp. 60-82.

Spirakis, PG ORCID: 0000-0001-5396-3749 and Michail, O ORCID: 0000-0002-6234-3960 (2016) Traveling Salesman Problems in Temporal Graphs. Theoretical Computer Science, 634. pp. 1-23.

Deligkas, A, Melissourgos, T and Spirakis, PG ORCID: 0000-0001-5396-3749 (2021) Walrasian equilibria in markets with small demands. In: 20th International Conference on Autonomous Agents and Multiagent Systems (AAMAS2021), 2021-5-3 - 2021-5-7.