default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOthon Michail
Person information
- affiliation: University of Liverpool, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j29]George B. Mertzios, Othon Michail, George Skretas
, Paul G. Spirakis, Michail Theofilatos:
The complexity of growing a graph. J. Comput. Syst. Sci. 147: 103587 (2025)- [j28]Matthew Connor, Othon Michail:
Transformation of modular robots by rotation: 3 + 1 musketeers for all orthogonally convex shapes. J. Comput. Syst. Sci. 150: 103618 (2025) - 2024
- [j27]James Aspnes, Othon Michail:
Special Issue on the 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). J. Comput. Syst. Sci. 141: 103503 (2024) - [j26]Nada Almalki, Othon Michail:
On geometric shape construction via growth operations. Theor. Comput. Sci. 984: 114324 (2024) - [c40]Nada Almalki, Siddharth Gupta, Othon Michail:
On the Exponential Growth of Geometric Shapes. ALGOWIN 2024: 16-30 - [c39]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. ALGOWIN 2024: 76-90 - [c38]Matthew Connor, Othon Michail, George Skretas:
All for One and One for All: An O(1)-Musketeers Universal Transformation for Rotating Robots. SAND 2024: 9:1-9:20 - [c37]Nada Almalki, Siddharth Gupta, Othon Michail:
Brief Announcement: On the Exponential Growth of Geometric Shapes. SAND 2024: 23:1-23:6 - [c36]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: 26:1-26:5 - 2023
- [j25]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Fault tolerant network constructors. Inf. Comput. 292: 105037 (2023) - [j24]Abdullah Almethen, Othon Michail, Igor Potapov:
Distributed transformations of Hamiltonian shapes based on line moves. Theor. Comput. Sci. 942: 142-168 (2023) - [i28]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 abs/2305.01015 (2023) - [i27]Nada Almalki, Siddharth Gupta, Othon Michail:
Growing Fast without Colliding: Polylogarithmic Time Step Construction of Geometric Shapes. CoRR abs/2307.04385 (2023) - 2022
- [j23]Othon Michail, George Skretas, Paul G. Spirakis:
Distributed computation and reconfiguration in actively dynamic networks. Distributed Comput. 35(2): 185-206 (2022) - [j22]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Simple and fast approximate counting and leader election in populations. Inf. Comput. 285(Part): 104698 (2022) - [j21]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: 157-158 (2022) - [j20]Abdullah Almethen, Othon Michail, Igor Potapov:
On efficient connectivity-preserving transformations in a grid. Theor. Comput. Sci. 898: 132-148 (2022) - [j19]Matthew Connor, Othon Michail, Igor Potapov:
Centralised connectivity-preserving transformations for programmable matter: A minimal seed approach. Theor. Comput. Sci. 936: 77-91 (2022) - [c35]Nada Almalki, Othon Michail:
On Geometric Shape Construction via Growth Operations. ALGOSENSORS 2022: 1-17 - [c34]Matthew Connor, Othon Michail:
Centralised Connectivity-Preserving Transformations by Rotation: 3 Musketeers for All Orthogonal Convex Shapes. ALGOSENSORS 2022: 60-76 - [c33]George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos:
The Complexity of Growing a Graph. ALGOSENSORS 2022: 123-137 - [e2]James Aspnes, Othon Michail:
1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference. LIPIcs 221, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-224-2 [contents] - [i26]Matthew Connor, Othon Michail:
Centralised Connectivity-Preserving Transformations by Rotation: 3 Musketeers for all Orthogonal Convex Shapes. CoRR abs/2207.03062 (2022) - [i25]Nada Almalki, Othon Michail:
On Geometric Shape Construction via Growth Operations. CoRR abs/2207.03275 (2022) - 2021
- [j18]Matthew Connor, Othon Michail, Paul G. Spirakis:
On the Distributed Construction of Stable Networks in Polylogarithmic Parallel Time. Inf. 12(6): 254 (2021) - [j17]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Beyond Rings: Gathering in 1-Interval Connected Graphs. Parallel Process. Lett. 31(4): 2150020:1-2150020:31 (2021) - [c32]Abdullah Almethen, Othon Michail, Igor Potapov:
Distributed Transformations of Hamiltonian Shapes Based on Line Moves. ALGOSENSORS 2021: 1-16 - [c31]Matthew Connor, Othon Michail, Igor Potapov:
Centralised Connectivity-Preserving Transformations for Programmable Matter: A Minimal Seed Approach. ALGOSENSORS 2021: 45-60 - [e1]Gianlorenzo D'Angelo, Othon Michail:
Algorithmic Aspects of Cloud Computing - 6th International Symposium, ALGOCLOUD 2021, Lisbon, Portugal, September 6-7, 2021, Revised Selected Papers. Lecture Notes in Computer Science 13084, Springer 2021, ISBN 978-3-030-93042-4 [contents] - [i24]George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos:
The Complexity of Growing a Graph. CoRR abs/2107.14126 (2021) - [i23]Abdullah Almethen, Othon Michail, Igor Potapov:
Distributed Transformations of Hamiltonian Shapes based on Line Moves. CoRR abs/2108.08953 (2021) - [i22]Matthew Connor, Othon Michail, Igor Potapov:
Centralised Connectivity-Preserving Transformations for Programmable Matter: A Minimal Seed Approach. CoRR abs/2108.09250 (2021) - 2020
- [j16]Abdullah Almethen, Othon Michail, Igor Potapov:
Pushing lines helps: Efficient universal centralised transformations for programmable matter. Theor. Comput. Sci. 830-831: 43-59 (2020) - [c30]Abdullah Almethen, Othon Michail, Igor Potapov:
On Efficient Connectivity-Preserving Transformations in a Grid. ALGOSENSORS 2020: 76-91 - [c29]Othon Michail, George Skretas, Paul G. Spirakis:
Distributed Computation and Reconfiguration in Actively Dynamic Networks. PODC 2020: 448-457 - [i21]Othon Michail, George Skretas, Paul G. Spirakis:
Distributed Computation and Reconfiguration in Actively Dynamic Networks. CoRR abs/2003.03355 (2020) - [i20]Abdullah Almethen, Othon Michail, Igor Potapov:
On Efficient Connectivity-Preserving Transformations in a Grid. CoRR abs/2005.08351 (2020) - [i19]Matthew Connor, Othon Michail, Paul G. Spirakis:
On the Distributed Construction of Stable Networks in Polylogarithmic Parallel Time. CoRR abs/2007.00625 (2020) - [i18]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Gathering in 1-Interval Connected Graphs. CoRR abs/2008.07455 (2020)
2010 – 2019
- 2019
- [j15]George B. Mertzios, Othon Michail, Paul G. Spirakis:
Temporal Network Optimization Subject to Connectivity Constraints. Algorithmica 81(4): 1416-1449 (2019) - [j14]Othon Michail, George Skretas, Paul G. Spirakis:
On the transformation capability of feasible mechanisms for programmable matter. J. Comput. Syst. Sci. 102: 18-39 (2019) - [c28]Abdullah Almethen, Othon Michail, Igor Potapov:
Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable Matter. ALGOSENSORS 2019: 41-59 - [c27]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Fault Tolerant Network Constructors. SSS 2019: 243-255 - [i17]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Fault Tolerant Network Constructors. CoRR abs/1903.05992 (2019) - [i16]Abdullah Almethen, Othon Michail, Igor Potapov:
Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable Matter. CoRR abs/1904.12777 (2019) - 2018
- [j13]Othon Michail, Paul G. Spirakis:
Elements of the theory of dynamic networks. Commun. ACM 61(2): 72 (2018) - [j12]Othon Michail:
Terminating distributed construction of shapes and patterns in a fair solution of automata. Distributed Comput. 31(5): 343-365 (2018) - [j11]Othon Michail, Paul G. Spirakis:
How many cooks spoil the soup? Distributed Comput. 31(6): 455-469 (2018) - [c26]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Brief Announcement: Fast Approximate Counting and Leader Election in Populations. SIROCCO 2018: 38-42 - [c25]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Simple and Fast Approximate Counting and Leader Election in Populations. SSS 2018: 154-169 - [c24]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: 46:1-46:3 - [i15]David Doty, Mahsa Eftekhari, Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Exact size counting in uniform population protocols in nearly logarithmic time. CoRR abs/1805.04832 (2018) - [i14]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Fast Approximate Counting and Leader Election in Populations. CoRR abs/1806.02638 (2018) - 2017
- [j10]Othon Michail, Paul G. Spirakis:
Connectivity preserving network transformers. Theor. Comput. Sci. 671: 36-55 (2017) - [c23]Othon Michail, George Skretas, Paul G. Spirakis:
On the Transformation Capability of Feasible Mechanisms for Programmable Matter. ICALP 2017: 136:1-136:15 - [c22]Othon Michail, Paul G. Spirakis:
Network Constructors: A Model for Programmable Matter. SOFSEM 2017: 15-34 - [i13]Othon Michail, George Skretas, Paul G. Spirakis:
On the Transformation Capability of Feasible Mechanisms for Programmable Matter. CoRR abs/1703.04381 (2017) - 2016
- [j9]Othon Michail, Paul G. Spirakis:
Simple and efficient local codes for distributed stable network construction. Distributed Comput. 29(3): 207-237 (2016) - [j8]Othon Michail:
An Introduction to Temporal Graphs: An Algorithmic Perspective. Internet Math. 12(4): 239-280 (2016) - [j7]Othon Michail, Paul G. Spirakis:
Traveling salesman problems in temporal graphs. Theor. Comput. Sci. 634: 1-23 (2016) - [c21]Othon Michail, Paul G. Spirakis:
How Many Cooks Spoil the Soup? SIROCCO 2016: 3-18 - [i12]Othon Michail, Paul G. Spirakis:
How Many Cooks Spoil the Soup? CoRR abs/1604.07187 (2016) - 2015
- [j6]Othon Michail, Paul G. Spirakis:
Terminating population protocols via some minimal global knowledge assumptions. J. Parallel Distributed Comput. 81-82: 1-10 (2015) - [c20]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: 3-24 - [c19]Othon Michail:
An Introduction to Temporal Graphs: An Algorithmic Perspective. Algorithms, Probability, Networks, and Games 2015: 308-343 - [c18]Othon Michail:
Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata. PODC 2015: 37-46 - [i11]George B. Mertzios, Othon Michail, Paul G. Spirakis:
Temporal Network Optimization Subject to Connectivity Constraints. CoRR abs/1502.04382 (2015) - [i10]Othon Michail:
An Introduction to Temporal Graphs: An Algorithmic Perspective. CoRR abs/1503.00278 (2015) - [i9]Othon Michail:
Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata. CoRR abs/1503.01913 (2015) - [i8]Dimitrios Amaxilatis, Marios Logaras, Othon Michail, Paul G. Spirakis:
NETCS: A New Simulator of Population Protocols and Network Constructors. CoRR abs/1508.06731 (2015) - [i7]Othon Michail, Paul G. Spirakis:
Connectivity Preserving Network Transformers. CoRR abs/1512.02832 (2015) - 2014
- [j5]Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis:
Causality, influence, and computation in possibly disconnected synchronous dynamic networks. J. Parallel Distributed Comput. 74(1): 2016-2026 (2014) - [c17]Othon Michail, Paul G. Spirakis:
Traveling Salesman Problems in Temporal Graphs. MFCS (2) 2014: 553-564 - [c16]Othon Michail, Paul G. Spirakis:
Simple and efficient local codes for distributed stable network construction. PODC 2014: 76-85 - 2013
- [j4]Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Paul G. Spirakis:
The computational power of simple protocols for self-awareness on graphs. Theor. Comput. Sci. 512: 98-118 (2013) - [c15]George B. Mertzios, Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis:
Temporal Network Optimization Subject to Connectivity Constraints. ICALP (2) 2013: 657-668 - [c14]Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis:
Naming and Counting in Anonymous Unknown Dynamic Networks. SSS 2013: 281-295 - [i6]Othon Michail, Paul G. Spirakis:
Simple and Efficient Local Codes for Distributed Stable Network Construction. CoRR abs/1309.6978 (2013) - 2012
- [c13]Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis:
Causality, Influence, and Computation in Possibly Disconnected Synchronous Dynamic Networks. OPODIS 2012: 269-283 - [c12]Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis:
Terminating Population Protocols via Some Minimal Global Knowledge Assumptions. SSS 2012: 77-89 - [c11]Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis:
Brief Announcement: Naming and Counting in Anonymous Unknown Dynamic Networks. DISC 2012: 437-438 - [i5]Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis:
Causality, Influence, and Computation in Possibly Disconnected Dynamic Networks. CoRR abs/1206.1290 (2012) - [i4]Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis:
Naming and Counting in Anonymous Unknown Dynamic Networks. CoRR abs/1208.0180 (2012) - 2011
- [b2]Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis:
New Models for Population Protocols. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers 2011, ISBN 978-3-031-00876-4 - [j3]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): 7-25 (2011) - [j2]Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis:
Mediated population protocols. Theor. Comput. Sci. 412(22): 2434-2450 (2011) - [j1]Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis:
Passively mobile communicating machines that use restricted space. Theor. Comput. Sci. 412(46): 6469-6483 (2011) - [c10]Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis:
Passively mobile communicating machines that use restricted space. FOMC 2011: 6-15 - [c9]Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Paul G. Spirakis:
The Computational Power of Simple Protocols for Self-awareness on Graphs. SSS 2011: 135-147 - 2010
- [b1]Othon Michail:
Νέα μοντέλα για πρωτόκολλα πληθυσμών. University of Patras, Greece, 2010 - [c8]Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis:
All Symmetric Predicates in NSPACE(n2) Are Stably Computable by the Mediated Population Protocol Model. MFCS 2010: 270-281 - [c7]Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis:
Algorithmic Verification of Population Protocols. SSS 2010: 221-235 - [c6]Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis:
Stably Decidable Graph Languages by Mediated Population Protocols. SSS 2010: 252-266 - [i3]Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis:
Passively Mobile Communicating Logarithmic Space Machines. CoRR abs/1004.3395 (2010) - [i2]Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis:
Passively Mobile Communicating Machines that Use Restricted Space. CoRR abs/1012.2440 (2010)
2000 – 2009
- 2009
- [c5]Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis:
Mediated Population Protocols. ICALP (2) 2009: 363-374 - [c4]Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis:
Recent Advances in Population Protocols. MFCS 2009: 56-76 - [c3]Ioannis Chatzigiannakis, Shlomi Dolev, Sándor P. Fekete, Othon Michail, Paul G. Spirakis:
Not All Fair Probabilistic Schedulers Are Equivalent. OPODIS 2009: 33-47 - [c2]Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis:
Brief Announcement: Decidable Graph Languages by Mediated Population Protocols. DISC 2009: 239-240 - [i1]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 - 2008
- [c1]Jim Prentzas, Ioannis Hatzilygeroudis, Othon Michail:
Improving the Integration of Neuro-Symbolic Rules with Case-Based Reasoning. SETN 2008: 377-382
Coauthor Index
[j29] [j25] [j23] [j22] [c33] [j18] [j17] [i24] [c29] [i21] [i19] [i18] [j15] [j14] [c27] [i17] [j13] [j11] [c26] [c25] [c24] [i15] [i14] [j10] [c23] [c22] [i13] [j9] [j7] [c21] [i12] [j6] [i11] [i8] [i7] [j5] [c17] [c16] [j4] [c15] [c14] [i6] [c13] [c12] [c11] [i5] [i4] [b2] [j3] [j2] [j1] [c10] [c9] [c8] [c7] [c6] [i3] [i2] [c5] [c4] [c3] [c2] [i1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-26 23:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
