Browse by People

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

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.

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.

Almethen, Abdullah, Michail, O ORCID: 0000-0002-6234-3960 and Potapov, I (2019) Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable Matter. In: International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS).

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.

Michail, O ORCID: 0000-0002-6234-3960 (2018) Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata. Distributed Computing, 31 (5). pp. 343-365.

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.