Othon Michail - RankMe

111 papers A* 4A 4B 7C 15Journal 62Unranked 14

Year	Rank	Type	Title / Venue / Authors
2026	—	`ed.`	Algorithmics of Wireless Networks - 21st International Symposium, ALGOWIN 2025, Warsaw, Poland, September 18-19, 2025, Proceedings ALGOWIN Othon Michail, Giuseppe Prencipe
2026	J	`jnl`	Sublinear-Time Reconfiguration of Programmable Matter with Joint Movements. CoRR Manish Kumar, Othon Michail, Andreas Padalkin, Christian Scheideler
2025	J	`jnl`	All for one and one for all: An O(1)-musketeers generic transformation for rotating robots. Theor. Comput. Sci. Matthew Connor, Othon Michail, George Skretas
2025	—	`conf`	Brief Announcement: Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits. SAND Nada Almalki, Siddharth Gupta, Othon Michail, Andreas Padalkin
2025	C	`conf`	Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits. SSS Nada Almalki, Siddharth Gupta, Othon Michail, Andreas Padalkin
2025	J	`jnl`	Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits. CoRR Nada Almalki, Siddharth Gupta, Othon Michail, Andreas Padalkin
2025	J	`jnl`	Fair Minimum Labeling: Efficient Temporal Network Activations for Reachability and Equity. CoRR Lutz Oettershagen, Othon Michail
2025	J	`jnl`	On the exponential growth of geometric shapes. Theor. Comput. Sci. Nada Almalki, Siddharth Gupta, Othon Michail
2025	A	`conf`	Recognizing and Realizing Temporal Reachability Graphs. ESA Thomas Erlebach, Othon Michail, Nils Morawietz
2025	J	`jnl`	Recognizing and Realizing Temporal Reachability Graphs. CoRR Thomas Erlebach, Othon Michail, Nils Morawietz
2025	J	`jnl`	The complexity of growing a graph. J. Comput. Syst. Sci. George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos
2025	J	`jnl`	Transformation of modular robots by rotation: 3 + 1 musketeers for all orthogonally convex shapes. J. Comput. Syst. Sci. Matthew Connor, Othon Michail
2024	—	`conf`	All for One and One for All: An O(1)-Musketeers Universal Transformation for Rotating Robots. SAND Matthew Connor, Othon Michail, George Skretas
2024	—	`conf`	Brief Announcement: Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid Them. SAND Siddharth Gupta, Marc J. van Kreveld, Othon Michail, Andreas Padalkin
2024	—	`conf`	Brief Announcement: On the Exponential Growth of Geometric Shapes. SAND Nada Almalki, Siddharth Gupta, Othon Michail
2024	—	`conf`	Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid Them. ALGOWIN Siddharth Gupta, Marc J. van Kreveld, Othon Michail, Andreas Padalkin
2024	J	`jnl`	On geometric shape construction via growth operations. Theor. Comput. Sci. Nada Almalki, Othon Michail
2024	—	`conf`	On the Exponential Growth of Geometric Shapes. ALGOWIN Nada Almalki, Siddharth Gupta, Othon Michail
2024	J	`jnl`	Special Issue on the 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). J. Comput. Syst. Sci. James Aspnes, Othon Michail
2023	J	`jnl`	Collision Detection for Modular Robots - it is easy to cause collisions and hard to avoid them. CoRR Siddharth Gupta, Marc J. van Kreveld, Othon Michail, Andreas Padalkin
2023	J	`jnl`	Distributed transformations of Hamiltonian shapes based on line moves. Theor. Comput. Sci. Abdullah Almethen, Othon Michail, Igor Potapov
2023	J	`jnl`	Fault tolerant network constructors. Inf. Comput. Othon Michail, Paul G. Spirakis, Michail Theofilatos
2023	J	`jnl`	Growing Fast without Colliding: Polylogarithmic Time Step Construction of Geometric Shapes. CoRR Nada Almalki, Siddharth Gupta, Othon Michail
2022	—	`ed.`	1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, Virtual Conference, March 28-30, 2022 SAND James Aspnes, Othon Michail
2022	C	`conf`	Centralised Connectivity-Preserving Transformations by Rotation: 3 Musketeers for All Orthogonal Convex Shapes. ALGOSENSORS Matthew Connor, Othon Michail
2022	J	`jnl`	Centralised Connectivity-Preserving Transformations by Rotation: 3 Musketeers for all Orthogonal Convex Shapes. CoRR Matthew Connor, Othon Michail
2022	J	`jnl`	Centralised connectivity-preserving transformations for programmable matter: A minimal seed approach. Theor. Comput. Sci. Matthew Connor, Othon Michail, Igor Potapov
2022	J	`jnl`	Distributed computation and reconfiguration in actively dynamic networks. Distributed Comput. Othon Michail, George Skretas, Paul G. Spirakis
2022	C	`conf`	On Geometric Shape Construction via Growth Operations. ALGOSENSORS Nada Almalki, Othon Michail
2022	J	`jnl`	On Geometric Shape Construction via Growth Operations. CoRR Nada Almalki, Othon Michail
2022	J	`jnl`	On efficient connectivity-preserving transformations in a grid. Theor. Comput. Sci. Abdullah Almethen, Othon Michail, Igor Potapov
2022	J	`jnl`	Simple and fast approximate counting and leader election in populations. Inf. Comput. Othon Michail, Paul G. Spirakis, Michail Theofilatos
2022	J	`jnl`	Special issue on Algorithmic Theory of Dynamic Networks and Its Applications - Preface. J. Comput. Syst. Sci. Silvia Bonomi, Giuseppe Antonio Di Luna, Othon Michail, Leonardo Querzoni
2022	C	`conf`	The Complexity of Growing a Graph. ALGOSENSORS George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos
2021	—	`ed.`	Algorithmic Aspects of Cloud Computing - 6th International Symposium, ALGOCLOUD 2021, Lisbon, Portugal, September 6-7, 2021, Revised Selected Papers ALGOCLOUD Gianlorenzo D'Angelo, Othon Michail
2021	J	`jnl`	Beyond Rings: Gathering in 1-Interval Connected Graphs. Parallel Process. Lett. Othon Michail, Paul G. Spirakis, Michail Theofilatos
2021	C	`conf`	Centralised Connectivity-Preserving Transformations for Programmable Matter: A Minimal Seed Approach. ALGOSENSORS Matthew Connor, Othon Michail, Igor Potapov
2021	J	`jnl`	Centralised Connectivity-Preserving Transformations for Programmable Matter: A Minimal Seed Approach. CoRR Matthew Connor, Othon Michail, Igor Potapov
2021	C	`conf`	Distributed Transformations of Hamiltonian Shapes Based on Line Moves. ALGOSENSORS Abdullah Almethen, Othon Michail, Igor Potapov
2021	J	`jnl`	Distributed Transformations of Hamiltonian Shapes based on Line Moves. CoRR Abdullah Almethen, Othon Michail, Igor Potapov
2021	J	`jnl`	On the Distributed Construction of Stable Networks in Polylogarithmic Parallel Time. Inf. Matthew Connor, Othon Michail, Paul G. Spirakis
2021	J	`jnl`	The Complexity of Growing a Graph. CoRR George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos
2020	A*	`conf`	Distributed Computation and Reconfiguration in Actively Dynamic Networks. PODC Othon Michail, George Skretas, Paul G. Spirakis
2020	J	`jnl`	Distributed Computation and Reconfiguration in Actively Dynamic Networks. CoRR Othon Michail, George Skretas, Paul G. Spirakis
2020	J	`jnl`	Gathering in 1-Interval Connected Graphs. CoRR Othon Michail, Paul G. Spirakis, Michail Theofilatos
2020	C	`conf`	On Efficient Connectivity-Preserving Transformations in a Grid. ALGOSENSORS Abdullah Almethen, Othon Michail, Igor Potapov
2020	J	`jnl`	On Efficient Connectivity-Preserving Transformations in a Grid. CoRR Abdullah Almethen, Othon Michail, Igor Potapov
2020	J	`jnl`	On the Distributed Construction of Stable Networks in Polylogarithmic Parallel Time. CoRR Matthew Connor, Othon Michail, Paul G. Spirakis
2020	J	`jnl`	Pushing lines helps: Efficient universal centralised transformations for programmable matter. Theor. Comput. Sci. Abdullah Almethen, Othon Michail, Igor Potapov
2019	C	`conf`	Fault Tolerant Network Constructors. SSS Othon Michail, Paul G. Spirakis, Michail Theofilatos
2019	J	`jnl`	Fault Tolerant Network Constructors. CoRR Othon Michail, Paul G. Spirakis, Michail Theofilatos
2019	J	`jnl`	On the transformation capability of feasible mechanisms for programmable matter. J. Comput. Syst. Sci. Othon Michail, George Skretas, Paul G. Spirakis
2019	C	`conf`	Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable Matter. ALGOSENSORS Abdullah Almethen, Othon Michail, Igor Potapov
2019	J	`jnl`	Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable Matter. CoRR Abdullah Almethen, Othon Michail, Igor Potapov
2019	J	`jnl`	Temporal Network Optimization Subject to Connectivity Constraints. Algorithmica George B. Mertzios, Othon Michail, Paul G. Spirakis
2018	A	`conf`	Brief Announcement: Exact Size Counting in Uniform Population Protocols in Nearly Logarithmic Time. DISC David Doty, Mahsa Eftekhari, Othon Michail, Paul G. Spirakis, Michail Theofilatos
2018	B	`conf`	Brief Announcement: Fast Approximate Counting and Leader Election in Populations. SIROCCO Othon Michail, Paul G. Spirakis, Michail Theofilatos
2018	J	`jnl`	Elements of the theory of dynamic networks. Commun. ACM Othon Michail, Paul G. Spirakis
2018	J	`jnl`	Exact size counting in uniform population protocols in nearly logarithmic time. CoRR David Doty, Mahsa Eftekhari, Othon Michail, Paul G. Spirakis, Michail Theofilatos
2018	J	`jnl`	Fast Approximate Counting and Leader Election in Populations. CoRR Othon Michail, Paul G. Spirakis, Michail Theofilatos
2018	J	`jnl`	How many cooks spoil the soup? Distributed Comput. Othon Michail, Paul G. Spirakis
2018	C	`conf`	Simple and Fast Approximate Counting and Leader Election in Populations. SSS Othon Michail, Paul G. Spirakis, Michail Theofilatos
2018	J	`jnl`	Terminating distributed construction of shapes and patterns in a fair solution of automata. Distributed Comput. Othon Michail
2017	J	`jnl`	Connectivity preserving network transformers. Theor. Comput. Sci. Othon Michail, Paul G. Spirakis
2017	B	`conf`	Network Constructors: A Model for Programmable Matter. SOFSEM Othon Michail, Paul G. Spirakis
2017	A*	`conf`	On the Transformation Capability of Feasible Mechanisms for Programmable Matter. ICALP Othon Michail, George Skretas, Paul G. Spirakis
2017	J	`jnl`	On the Transformation Capability of Feasible Mechanisms for Programmable Matter. CoRR Othon Michail, George Skretas, Paul G. Spirakis
2016	J	`jnl`	An Introduction to Temporal Graphs: An Algorithmic Perspective. Internet Math. Othon Michail
2016	B	`conf`	How Many Cooks Spoil the Soup? SIROCCO Othon Michail, Paul G. Spirakis
2016	J	`jnl`	How Many Cooks Spoil the Soup? CoRR Othon Michail, Paul G. Spirakis
2016	J	`jnl`	Simple and efficient local codes for distributed stable network construction. Distributed Comput. Othon Michail, Paul G. Spirakis
2016	J	`jnl`	Traveling salesman problems in temporal graphs. Theor. Comput. Sci. Othon Michail, Paul G. Spirakis
2015	—	`conf`	A Glimpse at Paul G. Spirakis. Algorithms, Probability, Networks, and Games Ioannis Chatzigiannakis, Dimitris Fotakis, Spyros C. Kontogiannis, Othon Michail, Sotiris E. Nikoletseas, Grammati E. Pantziou, Christos D. Zaroliagis
2015	—	`conf`	An Introduction to Temporal Graphs: An Algorithmic Perspective. Algorithms, Probability, Networks, and Games Othon Michail
2015	J	`jnl`	An Introduction to Temporal Graphs: An Algorithmic Perspective. CoRR Othon Michail
2015	J	`jnl`	Connectivity Preserving Network Transformers. CoRR Othon Michail, Paul G. Spirakis
2015	J	`jnl`	NETCS: A New Simulator of Population Protocols and Network Constructors. CoRR Dimitrios Amaxilatis, Marios Logaras, Othon Michail, Paul G. Spirakis
2015	J	`jnl`	Temporal Network Optimization Subject to Connectivity Constraints. CoRR George B. Mertzios, Othon Michail, Paul G. Spirakis
2015	A*	`conf`	Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata. PODC Othon Michail
2015	J	`jnl`	Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata. CoRR Othon Michail
2015	J	`jnl`	Terminating population protocols via some minimal global knowledge assumptions. J. Parallel Distributed Comput. Othon Michail, Paul G. Spirakis
2014	J	`jnl`	Causality, influence, and computation in possibly disconnected synchronous dynamic networks. J. Parallel Distributed Comput. Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis
2014	A*	`conf`	Simple and efficient local codes for distributed stable network construction. PODC Othon Michail, Paul G. Spirakis
2014	—	`conf`	Traveling Salesman Problems in Temporal Graphs. MFCS (2) Othon Michail, Paul G. Spirakis
2013	C	`conf`	Naming and Counting in Anonymous Unknown Dynamic Networks. SSS Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis
2013	J	`jnl`	Simple and Efficient Local Codes for Distributed Stable Network Construction. CoRR Othon Michail, Paul G. Spirakis
2013	—	`conf`	Temporal Network Optimization Subject to Connectivity Constraints. ICALP (2) George B. Mertzios, Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis
2013	J	`jnl`	The computational power of simple protocols for self-awareness on graphs. Theor. Comput. Sci. Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Paul G. Spirakis
2012	A	`conf`	Brief Announcement: Naming and Counting in Anonymous Unknown Dynamic Networks. DISC Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis
2012	J	`jnl`	Causality, Influence, and Computation in Possibly Disconnected Dynamic Networks CoRR Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis
2012	B	`conf`	Causality, Influence, and Computation in Possibly Disconnected Synchronous Dynamic Networks. OPODIS Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis
2012	J	`jnl`	Naming and Counting in Anonymous Unknown Dynamic Networks CoRR Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis
2012	C	`conf`	Terminating Population Protocols via Some Minimal Global Knowledge Assumptions. SSS Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis
2011	J	`jnl`	Computational models for networks of tiny artifacts: A survey. Comput. Sci. Rev. Carme Àlvarez, Ioannis Chatzigiannakis, Amalia Duch, Joaquim Gabarró, Othon Michail, Maria J. Serna, Paul G. Spirakis
2011	J	`jnl`	Mediated population protocols. Theor. Comput. Sci. Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis
2011	—	`book`	New Models for Population Protocols Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis
2011	—	`conf`	Passively mobile communicating machines that use restricted space. FOMC Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis
2011	J	`jnl`	Passively mobile communicating machines that use restricted space. Theor. Comput. Sci. Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis
2011	C	`conf`	The Computational Power of Simple Protocols for Self-awareness on Graphs. SSS Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Paul G. Spirakis
2010	C	`conf`	Algorithmic Verification of Population Protocols. SSS Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis
2010	B	`conf`	All Symmetric Predicates in MFCS Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis
2010	J	`jnl`	Passively Mobile Communicating Logarithmic Space Machines CoRR Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis
2010	J	`jnl`	Passively Mobile Communicating Machines that Use Restricted Space CoRR Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis
2010	C	`conf`	Stably Decidable Graph Languages by Mediated Population Protocols. SSS Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis
2010	—	`—`	Νέα μοντέλα για πρωτόκολλα πληθυσμών Othon Michail
2009	A	`conf`	Brief Announcement: Decidable Graph Languages by Mediated Population Protocols. DISC Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis
2009	—	`conf`	Mediated Population Protocols. ICALP (2) Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis
2009	B	`conf`	Not All Fair Probabilistic Schedulers Are Equivalent. OPODIS Ioannis Chatzigiannakis, Shlomi Dolev, Sándor P. Fekete, Othon Michail, Paul G. Spirakis
2009	—	`conf`	On the Fairness of Probabilistic Schedulers for Population Protocols. Algorithmic Methods for Distributed Cooperative Systems Ioannis Chatzigiannakis, Shlomi Dolev, Sándor P. Fekete, Othon Michail, Paul G. Spirakis
2009	B	`conf`	Recent Advances in Population Protocols. MFCS Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis
2008	—	`conf`	Improving the Integration of Neuro-Symbolic Rules with Case-Based Reasoning. SETN Jim Prentzas, Ioannis Hatzilygeroudis, Othon Michail