Othon Michail

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 56

Top Topics

Preserving Transformations

Traveling Salesman

Dynamic Networks

Top Venues

Theor. Comput. Sci.

Distributed Comput.

Publications

Siddharth Gupta, Marc J. van Kreveld, Othon Michail, Andreas Padalkin
Brief Announcement: Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid Them. SAND (2024)
Nada Almalki, Siddharth Gupta, Othon Michail
Brief Announcement: On the Exponential Growth of Geometric Shapes. SAND (2024)
Matthew Connor, Othon Michail, George Skretas
All for One and One for All: An O(1)-Musketeers Universal Transformation for Rotating Robots. SAND (2024)
James Aspnes, Othon Michail
Special Issue on the 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). J. Comput. Syst. Sci. 141 (2024)
Nada Almalki, Othon Michail
On geometric shape construction via growth operations. Theor. Comput. Sci. 984 (2024)
Abdullah Almethen, Othon Michail, Igor Potapov
Distributed transformations of Hamiltonian shapes based on line moves. Theor. Comput. Sci. 942 (2023)
Nada Almalki, Siddharth Gupta, Othon Michail
Growing Fast without Colliding: Polylogarithmic Time Step Construction of Geometric Shapes. CoRR (2023)
Siddharth Gupta, Marc J. van Kreveld, Othon Michail, Andreas Padalkin
Collision Detection for Modular Robots - it is easy to cause collisions and hard to avoid them. CoRR (2023)
Othon Michail, Paul G. Spirakis, Michail Theofilatos
Fault tolerant network constructors. Inf. Comput. 292 (2023)
Othon Michail, George Skretas, Paul G. Spirakis
Distributed computation and reconfiguration in actively dynamic networks. Distributed Comput. 35 (2) (2022)
Nada Almalki, Othon Michail
On Geometric Shape Construction via Growth Operations. ALGOSENSORS (2022)
Matthew Connor, Othon Michail, Igor Potapov
Centralised connectivity-preserving transformations for programmable matter: A minimal seed approach. Theor. Comput. Sci. 936 (2022)
Silvia Bonomi, Giuseppe Antonio Di Luna, Othon Michail, Leonardo Querzoni
Special issue on Algorithmic Theory of Dynamic Networks and Its Applications - Preface. J. Comput. Syst. Sci. 123 (2022)
Abdullah Almethen, Othon Michail, Igor Potapov
On efficient connectivity-preserving transformations in a grid. Theor. Comput. Sci. 898 (2022)
Matthew Connor, Othon Michail
Centralised Connectivity-Preserving Transformations by Rotation: 3 Musketeers for All Orthogonal Convex Shapes. ALGOSENSORS (2022)
Othon Michail, Paul G. Spirakis, Michail Theofilatos
Simple and fast approximate counting and leader election in populations. Inf. Comput. 285 (Part) (2022)
George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos
The Complexity of Growing a Graph. ALGOSENSORS (2022)
Matthew Connor, Othon Michail
Centralised Connectivity-Preserving Transformations by Rotation: 3 Musketeers for all Orthogonal Convex Shapes. CoRR (2022)
Nada Almalki, Othon Michail
On Geometric Shape Construction via Growth Operations. CoRR (2022)
Abdullah Almethen, Othon Michail, Igor Potapov
Distributed Transformations of Hamiltonian Shapes based on Line Moves. CoRR (2021)
Matthew Connor, Othon Michail, Paul G. Spirakis
On the Distributed Construction of Stable Networks in Polylogarithmic Parallel Time. Inf. 12 (6) (2021)
George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos
The Complexity of Growing a Graph. CoRR (2021)
Othon Michail, Paul G. Spirakis, Michail Theofilatos
Beyond Rings: Gathering in 1-Interval Connected Graphs. Parallel Process. Lett. 31 (4) (2021)
Abdullah Almethen, Othon Michail, Igor Potapov
Distributed Transformations of Hamiltonian Shapes Based on Line Moves. ALGOSENSORS (2021)
Matthew Connor, Othon Michail, Igor Potapov
Centralised Connectivity-Preserving Transformations for Programmable Matter: A Minimal Seed Approach. CoRR (2021)
Matthew Connor, Othon Michail, Igor Potapov
Centralised Connectivity-Preserving Transformations for Programmable Matter: A Minimal Seed Approach. ALGOSENSORS (2021)
Othon Michail, George Skretas, Paul G. Spirakis
Distributed Computation and Reconfiguration in Actively Dynamic Networks. CoRR (2020)
Othon Michail, Paul G. Spirakis, Michail Theofilatos
Gathering in 1-Interval Connected Graphs. CoRR (2020)
Abdullah Almethen, Othon Michail, Igor Potapov
On Efficient Connectivity-Preserving Transformations in a Grid. CoRR (2020)
Matthew Connor, Othon Michail, Paul G. Spirakis
On the Distributed Construction of Stable Networks in Polylogarithmic Parallel Time. CoRR (2020)
Othon Michail, George Skretas, Paul G. Spirakis
Distributed Computation and Reconfiguration in Actively Dynamic Networks. PODC (2020)
Abdullah Almethen, Othon Michail, Igor Potapov
On Efficient Connectivity-Preserving Transformations in a Grid. ALGOSENSORS (2020)
Abdullah Almethen, Othon Michail, Igor Potapov
Pushing lines helps: Efficient universal centralised transformations for programmable matter. Theor. Comput. Sci. (2020)
Othon Michail, George Skretas, Paul G. Spirakis
On the transformation capability of feasible mechanisms for programmable matter. J. Comput. Syst. Sci. 102 (2019)
George B. Mertzios, Othon Michail, Paul G. Spirakis
Temporal Network Optimization Subject to Connectivity Constraints. Algorithmica 81 (4) (2019)
Othon Michail, Paul G. Spirakis, Michail Theofilatos
Fault Tolerant Network Constructors. CoRR (2019)
Othon Michail, Paul G. Spirakis, Michail Theofilatos
Fault Tolerant Network Constructors. SSS (2019)
Abdullah Almethen, Othon Michail, Igor Potapov
Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable Matter. CoRR (2019)
Abdullah Almethen, Othon Michail, Igor Potapov
Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable Matter. ALGOSENSORS (2019)
David Doty, Mahsa Eftekhari, Othon Michail, Paul G. Spirakis, Michail Theofilatos
Exact size counting in uniform population protocols in nearly logarithmic time. CoRR (2018)
Othon Michail, Paul G. Spirakis, Michail Theofilatos
Simple and Fast Approximate Counting and Leader Election in Populations. SSS (2018)
Othon Michail, Paul G. Spirakis, Michail Theofilatos
Brief Announcement: Fast Approximate Counting and Leader Election in Populations. SIROCCO (2018)
David Doty, Mahsa Eftekhari, Othon Michail, Paul G. Spirakis, Michail Theofilatos
Brief Announcement: Exact Size Counting in Uniform Population Protocols in Nearly Logarithmic Time. DISC (2018)
Othon Michail, Paul G. Spirakis
How many cooks spoil the soup? Distributed Comput. 31 (6) (2018)
Othon Michail, Paul G. Spirakis, Michail Theofilatos
Fast Approximate Counting and Leader Election in Populations. CoRR (2018)
Othon Michail
Terminating distributed construction of shapes and patterns in a fair solution of automata. Distributed Comput. 31 (5) (2018)
Othon Michail, Paul G. Spirakis
Elements of the theory of dynamic networks. Commun. ACM 61 (2) (2018)
Othon Michail, George Skretas, Paul G. Spirakis
On the Transformation Capability of Feasible Mechanisms for Programmable Matter. ICALP (2017)
Othon Michail, Paul G. Spirakis
Connectivity preserving network transformers. Theor. Comput. Sci. 671 (2017)
Othon Michail, George Skretas, Paul G. Spirakis
On the Transformation Capability of Feasible Mechanisms for Programmable Matter. CoRR (2017)
Othon Michail, Paul G. Spirakis
Network Constructors: A Model for Programmable Matter. SOFSEM (2017)
Othon Michail, Paul G. Spirakis
How Many Cooks Spoil the Soup? SIROCCO (2016)
Othon Michail
An Introduction to Temporal Graphs: An Algorithmic Perspective. Internet Math. 12 (4) (2016)
Othon Michail, Paul G. Spirakis
How Many Cooks Spoil the Soup? CoRR (2016)
Othon Michail, Paul G. Spirakis
Traveling salesman problems in temporal graphs. Theor. Comput. Sci. 634 (2016)
Othon Michail, Paul G. Spirakis
Simple and efficient local codes for distributed stable network construction. Distributed Comput. 29 (3) (2016)
Othon Michail, Paul G. Spirakis
Terminating population protocols via some minimal global knowledge assumptions. J. Parallel Distributed Comput. (2015)
Dimitrios Amaxilatis, Marios Logaras, Othon Michail, Paul G. Spirakis
NETCS: A New Simulator of Population Protocols and Network Constructors. CoRR (2015)
Othon Michail
Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata. PODC (2015)
Othon Michail, Paul G. Spirakis
Connectivity Preserving Network Transformers. CoRR (2015)
Othon Michail
An Introduction to Temporal Graphs: An Algorithmic Perspective. CoRR (2015)
Othon Michail
Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata. CoRR (2015)
Othon Michail
An Introduction to Temporal Graphs: An Algorithmic Perspective. Algorithms, Probability, Networks, and Games (2015)
George B. Mertzios, Othon Michail, Paul G. Spirakis
Temporal Network Optimization Subject to Connectivity Constraints. CoRR (2015)
Ioannis Chatzigiannakis, Dimitris Fotakis, Spyros C. Kontogiannis, Othon Michail, Sotiris E. Nikoletseas, Grammati E. Pantziou, Christos D. Zaroliagis
A Glimpse at Paul G. Spirakis. Algorithms, Probability, Networks, and Games (2015)
Othon Michail, Paul G. Spirakis
Simple and efficient local codes for distributed stable network construction. PODC (2014)
Othon Michail, Paul G. Spirakis
Traveling Salesman Problems in Temporal Graphs. MFCS (2) (2014)
Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis
Causality, influence, and computation in possibly disconnected synchronous dynamic networks. J. Parallel Distributed Comput. 74 (1) (2014)
Othon Michail, Paul G. Spirakis
Simple and Efficient Local Codes for Distributed Stable Network Construction. CoRR (2013)
George B. Mertzios, Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis
Temporal Network Optimization Subject to Connectivity Constraints. ICALP (2) (2013)
Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Paul G. Spirakis
The computational power of simple protocols for self-awareness on graphs. Theor. Comput. Sci. 512 (2013)
Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis
Naming and Counting in Anonymous Unknown Dynamic Networks. SSS (2013)
Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis
Causality, Influence, and Computation in Possibly Disconnected Synchronous Dynamic Networks. OPODIS (2012)
Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis
Brief Announcement: Naming and Counting in Anonymous Unknown Dynamic Networks. DISC (2012)
Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis
Terminating Population Protocols via Some Minimal Global Knowledge Assumptions. SSS (2012)
Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis
Naming and Counting in Anonymous Unknown Dynamic Networks CoRR (2012)
Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis
Causality, Influence, and Computation in Possibly Disconnected Dynamic Networks CoRR (2012)
Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis
Passively mobile communicating machines that use restricted space. Theor. Comput. Sci. 412 (46) (2011)
Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis
Passively mobile communicating machines that use restricted space. FOMC (2011)
Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis
Mediated population protocols. Theor. Comput. Sci. 412 (22) (2011)
Carme Àlvarez, Ioannis Chatzigiannakis, Amalia Duch, Joaquim Gabarró, Othon Michail, Maria J. Serna, Paul G. Spirakis
Computational models for networks of tiny artifacts: A survey. Comput. Sci. Rev. 5 (1) (2011)
Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Paul G. Spirakis
The Computational Power of Simple Protocols for Self-awareness on Graphs. SSS (2011)
Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis
) Are Stably Computable by the Mediated Population Protocol Model. MFCS (2010)
Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis
Algorithmic Verification of Population Protocols. SSS (2010)
Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis
Passively Mobile Communicating Logarithmic Space Machines CoRR (2010)
Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis
Passively Mobile Communicating Machines that Use Restricted Space CoRR (2010)
Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis
Stably Decidable Graph Languages by Mediated Population Protocols. SSS (2010)
Ioannis Chatzigiannakis, Shlomi Dolev, Sándor P. Fekete, Othon Michail, Paul G. Spirakis
On the Fairness of Probabilistic Schedulers for Population Protocols. Algorithmic Methods for Distributed Cooperative Systems (2009)
Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis
Mediated Population Protocols. ICALP (2) (2009)
Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis
Recent Advances in Population Protocols. MFCS (2009)
Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis
Brief Announcement: Decidable Graph Languages by Mediated Population Protocols. DISC (2009)
Ioannis Chatzigiannakis, Shlomi Dolev, Sándor P. Fekete, Othon Michail, Paul G. Spirakis
Not All Fair Probabilistic Schedulers Are Equivalent. OPODIS (2009)
Jim Prentzas, Ioannis Hatzilygeroudis, Othon Michail
Improving the Integration of Neuro-Symbolic Rules with Case-Based Reasoning. SETN (2008)