Browse by People


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


Michail, Othon ORCID: 0000-0002-6234-3960, Spirakis, Paul G and Theofilatos, Michail ORCID: 0000-0002-3699-0179
(2018) Brief Announcement: Fast Approximate Counting and Leader Election in Populations. .


Michail, Othon ORCID: 0000-0002-6234-3960, Chatzigiannakis, Ioannis and Spirakis, Paul G
(2014) Causality, influence, and computation in possibly disconnected synchronous dynamic networks. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 74 (01). 2016 - 2026.


Spirakis, PG and Michail, Othon
(2018) Communications of ACM (CACM). Communications of the ACM.


Michail, Othon ORCID: 0000-0002-6234-3960 and Spirakis, Paul G
(2017) Connectivity preserving network transformers. THEORETICAL COMPUTER SCIENCE, 671. 36 - 55.


Michail, Othon ORCID: 0000-0002-6234-3960, Skretas, george and Spirakis, paul
(2020) Distributed Computation and Reconfiguration in Actively Dynamic Networks. In: 39th ACM Symposium on Principles of Distributed Computing (PODC), 2020-08-03 - 2020-08-07.


Michail, Othon ORCID: 0000-0002-6234-3960 and Spirakis, Paul G
(2018) Elements of the Theory of Dynamic Networks. COMMUNICATIONS OF THE ACM, 61 (2). 72 - 81.


Doty, David, Eftekhari, Mahsa, Michail, Othon ORCID: 0000-0002-6234-3960, Spirakis, Paul G and Theofilatos, Michail ORCID: 0000-0002-3699-0179
Exact size counting in uniform population protocols in nearly logarithmic time.


Michail, Othon ORCID: 0000-0002-6234-3960, Spirakis, Paul G and Theofilatos, Michail ORCID: 0000-0002-3699-0179
(2018) Fast Approximate Counting and Leader Election in Populations. .


Michail, Othon, Spirakis, Paul G and Theofilatos, Michail ORCID: 0000-0002-3699-0179
(2019) Fault Tolerant Network Constructors. Lecture Notes in Computer Science.


Michail, Othon ORCID: 0000-0002-6234-3960, Spirakis, Paul G and Theofilatos, Michail ORCID: 0000-0002-3699-0179
(2019) Fault Tolerant Network Constructors. .


Michail, Othon, Spirakis, Paul G and Theofilatos, Michail ORCID: 0000-0002-3699-0179
Gathering in 1-Interval Connected Graphs.


Michail, Othon ORCID: 0000-0002-6234-3960 and Spirakis, Paul G
(2018) How many cooks spoil the soup? DISTRIBUTED COMPUTING, 31 (6). 455 - 469.


Michail, Othon ORCID: 0000-0002-6234-3960
An Introduction to Temporal Graphs: An Algorithmic Perspective.


Michail, Othon ORCID: 0000-0002-6234-3960, Chatzigiannakis, Ioannis and Spirakis, Paul G
(2011) Mediated population protocols. THEORETICAL COMPUTER SCIENCE, 412 (22). 2434 - 2450.


Amaxilatis, Dimitrios, Logaras, Marios, Michail, Othon ORCID: 0000-0002-6234-3960 and Spirakis, Paul G
NETCS: A New Simulator of Population Protocols and Network Constructors.


Michail, Othon ORCID: 0000-0002-6234-3960 and Spirakis, Paul G
(2017) Network Constructors: A Model for Programmable Matter. .


Almethen, Abdullah, Michail, Othon ORCID: 0000-0002-6234-3960 and Potapov, Igor
(2020) On Efficient Connectivity-Preserving Transformations in a Grid. In: ALGOSENSORS.


Almethen, Abdullah, Michail, Othon and Potapov, Igor
On Efficient Connectivity-Preserving Transformations in a Grid.


Michail, Othon ORCID: 0000-0002-6234-3960, Skretas, George and Spirakis, Paul G
(2017) On the Transformation Capability of Feasible Mechanisms for Programmable Matter. .


Almethen, Abdullah, Michail, Othon and Potapov, Igor
Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable Matter. [Internet Publication]


Almethen, Abdullah, Michail, Othon ORCID: 0000-0002-6234-3960 and Potapov, Igor
(2020) Pushing lines helps: Efficient universal centralised transformations for programmable matter. .


Almethen, Abdullah, Michail, Othon ORCID: 0000-0002-6234-3960 and Potapov, Igor
(2020) Pushing lines helps: Efficient universal centralised transformations for programmable matter. Theor. Comput. Sci., 830-83. 43 - 59.


Michail, Othon ORCID: 0000-0002-6234-3960, Spirakis, Paul and Theofilatos, Michail ORCID: 0000-0002-3699-0179
(2020) Simple and Fast Approximate Counting and Leader Election in Populations. Information and Computation.


Michail, Othon ORCID: 0000-0002-6234-3960, Spirakis, PG and Theofilatos, Michail ORCID: 0000-0002-3699-0179
(2018) Simple and Fast Approximate Counting and Leader Election in Populations. In: 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 2018-11-04 - 2018-11-07, Tokyo, Japan..


Mertzios, George, Michail, Othon ORCID: 0000-0002-6234-3960 and Spirakis, Paul
(2019) Temporal Network Optimization Subject to Connectivity Constraints. Algorithmica: an international journal in computer science, 81. 1416 - 1449.


Michail, Othon ORCID: 0000-0002-6234-3960
Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata. .


Michail, Othon ORCID: 0000-0002-6234-3960 and Spirakis, Paul G
(2015) Terminating population protocols via some minimal global knowledge assumptions. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 81-82. 1 - 10.

This list was generated on Fri Nov 20 11:41:08 2020 GMT.