![]() | Up a level |
Mertzios, George B, Nikoletseas, Sotiris E, Raptopoulos, Christoforos L and Spirakis, Paul G ORCID: 0000-0001-5396-3749
(2017)
Determining majority in networks with local interactions and very small local memory.
Distributed Computing, 30 (1).
pp. 1-16.
Nikoletseas, Sotiris E, Raptopoulos, Christoforos L and Spirakis, Paul G ORCID: 0000-0001-5396-3749
(2021)
Maximum cliques in graphs with small intersection number and random intersection graphs.
COMPUTER SCIENCE REVIEW, 39.
p. 100353.
Melissourgos, Themistoklis ORCID: 0000-0002-9867-6257, Nikoletseas, Sotiris E, Raptopoulos, Christoforos L and Spirakis, Paul G
ORCID: 0000-0001-5396-3749
(2018)
Mutants and Residents with Different Connection Graphs in the Moran Process.
In: Latin American Theoretical Informatics Symposium, 2018-4-16 - 2018-4-19, Buenos Aires Argentina.
Nikoletseas, Sotiris E, Raptopoulos, Christoforos L and Spirakis, Paul G ORCID: 0000-0001-5396-3749
(2017)
On the Chromatic Number of Non-Sparse Random Intersection Graphs.
THEORY OF COMPUTING SYSTEMS, 60 (1).
pp. 112-127.
Mertzios, George B, Nikoletseas, Sotiris E, Raptopoulos, Christoforos L and Spirakis, Paul G ORCID: 0000-0001-5396-3749
(2017)
Population Protocols for Majority in Arbitrary Networks.
Trends in Mathematics, 6.
pp. 77-82.
Christodoulou, George, Gairing, Martin, Nikoletseas, Sotiris E, Raptopoulos, Christoforos L and Spirakis, Paul G ORCID: 0000-0001-5396-3749
(2016)
Strategic Contention Resolution with Limited Feedback.
In: 24th Annual European Symposium on Algorithms (ESA 2016), Aarhus.
Melissourgos, Themistoklis, Nikoletseas, Sotiris E, Raptopoulos, Christoforos L and Spirakis, Paul G ORCID: 0000-0001-5396-3749
(2022)
An extension of the Moran process using type-specific connection graphs.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 124.
pp. 77-96.