


Остановите войну!
for scientists:
Paul G. Spirakis
Paul (Pavlos) Spirakis – Pavlos G. Spirakis
Person information

- affiliation: University of Liverpool, UK
- affiliation: University of Patras, Greece
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
- [j175]Othon Michail
, George Skretas
, Paul G. Spirakis
:
Distributed computation and reconfiguration in actively dynamic networks. Distributed Comput. 35(2): 185-206 (2022) - [j174]Themistoklis Melissourgos
, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos
, Paul G. Spirakis
:
An extension of the Moran process using type-specific connection graphs. J. Comput. Syst. Sci. 124: 77-96 (2022) - [j173]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos
, Paul G. Spirakis:
Approximating the existential theory of the reals. J. Comput. Syst. Sci. 125: 106-128 (2022) - [c290]Paul G. Spirakis:
Algorithmic Problems on Temporal Graphs (Invited Talk). SAND 2022: 2:1-2:1 - [i82]Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis:
The complexity of computing optimum labelings for temporal connectivity. CoRR abs/2202.05880 (2022) - [i81]Thekla Hamm, Nina Klobas, George B. Mertzios, Paul G. Spirakis:
The Complexity of Temporal Vertex Cover in Small-Degree Graphs. CoRR abs/2204.04832 (2022) - 2021
- [j172]Marios Mavronicolas, Loizos Michael, Vicky Papadopoulou Lesta
, Giuseppe Persiano, Anna Philippou, Paul G. Spirakis:
The Price of Defense. Algorithmica 83(5): 1256-1315 (2021) - [j171]Eleni C. Akrida, Argyrios Deligkas
, Themistoklis Melissourgos, Paul G. Spirakis:
Connected Subgraph Defense Games. Algorithmica 83(11): 3403-3431 (2021) - [j170]Alessandro Varsi
, Simon Maskell
, Paul G. Spirakis
:
An O(log2N) Fully-Balanced Resampling Algorithm for Particle Filters on Distributed Memory Architectures. Algorithms 14(12): 342 (2021) - [j169]Paul G. Spirakis
:
Maria Serna and her years in Patras. Comput. Sci. Rev. 39: 100350 (2021) - [j168]Sotiris E. Nikoletseas, Christoforos L. Raptopoulos
, Paul G. Spirakis
:
Maximum cliques in graphs with small intersection number and random intersection graphs. Comput. Sci. Rev. 39: 100353 (2021) - [j167]Matthew Connor, Othon Michail, Paul G. Spirakis:
On the Distributed Construction of Stable Networks in Polylogarithmic Parallel Time. Inf. 12(6): 254 (2021) - [j166]Argyrios Deligkas, John Fearnley
, Themistoklis Melissourgos
, Paul G. Spirakis
:
Computing exact solutions of consensus halving and the Borsuk-Ulam theorem. J. Comput. Syst. Sci. 117: 75-98 (2021) - [j165]Eleni C. Akrida
, George B. Mertzios
, Paul G. Spirakis
, Christoforos L. Raptopoulos:
The temporal explorer who returns to the base. J. Comput. Syst. Sci. 120: 179-193 (2021) - [j164]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Beyond Rings: Gathering in 1-Interval Connected Graphs. Parallel Process. Lett. 31(4): 2150020:1-2150020:31 (2021) - [c289]Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis:
Walrasian Equilibria in Markets with Small Demands. AAMAS 2021: 413-419 - [c288]Vasiliki Liagkou, Panagiotis E. Nastou, Paul G. Spirakis, Yannis C. Stamatiou:
Effective Enumeration of Infinitely Many Programs that Evade Formal Malware Analysis. CSCML 2021: 230-243 - [c287]Andreas Bardoutsos, Giorgos Matzarapis, Sotiris E. Nikoletseas, Paul G. Spirakis, Pantelis Tzamalis:
A Complementary Sensing Platform for a holistic approach to Allergic Rhinitis monitoring. DCOSS 2021: 171-180 - [c286]Andreas Bardoutsos, Dimitris Markantonatos, Sotiris E. Nikoletseas, Paul G. Spirakis, Pantelis Tzamalis:
A human-centered Web-based tool for the effective real-time motion data collection and annotation from BLE IoT devices. DCOSS 2021: 380-389 - [c285]Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems. ISAAC 2021: 28:1-28:16 - [c284]George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche:
The Complexity of Transitively Orienting Temporal Graphs. MFCS 2021: 75:1-75:18 - [c283]Vasileios Vlachos, Gerasimos Katevas, Ioannis Katsidimas, Emmanouil Kerimakis, Sotiris E. Nikoletseas, Stefanos Panagiotou, Paul G. Spirakis:
ASPIDA: An Observatory for Security and Privacy in the Greek e-Business Sector. PCI 2021: 362-368 - [c282]Evangelos Kipouridis
, Paul G. Spirakis
, Kostas Tsichlas
:
Threshold-Based Network Structural Dynamics. SIROCCO 2021: 127-145 - [i80]George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche:
The Complexity of Transitively Orienting Temporal Graphs. CoRR abs/2102.06783 (2021) - [i79]Evangelos Kipouridis
, Paul G. Spirakis, Kostas Tsichlas:
Threshold-based Network Structural Dynamics. CoRR abs/2103.04955 (2021) - [i78]Vasiliki Liagkou, Panayotis E. Nastou, Paul G. Spirakis, Yannis C. Stamatiou:
On the undecidability of the Panopticon detection problem. CoRR abs/2107.05220 (2021) - [i77]George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos:
The Complexity of Growing a Graph. CoRR abs/2107.14126 (2021) - [i76]Leszek Gasieniec, Paul G. Spirakis, Grzegorz Stachowiak:
New Clocks, Optimal Line Formation and Efficient Replication Population Protocols (Making Population Protocols Alive). CoRR abs/2111.10822 (2021) - 2020
- [j163]Argyrios Deligkas, John Fearnley
, Paul G. Spirakis:
Lipschitz Continuity and Approximate Equilibria. Algorithmica 82(10): 2927-2954 (2020) - [j162]Paul G. Spirakis:
Letter from the President. Bull. EATCS 130 (2020) - [j161]Paul G. Spirakis:
Letter from the President. Bull. EATCS 131 (2020) - [j160]Eleni C. Akrida
, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev:
Temporal vertex cover with a sliding time window. J. Comput. Syst. Sci. 107: 108-123 (2020) - [j159]Eleni C. Akrida
, George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis, Viktor Zamaraev:
How fast can we reach a target vertex in stochastic temporal graphs? J. Comput. Syst. Sci. 114: 65-83 (2020) - [j158]Giorgio Ausiello, Lila Kari, Grzegorz Rozenberg, Donald Sannella
, Paul G. Spirakis, Pierre-Louis Curien:
Preface. Theor. Comput. Sci. 807: 1-2 (2020) - [c281]Gabriel Filios, Ioannis Katsidimas, Sotiris E. Nikoletseas, Alexandros Souroulagkas, Paul G. Spirakis, Ioannis Tsenempis:
A smart energy management power supply unit for low-power IoT systems. DCOSS 2020: 227-235 - [c280]Gabriel Filios, Ioannis Katsidimas, Emmanouil Kerimakis, Sotiris E. Nikoletseas, Alexandros Souroulagkas, Paul G. Spirakis:
An IoT based Solar Park Health Monitoring System for PID and Hotspots Effects. DCOSS 2020: 396-403 - [c279]Argyrios Deligkas, George B. Mertzios
, Paul G. Spirakis
, Viktor Zamaraev
:
Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. MFCS 2020: 27:1-27:13 - [c278]Othon Michail, George Skretas, Paul G. Spirakis:
Distributed Computation and Reconfiguration in Actively Dynamic Networks. PODC 2020: 448-457 - [c277]Dmytro Antypov, Argyrios Deligkas, Vladimir V. Gusev, Matthew J. Rosseinsky, Paul G. Spirakis, Michail Theofilatos:
Crystal Structure Prediction via Oblivious Local Search. SEA 2020: 21:1-21:14 - [i75]Othon Michail, George Skretas, Paul G. Spirakis:
Distributed Computation and Reconfiguration in Actively Dynamic Networks. CoRR abs/2003.03355 (2020) - [i74]Dmytro Antypov, Argyrios Deligkas, Vladimir V. Gusev, Matthew J. Rosseinsky, Paul G. Spirakis, Michail Theofilatos:
Crystal Structure Prediction via Oblivious Local Search. CoRR abs/2003.12442 (2020) - [i73]Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev:
Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. CoRR abs/2004.06036 (2020) - [i72]Eleni C. Akrida, Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev:
Matching in Stochastically Evolving Graphs. CoRR abs/2005.08263 (2020) - [i71]Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis:
Walrasian Equilibria in Markets with Small Demands. CoRR abs/2005.11796 (2020) - [i70]Matthew Connor, Othon Michail, Paul G. Spirakis:
On the Distributed Construction of Stable Networks in Polylogarithmic Parallel Time. CoRR abs/2007.00625 (2020) - [i69]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Gathering in 1-Interval Connected Graphs. CoRR abs/2008.07455 (2020) - [i68]Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems. CoRR abs/2009.01567 (2020)
2010 – 2019
- 2019
- [j157]George B. Mertzios, Othon Michail, Paul G. Spirakis:
Temporal Network Optimization Subject to Connectivity Constraints. Algorithmica 81(4): 1416-1449 (2019) - [j156]Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis:
Binary Search in Graphs Revisited. Algorithmica 81(5): 1757-1780 (2019) - [j155]Paul G. Spirakis:
Letter from the President. Bull. EATCS 127 (2019) - [j154]Paul G. Spirakis:
Letter from the President. Bull. EATCS 128 (2019) - [j153]Paul G. Spirakis:
Letter from the President. Bull. EATCS 129 (2019) - [j152]Othon Michail, George Skretas, Paul G. Spirakis:
On the transformation capability of feasible mechanisms for programmable matter. J. Comput. Syst. Sci. 102: 18-39 (2019) - [j151]Eleni C. Akrida
, Jurek Czyzowicz, Leszek Gasieniec, Lukasz Kuszner, Paul G. Spirakis:
Temporal flows in temporal networks. J. Comput. Syst. Sci. 103: 46-60 (2019) - [j150]Eleni C. Akrida
, Paul G. Spirakis:
On Verifying and Maintaining Connectivity of Interval Temporal Networks. Parallel Process. Lett. 29(2): 1950009:1-1950009:16 (2019) - [j149]George Christodoulou, Martin Gairing, Yiannis Giannakopoulos
, Paul G. Spirakis:
The Price of Stability of Weighted Congestion Games. SIAM J. Comput. 48(5): 1544-1582 (2019) - [j148]Giorgio Ausiello, Lila Kari, Grzegorz Rozenberg, Donald Sannella
, Paul G. Spirakis, Pierre-Louis Curien:
Preface. Theor. Comput. Sci. 777: 1-2 (2019) - [c276]Ioannis Chatzigiannakis
, Luca Maiano, Panagiotis Trakadas, Aris Anagnostopoulos
, Federico Bacci, Panagiotis Karkazis, Paul G. Spirakis
, Theodore B. Zahariadis:
Data-Driven Intrusion Detection for Ambient Intelligence. AmI 2019: 235-251 - [c275]Eleni C. Akrida
, George B. Mertzios, Paul G. Spirakis:
The Temporal Explorer Who Returns to the Base. CIAC 2019: 13-24 - [c274]Vasiliki Liagkou, Paul G. Spirakis, Yannis C. Stamatiou
:
Randomized and Set-System Based Collusion Resistant Key Predistribution Schemes (Brief Announcement). CSCML 2019: 324-327 - [c273]Eleni C. Akrida
, George B. Mertzios
, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos
, Paul G. Spirakis
, Viktor Zamaraev
:
How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs? ICALP 2019: 131:1-131:14 - [c272]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos
, Paul G. Spirakis
:
Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem. ICALP 2019: 138:1-138:14 - [c271]Eleni C. Akrida
, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis:
Connected Subgraph Defense Games. SAGT 2019: 216-236 - [c270]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Fault Tolerant Network Constructors. SSS 2019: 243-255 - [i67]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis:
Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem. CoRR abs/1903.03101 (2019) - [i66]Eleni C. Akrida, George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis, Viktor Zamaraev:
How fast can we reach a target vertex in stochastic temporal graphs? CoRR abs/1903.03636 (2019) - [i65]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Fault Tolerant Network Constructors. CoRR abs/1903.05992 (2019) - [i64]Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis:
Connected Subgraph Defense Games. CoRR abs/1906.02774 (2019) - 2018
- [j147]Ioannis Lamprou
, Russell Martin, Paul G. Spirakis:
Cover Time in Edge-Uniform Stochastically-Evolving Graphs. Algorithms 11(10): 149 (2018) - [j146]Othon Michail, Paul G. Spirakis:
Elements of the theory of dynamic networks. Commun. ACM 61(2): 72 (2018) - [j145]Othon Michail
, Paul G. Spirakis:
How many cooks spoil the soup? Distributed Comput. 31(6): 455-469 (2018) - [j144]Paul G. Spirakis:
Letter from the President. Bull. EATCS 124 (2018) - [j143]Paul G. Spirakis:
Letter from the President. Bull. EATCS 125 (2018) - [j142]Paul G. Spirakis:
Letter from the President. Bull. EATCS 126 (2018) - [j141]George B. Mertzios
, Paul G. Spirakis
:
Strong bounds for evolution in networks. J. Comput. Syst. Sci. 97: 60-82 (2018) - [c269]Ioannis Chatzigiannakis, Vasiliki Liagkou, Paul G. Spirakis:
Brief Announcement: Providing End-to-End Secure Communication in Low-Power Wide Area Networks. CSCML 2018: 101-104 - [c268]Djamal Belazzougui, Alexis C. Kaporis, Paul G. Spirakis:
Random input helps searching predecessors. GASCom 2018: 106-115 - [c267]Eleni C. Akrida
, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev:
Temporal Vertex Cover with a Sliding Time Window. ICALP 2018: 148:1-148:14 - [c266]George Christodoulou, Martin Gairing, Yiannis Giannakopoulos
, Paul G. Spirakis:
The Price of Stability of Weighted Congestion Games. ICALP 2018: 150:1-150:16 - [c265]Themistoklis Melissourgos
, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis
:
Mutants and Residents with Different Connection Graphs in the Moran Process. LATIN 2018: 790-804 - [c264]George Christodoulou, Themistoklis Melissourgos
, Paul G. Spirakis:
Short Paper: Strategic Contention Resolution in Multiple Channels with Limited Feedback. SAGT 2018: 245-250 - [c263]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Brief Announcement: Fast Approximate Counting and Leader Election in Populations. SIROCCO 2018: 38-42 - [c262]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Simple and Fast Approximate Counting and Leader Election in Populations. SSS 2018: 154-169 - [c261]George Christodoulou, Themistoklis Melissourgos
, Paul G. Spirakis:
Strategic Contention Resolution in Multiple Channels. WAOA 2018: 165-180 - [c260]David Doty, Mahsa Eftekhari
, Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Brief Announcement: Exact Size Counting in Uniform Population Protocols in Nearly Logarithmic Time. DISC 2018: 46:1-46:3 - [c259]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos
, Paul G. Spirakis:
Approximating the Existential Theory of the Reals. WINE 2018: 126-139 - [p4]Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Efficient Approximation Algorithms in Random Intersection Graphs. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - [p3]Sotiris E. Nikoletseas, Paul G. Spirakis:
Randomized Approximation Techniques. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 189-201 - [e18]Igor Potapov, Paul G. Spirakis, James Worrell:
43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK. LIPIcs 117, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-086-6 [contents] - [i63]Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev:
Temporal Vertex Cover with a Sliding Time Window. CoRR abs/1802.07103 (2018) - [i62]George Christodoulou, Martin Gairing, Yiannis Giannakopoulos
, Paul G. Spirakis:
The Price of Stability of Weighted Congestion Games. CoRR abs/1802.09952 (2018) - [i61]Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis:
The temporal explorer who returns to the base. CoRR abs/1805.04713 (2018) - [i60]David Doty, Mahsa Eftekhari, Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Exact size counting in uniform population protocols in nearly logarithmic time. CoRR abs/1805.04832 (2018) - [i59]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Fast Approximate Counting and Leader Election in Populations. CoRR abs/1806.02638 (2018) - [i58]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis:
Approximating the Existential Theory of the Reals. CoRR abs/1810.01393 (2018) - [i57]George Christodoulou, Themistoklis Melissourgos, Paul G. Spirakis:
Strategic Contention Resolution in Multiple Channels. CoRR abs/1810.04565 (2018) - 2017
- [j140]Argyrios Deligkas, John Fearnley, Rahul Savani
, Paul G. Spirakis:
Computing Approximate Nash Equilibria in Polymatrix Games. Algorithmica 77(2): 487-514 (2017) - [j139]Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis:
Resolving Braess's Paradox in Random Networks. Algorithmica 78(3): 788-818 (2017) - [j138]George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Determining majority in networks with local interactions and very small local memory. Distributed Comput. 30(1): 1-16 (2017) - [j137]Paul G. Spirakis:
Letter from the President. Bull. EATCS 121 (2017) - [j136]Paul G. Spirakis, Leslie Ann Goldberg, Antonín Kucera, Giuseppe Persiano:
Statement from EATCS President and vice Presidents about the recent US travel restrictions to foreigners. Bull. EATCS 121 (2017) - [j135]Paul G. Spirakis:
Letter from the President. Bull. EATCS 122 (2017) - [j134]Paul G. Spirakis:
Letter from the President. Bull. EATCS 123 (2017) - [j133]Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
On the Chromatic Number of Non-Sparse Random Intersection Graphs. Theory Comput. Syst. 60(1): 112-127 (2017) - [j132]Eleni C. Akrida
, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis:
The Complexity of Optimal Design of Temporally Connected Graphs. Theory Comput. Syst. 61(3): 907-944 (2017) - [j131]Othon Michail
, Paul G. Spirakis
:
Connectivity preserving network transformers. Theor. Comput. Sci. 671: 36-55 (2017) - [c258]Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis:
The Computational Complexity of Weighted Greedy Matching. AAAI 2017: 466-474 - [c257]Eleni C. Akrida
, Jurek Czyzowicz, Leszek Gasieniec, Lukasz Kuszner
, Paul G. Spirakis:
Temporal Flows in Temporal Networks. CIAC 2017: 43-54 - [c256]Themistoklis Melissourgos
, Paul G. Spirakis:
Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff Values. CIAC 2017: 418-429 - [c255]Othon Michail, George Skretas, Paul G. Spirakis:
On the Transformation Capability of Feasible Mechanisms for Programmable Matter. ICALP 2017: 136:1-136:15 - [c254]Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis:
Binary Search in Graphs Revisited. MFCS 2017: 20:1-20:14 - [c253]George Christodoulou, Martin Gairing, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
A 3-Player Protocol Preventing Persistence in Strategic Contention with Limited Feedback. SAGT 2017: 240-251 - [c252]Othon Michail, Paul G. Spirakis:
Network Constructors: A Model for Programmable Matter. SOFSEM 2017: 15-34 - [c251]Ioannis Chatzigiannakis
, Paul G. Spirakis:
The Dynamics and Stability of Probabilistic Population Processes. SSS 2017: 33-45 - [c250]Ioannis Lamprou
, Russell Martin, Paul G. Spirakis:
Cover Time in Edge-Uniform Stochastically-Evolving Graphs. SSS 2017: 441-455 - [e17]Paul G. Spirakis, Philippas Tsigas:
Stabilization, Safety, and Security of Distributed Systems - 19th International Symposium, SSS 2017, Boston, MA, USA, November 5-8, 2017, Proceedings. Lecture Notes in Computer Science 10616, Springer 2017, ISBN 978-3-319-69083-4 [contents] - [i56]Themistoklis Melissourgos, Paul G. Spirakis:
Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff Values. CoRR abs/1701.08108 (2017) - [i55]Ioannis Lamprou, Russell Martin, Paul G. Spirakis:
Bounding the Cover Time in Edge-Uniform Stochastic Graphs. CoRR abs/1702.05412 (2017) - [i54]Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis:
Binary Search in Graphs Revisited. CoRR abs/1702.08899 (2017) - [i53]Othon Michail, George Skretas, Paul G. Spirakis:
On the Transformation Capability of Feasible Mechanisms for Programmable Matter. CoRR abs/1703.04381 (2017) - [i52]George Christodoulou, Martin Gairing, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul (Pavlos) Spirakis:
A 3-player protocol preventing persistence in strategic contention with limited feedback. CoRR abs/1707.01439 (2017) - [i51]Dimitris Fotakis, Vasilis Kontonis, Piotr Krysta, Paul G. Spirakis:
Learning Powers of Poisson Binomial Distributions. CoRR abs/1707.05662 (2017) - [i50]Themistoklis Melissourgos, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Mutants and Residents with Different Connection Graphs in the Moran Process. CoRR abs/1710.07365 (2017) - 2016
- [j130]George B. Mertzios, Paul G. Spirakis:
Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs. Algorithmica 74(1): 385-414 (2016) - [j129]Othon Michail
, Paul G. Spirakis:
Simple and efficient local codes for distributed stable network construction. Distributed Comput. 29(3): 207-237 (2016) - [j128]Luca Aceto, Mariangiola Dezani-Ciancaglini, Yuri Gurevich, David Harel, Monika Henzinger, Giuseppe F. Italiano, Scott A. Smolka, Paul G. Spirakis, Wolfgang Thomas:
EATCS Fellows' Advice to the Young Theoretical Computer Scientist. Bull. EATCS 119 (2016) - [j127]Paul G. Spirakis:
Letter from the President. Bull. EATCS 120 (2016) - [j126]Eleni C. Akrida
, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis:
Ephemeral networks with random availability of links: The case of fast networks. J. Parallel Distributed Comput. 87: 109-120 (2016) - [j125]