Improving the Integration of Neuro-Symbolic Rules with Case-Based Reasoning. - Jim Prentzas; Ioannis Hatzilygeroudis; Othon Michail (SETN, 2008)

On the Fairness of Probabilistic Schedulers for Population Protocols. - Ioannis Chatzigiannakis; Shlomi Dolev; Sándor P. Fekete; Othon Michail; Paul G. Spirakis (Algorithmic Methods for Distributed Cooperative Systems, 2009)

Recent Advances in Population Protocols. - Ioannis Chatzigiannakis; Othon Michail; Paul G. Spirakis (MFCS, 2009)

Not All Fair Probabilistic Schedulers Are Equivalent. - Ioannis Chatzigiannakis; Shlomi Dolev; Sándor P. Fekete; Othon Michail; Paul G. Spirakis (OPODIS, 2009)

Brief Announcement: Decidable Graph Languages by Mediated Population Protocols. - Ioannis Chatzigiannakis; Othon Michail; Paul G. Spirakis (DISC, 2009)

All Symmetric Predicates in NSPACE(n2) Are Stably Computable by the Mediated Population Protocol Model. - Ioannis Chatzigiannakis; Othon Michail; Stavros Nikolaou; Andreas Pavlogiannis; Paul G. Spirakis (MFCS, 2010)

Algorithmic Verification of Population Protocols. - Ioannis Chatzigiannakis; Othon Michail; Paul G. Spirakis (SSS, 2010)

Stably Decidable Graph Languages by Mediated Population Protocols. - Ioannis Chatzigiannakis; Othon Michail; Paul G. Spirakis (SSS, 2010)

Passively Mobile Communicating Logarithmic Space Machines - Ioannis Chatzigiannakis; Othon Michail; Stavros Nikolaou; Andreas Pavlogiannis; Paul G. Spirakis (CoRR, 2010)

Νέα μοντέλα για πρωτόκολλα πληθυσμών - Othon Michail (2010)

Computational models for networks of tiny artifacts: A survey. - Carme Àlvarez; Ioannis Chatzigiannakis; Amalia Duch; Joaquim Gabarró; Othon Michail; Maria J. Serna; Paul G. Spirakis (Comput. Sci. Rev., 2011)

Passively mobile communicating machines that use restricted space. - Ioannis Chatzigiannakis; Othon Michail; Stavros Nikolaou; Andreas Pavlogiannis; Paul G. Spirakis (Theor. Comput. Sci., 2011)

Mediated population protocols. - Othon Michail; Ioannis Chatzigiannakis; Paul G. Spirakis (Theor. Comput. Sci., 2011)

New Models for Population Protocols - Othon Michail; Ioannis Chatzigiannakis; Paul G. Spirakis (Morgan & Claypool Publishers, 2011)

Terminating Population Protocols via Some Minimal Global Knowledge Assumptions. - Othon Michail; Ioannis Chatzigiannakis; Paul G. Spirakis (SSS, 2012)

Brief Announcement: Naming and Counting in Anonymous Unknown Dynamic Networks. - Othon Michail; Ioannis Chatzigiannakis; Paul G. Spirakis (DISC, 2012)

Causality, Influence, and Computation in Possibly Disconnected Dynamic Networks - Othon Michail; Ioannis Chatzigiannakis; Paul G. Spirakis (CoRR, 2012)

Temporal Network Optimization Subject to Connectivity Constraints. - George B. Mertzios; Othon Michail; Ioannis Chatzigiannakis; Paul G. Spirakis (ICALP (2), 2013)

Naming and Counting in Anonymous Unknown Dynamic Networks. - Othon Michail; Ioannis Chatzigiannakis; Paul G. Spirakis (SSS, 2013)

The computational power of simple protocols for self-awareness on graphs. - Ioannis Chatzigiannakis; Othon Michail; Stavros Nikolaou; Paul G. Spirakis (Theor. Comput. Sci., 2013)

Causality, influence, and computation in possibly disconnected synchronous dynamic networks. - Othon Michail; Ioannis Chatzigiannakis; Paul G. Spirakis (J. Parallel Distributed Comput., 2014)

A Glimpse at Paul G. Spirakis. - Ioannis Chatzigiannakis; Dimitris Fotakis 001; Spyros C. Kontogiannis; Othon Michail; Sotiris E. Nikoletseas; Grammati E. Pantziou; Christos D. Zaroliagis (Algorithms, Probability, Networks, and Games, 2015)

NETCS: A New Simulator of Population Protocols and Network Constructors. - Dimitrios Amaxilatis; Marios Logaras; Othon Michail; Paul G. Spirakis (CoRR, 2015)

Terminating population protocols via some minimal global knowledge assumptions. - Othon Michail; Paul G. Spirakis (J. Parallel Distributed Comput., 2015)

Simple and efficient local codes for distributed stable network construction. - Othon Michail; Paul G. Spirakis (Distributed Comput., 2016)

An Introduction to Temporal Graphs: An Algorithmic Perspective. - Othon Michail (Internet Math., 2016)

Traveling salesman problems in temporal graphs. - Othon Michail; Paul G. Spirakis (Theor. Comput. Sci., 2016)

Network Constructors: A Model for Programmable Matter. - Othon Michail; Paul G. Spirakis (SOFSEM, 2017)

Connectivity preserving network transformers. - Othon Michail; Paul G. Spirakis (Theor. Comput. Sci., 2017)

Brief Announcement: Fast Approximate Counting and Leader Election in Populations. - Othon Michail; Paul G. Spirakis; Michail Theofilatos (SIROCCO, 2018)

