Browse by People

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

Melissourgos, Themistoklis ORCID: 0000-0002-9867-6257, Nikoletseas, Sotiris E, Raptopoulos, Christoforos L and Spirakis, Paul G (2018) Mutants and Residents with Different Connection Graphs in the Moran Process. .

Nikoletseas, Sotiris E, Raptopoulos, Christoforos L and Spirakis, Paul G (2017) On the Chromatic Number of Non-Sparse Random Intersection Graphs. THEORY OF COMPUTING SYSTEMS, 60 (1). 112 - 127.

Mertzios, George B, Nikoletseas, Sotiris E, Raptopoulos, Christoforos L and Spirakis, Paul G (2017) Population Protocols for Majority in Arbitrary Networks. 77 - 82.

Christodoulou, George, Gairing, Martin, Nikoletseas, Sotiris E, Raptopoulos, Christoforos L and Spirakis, Paul G (2016) Strategic Contention Resolution with Limited Feedback. .

Melissourgos, Themistoklis, Nikoletseas, Sotiris E, Raptopoulos, Christoforos L and Spirakis, Paul G (2022) An extension of the Moran process using type-specific connection graphs. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 124. 77 - 96.