Browse by People


Up a level
Export as [feed] RSS [feed] RSS 2.0 Short Author List
Number of items: 9.


Doty, D, Eftekhari, M, Michail, O ORCID: 0000-0002-6234-3960, Spirakis, PG and Theofilatos, M ORCID: 0000-0002-3699-0179
(2018) Brief announcement: Exact size counting in uniform population protocols in nearly logarithmic time. .


Michail, O ORCID: 0000-0002-6234-3960 and Spirakis,
(2016) Connectivity Preserving Network Transformers. In: Emergent Computation.


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


Michail, O ORCID: 0000-0002-6234-3960, Skretas, G and Spirakis, PG
(2019) On the Transformation Capability of Feasible Mechanisms for Programmable Matter. Journal of Computer and System Sciences, 102. 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
(2016) Simple and efficient local codes for distributed stable network construction. Distributed Computing, 29 (3). 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). 343 - 365.


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

This list was generated on Sun Nov 21 17:05:29 2021 GMT.