Brief Announcement: Exact Size Counting in Uniform Population Protocols in Nearly Logarithmic Time. - David Doty; Mahsa Eftekhari; Othon Michail; Paul G. Spirakis; Michail Theofilatos (DISC, 2018)

Elements of the theory of dynamic networks. - Othon Michail; Paul G. Spirakis (Commun. ACM, 2018)

Exact size counting in uniform population protocols in nearly logarithmic time. - David Doty; Mahsa Eftekhari; Othon Michail; Paul G. Spirakis; Michail Theofilatos (CoRR, 2018)

Fast Approximate Counting and Leader Election in Populations. - Othon Michail; Paul G. Spirakis; Michail Theofilatos (CoRR, 2018)

Terminating distributed construction of shapes and patterns in a fair solution of automata. - Othon Michail (Distributed Comput., 2018)

How many cooks spoil the soup? - Othon Michail; Paul G. Spirakis (Distributed Comput., 2018)

Temporal Network Optimization Subject to Connectivity Constraints. - George B. Mertzios; Othon Michail; Paul G. Spirakis (Algorithmica, 2019)

On the transformation capability of feasible mechanisms for programmable matter. - Othon Michail; George Skretas; Paul G. Spirakis (J. Comput. Syst. Sci., 2019)

Gathering in 1-Interval Connected Graphs. - Othon Michail; Paul G. Spirakis; Michail Theofilatos (CoRR, 2020)

Pushing lines helps: Efficient universal centralised transformations for programmable matter. - Abdullah Almethen; Othon Michail; Igor Potapov (Theor. Comput. Sci., 2020)

On the Distributed Construction of Stable Networks in Polylogarithmic Parallel Time. - Matthew Connor; Othon Michail; Paul G. Spirakis (Inf., 2021)

Beyond Rings: Gathering in 1-Interval Connected Graphs. - Othon Michail; Paul G. Spirakis; Michail Theofilatos (Parallel Process. Lett., 2021)

Centralised Connectivity-Preserving Transformations by Rotation: 3 Musketeers for All Orthogonal Convex Shapes. - Matthew Connor; Othon Michail (ALGOSENSORS, 2022)

Distributed computation and reconfiguration in actively dynamic networks. - Othon Michail; George Skretas; Paul G. Spirakis (Distributed Comput., 2022)

Simple and fast approximate counting and leader election in populations. - Othon Michail; Paul G. Spirakis; Michail Theofilatos (Inf. Comput., 2022)

Special issue on Algorithmic Theory of Dynamic Networks and Its Applications - Preface. - Silvia Bonomi; Giuseppe Antonio Di Luna; Othon Michail; Leonardo Querzoni (J. Comput. Syst. Sci., 2022)

On efficient connectivity-preserving transformations in a grid. - Abdullah Almethen; Othon Michail; Igor Potapov (Theor. Comput. Sci., 2022)

Centralised connectivity-preserving transformations for programmable matter: A minimal seed approach. - Matthew Connor; Othon Michail; Igor Potapov (Theor. Comput. Sci., 2022)

Growing Fast without Colliding: Polylogarithmic Time Step Construction of Geometric Shapes. - Nada Almalki 002; Siddharth Gupta 002; Othon Michail (CoRR, 2023)

Distributed transformations of Hamiltonian shapes based on line moves. - Abdullah Almethen; Othon Michail; Igor Potapov (Theor. Comput. Sci., 2023)

Fault tolerant network constructors. - Othon Michail; Paul G. Spirakis; Michail Theofilatos (Inf. Comput., 2023)

Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid Them. - Siddharth Gupta 002; Marc J. van Kreveld; Othon Michail; Andreas Padalkin (ALGOWIN, 2024)

Brief Announcement: On the Exponential Growth of Geometric Shapes. - Nada Almalki 002; Siddharth Gupta 002; Othon Michail (SAND, 2024)

Brief Announcement: Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid Them. - Siddharth Gupta 002; Marc J. van Kreveld; Othon Michail; Andreas Padalkin (SAND, 2024)

All for One and One for All: An O(1)-Musketeers Universal Transformation for Rotating Robots. - Matthew Connor; Othon Michail; George Skretas (SAND, 2024)

On geometric shape construction via growth operations. - Nada Almalki 002; Othon Michail (Theor. Comput. Sci., 2024)

Special Issue on the 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). - James Aspnes; Othon Michail (J. Comput. Syst. Sci., 2024)

Brief Announcement: Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits. - Nada Almalki 002; Siddharth Gupta 002; Othon Michail; Andreas Padalkin (SAND, 2025)

Transformation of modular robots by rotation: 3 + 1 musketeers for all orthogonally convex shapes. - Matthew Connor; Othon Michail (J. Comput. Syst. Sci., 2025)

The complexity of growing a graph. - George B. Mertzios; Othon Michail; George Skretas; Paul G. Spirakis; Michail Theofilatos (J. Comput. Syst. Sci., 2025)

On the exponential growth of geometric shapes. - Nada Almalki 002; Siddharth Gupta 002; Othon Michail (Theor. Comput. Sci., 2025)

All for one and one for all: An O(1)-musketeers generic transformation for rotating robots. - Matthew Connor; Othon Michail; George Skretas (Theor. Comput. Sci., 2025)

Recognizing and Realizing Temporal Reachability Graphs. - Thomas Erlebach; Othon Michail; Nils Morawietz (CoRR, 2025)

Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits. - Nada Almalki 002; Siddharth Gupta 002; Othon Michail; Andreas Padalkin (CoRR, 2025)