Photo of Dr Othon Michail

Dr Othon Michail

Lecturer Computer Science

    Publications

    2019

    On the Transformation Capability of Feasible Mechanisms for Programmable Matter (Journal article)

    Michail, O., Skretas, G., & Spirakis, P. G. (2019). On the Transformation Capability of Feasible Mechanisms for Programmable Matter. Journal of Computer and System Sciences.

    Temporal Network Optimization Subject to Connectivity Constraints (Journal article)

    Mertzios, G. B., Michail, O., & Spirakis, P. G. (2019). Temporal Network Optimization Subject to Connectivity Constraints. ALGORITHMICA, 81(4), 1416-1449. doi:10.1007/s00453-018-0478-6

    DOI: 10.1007/s00453-018-0478-6

    2018

    How many cooks spoil the soup? (Journal article)

    Michail, O., & Spirakis, P. G. (2018). How many cooks spoil the soup?. DISTRIBUTED COMPUTING, 31(6), 455-469. doi:10.1007/s00446-017-0317-z

    DOI: 10.1007/s00446-017-0317-z

    Simple and Fast Approximate Counting and Leader Election in Populations (Conference Paper)

    Michail, O., Spirakis, P. G., & Theofilatos, M. (2018). Simple and Fast Approximate Counting and Leader Election in Populations. In Springer LNCS. Tokyo, Japan..

    Brief announcement: Exact size counting in uniform population protocols in nearly logarithmic time (Conference Paper)

    Doty, D., Eftekhari, M., Michail, O., Spirakis, P. G., & Theofilatos, M. (2018). Brief announcement: Exact size counting in uniform population protocols in nearly logarithmic time. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 121. doi:10.4230/LIPIcs.DISC.2018.46

    DOI: 10.4230/LIPIcs.DISC.2018.46

    Fast Approximate Counting and Leader Election in Populations (Conference Paper)

    Michail, O., Spirakis, P. G., & Theofilatos, M. (n.d.). Fast Approximate Counting and Leader Election in Populations. Retrieved from http://arxiv.org/abs/1806.02638v1

    Exact size counting in uniform population protocols in nearly logarithmic time (Journal article)

    Doty, D., Eftekhari, M., Michail, O., Spirakis, P. G., & Theofilatos, M. (n.d.). Exact size counting in uniform population protocols in nearly logarithmic time. Retrieved from http://arxiv.org/abs/1805.04832v1

    Elements of the Theory of Dynamic Networks (Journal article)

    Michail, O., & Spirakis, P. G. (2018). Elements of the Theory of Dynamic Networks. COMMUNICATIONS OF THE ACM, 61(2), 72-81. doi:10.1145/3156693

    DOI: 10.1145/3156693

    Brief Announcement: Fast Approximate Counting and Leader Election in Populations (Conference Paper)

    Michail, O., Spirakis, P. G., & Theofilatos, M. (2018). Brief Announcement: Fast Approximate Counting and Leader Election in Populations. In Unknown Conference (pp. 38-42). Springer International Publishing. doi:10.1007/978-3-030-01325-7_7

    DOI: 10.1007/978-3-030-01325-7_7

    2017

    Terminating distributed construction of shapes and patterns in a fair solution of automata (Journal article)

    Michail, O. (2018). Terminating distributed construction of shapes and patterns in a fair solution of automata. Distributed Computing, 31(5), 343-365. doi:10.1007/s00446-017-0309-z

    DOI: 10.1007/s00446-017-0309-z

    Connectivity preserving network transformers (Journal article)

    Michail, O., & Spirakis, P. G. (2017). Connectivity preserving network transformers. THEORETICAL COMPUTER SCIENCE, 671, 36-55. doi:10.1016/j.tcs.2016.02.040

    DOI: 10.1016/j.tcs.2016.02.040

    On the Transformation Capability of Feasible Mechanisms for Programmable Matter (Conference Paper)

    Michail, O., Skretas, G., & Spirakis, P. G. (n.d.). On the Transformation Capability of Feasible Mechanisms for Programmable Matter. Retrieved from http://arxiv.org/abs/1703.04381v1

    Network Constructors: A Model for Programmable Matter (Conference Paper)

    Michail, O., & Spirakis, P. G. (2017). Network Constructors: A Model for Programmable Matter. In SOFSEM 2017: THEORY AND PRACTICE OF COMPUTER SCIENCE Vol. 10139 (pp. 15-34). doi:10.1007/978-3-319-51963-0_3

    DOI: 10.1007/978-3-319-51963-0_3

    2016

    Connectivity Preserving Network Transformers (Conference Paper)

    Michail, O., & Spirakis. (n.d.). Connectivity Preserving Network Transformers. In Emergence, Complexity and Computation Vol. 24 (pp. 337-359).

    How Many Cooks Spoil the Soup? (Conference Paper)

    Michail, O., & Spirakis, P. G. (2016). How Many Cooks Spoil the Soup ?. In Lecture Notes in Computer Science Vol. 9988 (pp. 1-16). Helsinki , Finland: Springer Verlag (Germany).

    DOI: 10.1007/978-3-319-48314-6_1

    An Introduction to Temporal Graphs: An Algorithmic Perspective (Journal article)

    Michail, O. (n.d.). An Introduction to Temporal Graphs: An Algorithmic Perspective. Retrieved from http://arxiv.org/abs/1503.00278v1

    Simple and efficient local codes for distributed stable network construction (Journal article)

    Michail, O., & Spirakis, P. G. (2016). Simple and efficient local codes for distributed stable network construction. DISTRIBUTED COMPUTING, 29(3), 207-237. doi:10.1007/s00446-015-0257-4

    DOI: 10.1007/s00446-015-0257-4

    Traveling Salesman Problems in Temporal Graphs (Journal article)

    Spirakis, P. G., & Michail, O. (n.d.). Traveling Salesman Problems in Temporal Graphs. Theoretical Computer Science.

    2015

    Simple and efficient local codes for distributed stable network construction (Journal article)

    Michail, O., & Spirakis, P. G. (2016). Simple and efficient local codes for distributed stable network construction. Distributed Computing, 29(3), 207-237. doi:10.1007/s00446-015-0257-4

    DOI: 10.1007/s00446-015-0257-4

    NETCS: A New Simulator of Population Protocols and Network Constructors (Journal article)

    Amaxilatis, D., Logaras, M., Michail, O., & Spirakis, P. G. (n.d.). NETCS: A New Simulator of Population Protocols and Network Constructors. Retrieved from http://arxiv.org/abs/1508.06731v1

    Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata (Conference Paper)

    Michail, O. (n.d.). Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata. Retrieved from http://arxiv.org/abs/1503.01913v1

    A Glimpse at Paul G. Spirakis (Conference Paper)

    Chatzigiannakis, I., Fotakis, D., Kontogiannis, S., Michail, O., Nikoletseas, S., Pantziou, G., & Zaroliagis, C. (2015). A Glimpse at Paul G. Spirakis. In Unknown Conference (pp. 3-24). Springer International Publishing. doi:10.1007/978-3-319-24024-4_1

    DOI: 10.1007/978-3-319-24024-4_1

    An Introduction to Temporal Graphs: An Algorithmic Perspective (Conference Paper)

    Michail, O. (2015). An Introduction to Temporal Graphs: An Algorithmic Perspective. In Unknown Conference (pp. 308-343). Springer International Publishing. doi:10.1007/978-3-319-24024-4_18

    DOI: 10.1007/978-3-319-24024-4_18

    Terminating population protocols via some minimal global knowledge assumptions (Journal article)

    Michail, O., & Spirakis, P. G. (2015). Terminating population protocols via some minimal global knowledge assumptions. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 81-82, 1-10. doi:10.1016/j.jpdc.2015.02.005

    DOI: 10.1016/j.jpdc.2015.02.005

    2014

    Traveling Salesman Problems in Temporal Graphs (Conference Paper)

    Michail, O., & Spirakis, P. G. (2014). Traveling Salesman Problems in Temporal Graphs. In MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE, PT II Vol. 8635 (pp. 553-564). Retrieved from http://gateway.webofknowledge.com/

    Simple and efficient local codes for distributed stable network construction (Conference Paper)

    Michail, O., & Spirakis, P. G. (n.d.). Simple and Efficient Local Codes for Distributed Stable Network Construction. Retrieved from http://arxiv.org/abs/1309.6978v2

    DOI: 10.1145/2611462.2611466

    Causality, influence, and computation in possibly disconnected synchronous dynamic networks (Journal article)

    Michail, O., Chatzigiannakis, I., & Spirakis, P. G. (2014). Causality, influence, and computation in possibly disconnected synchronous dynamic networks. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 74(1), 2016-2026. doi:10.1016/j.jpdc.2013.07.007

    DOI: 10.1016/j.jpdc.2013.07.007

    2013

    Naming and Counting in Anonymous Unknown Dynamic Networks (Conference Paper)

    Michail, O., Chatzigiannakis, I., & Spirakis, P. G. (2013). Naming and Counting in Anonymous Unknown Dynamic Networks. In STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2013 Vol. 8255 (pp. 281-295). Retrieved from http://gateway.webofknowledge.com/

    The computational power of simple protocols for self-awareness on graphs (Journal article)

    Chatzigiannakis, I., Michail, O., Nikolaou, S., & Spirakis, P. G. (2013). The computational power of simple protocols for self-awareness on graphs. THEORETICAL COMPUTER SCIENCE, 512, 98-118. doi:10.1016/j.tcs.2012.08.026

    DOI: 10.1016/j.tcs.2012.08.026

    Temporal Network Optimization Subject to Connectivity Constraints (Conference Paper)

    Mertzios, G. B., Michail, O., Chatzigiannakis, I., & Spirakis, P. G. (2013). Temporal Network Optimization Subject to Connectivity Constraints. In AUTOMATA, LANGUAGES, AND PROGRAMMING, PT II Vol. 7966 (pp. 657-668). Retrieved from http://gateway.webofknowledge.com/

    Strong Bounds for Evolution in Networks (Conference Paper)

    Mertzios, G. B., & Spirakis, P. G. (2013). Strong Bounds for Evolution in Networks. In AUTOMATA, LANGUAGES, AND PROGRAMMING, PT II Vol. 7966 (pp. 669-680). Retrieved from http://gateway.webofknowledge.com/

    2012

    Causality, Influence, and Computation in Possibly Disconnected Synchronous Dynamic Networks (Conference Paper)

    Michail, O., Chatzigiannakis, I., & Spirakis, P. G. (2012). Causality, Influence, and Computation in Possibly Disconnected Synchronous Dynamic Networks. In Unknown Conference (pp. 269-283). Springer Berlin Heidelberg. doi:10.1007/978-3-642-35476-2_19

    DOI: 10.1007/978-3-642-35476-2_19

    Brief Announcement: Naming and Counting in Anonymous Unknown Dynamic Networks (Conference Paper)

    Michail, O., Chatzigiannakis, I., & Spirakis, P. G. (2012). Brief Announcement: Naming and Counting in Anonymous Unknown Dynamic Networks. In DISTRIBUTED COMPUTING, DISC 2012 Vol. 7611 (pp. 437-438). Retrieved from http://gateway.webofknowledge.com/

    Terminating Population Protocols via Some Minimal Global Knowledge Assumptions (Conference Paper)

    Michail, O., Chatzigiannakis, I., & Spirakis, P. G. (2012). Terminating Population Protocols via Some Minimal Global Knowledge Assumptions. In Unknown Conference (pp. 77-89). Springer Berlin Heidelberg. doi:10.1007/978-3-642-33536-5_8

    DOI: 10.1007/978-3-642-33536-5_8

    2011

    The Computational Power of Simple Protocols for Self-awareness on Graphs (Conference Paper)

    Chatzigiannakis, I., Michail, O., Nikolaou, S., & Spirakis, P. G. (2011). The Computational Power of Simple Protocols for Self-awareness on Graphs. In STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS Vol. 6976 (pp. 135-147). Retrieved from http://gateway.webofknowledge.com/

    Passively mobile communicating machines that use restricted space (Journal article)

    Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A., & Spirakis, P. G. (2011). Passively mobile communicating machines that use restricted space. THEORETICAL COMPUTER SCIENCE, 412(46), 6469-6483. doi:10.1016/j.tcs.2011.07.001

    DOI: 10.1016/j.tcs.2011.07.001

    Passively mobile communicating machines that use restricted space (Conference Paper)

    Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A., & Spirakis, P. G. (2011). Passively mobile communicating machines that use restricted space. In Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing - FOMC '11. ACM Press. doi:10.1145/1998476.1998480

    DOI: 10.1145/1998476.1998480

    Mediated population protocols (Journal article)

    Michail, O., Chatzigiannakis, I., & Spirakis, P. G. (2011). Mediated population protocols. THEORETICAL COMPUTER SCIENCE, 412(22), 2434-2450. doi:10.1016/j.tcs.2011.02.003

    DOI: 10.1016/j.tcs.2011.02.003

    Computational models for networks of tiny artifacts: A survey (Journal article)

    Àlvarez, C., Chatzigiannakis, I., Duch, A., Gabarró, J., Michail, O., Serna, M., & Spirakis, P. G. (2011). Computational models for networks of tiny artifacts: A survey. Computer Science Review, 5(1), 7-25. doi:10.1016/j.cosrev.2010.09.001

    DOI: 10.1016/j.cosrev.2010.09.001

    New Models for Population Protocols (Book)

    Michail, O., Chatzigiannakis, I., & Spirakis, P. G. (2011). New Models for Population Protocols (Vol. 2). Morgan & Claypool Publishers LLC. doi:10.2200/s00328ed1v01y201101dct006

    DOI: 10.2200/s00328ed1v01y201101dct006

    2010

    All Symmetric Predicates in NSPACE(n(2)) Are Stably Computable by the Mediated Population Protocol Model (Conference Paper)

    Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A., & Spirakis, P. G. (2010). All Symmetric Predicates in NSPACE(n(2)) Are Stably Computable by the Mediated Population Protocol Model. In MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2010 Vol. 6281 (pp. 270-+). Retrieved from http://gateway.webofknowledge.com/

    Algorithmic Verification of Population Protocols (Conference Paper)

    Chatzigiannakis, I., Michail, O., & Spirakis, P. G. (2010). Algorithmic Verification of Population Protocols. In STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS Vol. 6366 (pp. 221-235). Retrieved from http://gateway.webofknowledge.com/

    Stably Decidable Graph Languages by Mediated Population Protocols (Conference Paper)

    Chatzigiannakis, I., Michail, O., & Spirakis, P. G. (2010). Stably Decidable Graph Languages by Mediated Population Protocols. In STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS Vol. 6366 (pp. 252-266). Retrieved from http://gateway.webofknowledge.com/

    Passively Mobile Communicating Logarithmic Space Machines (Journal article)

    Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A., & Spirakis, P. G. (n.d.). Passively Mobile Communicating Logarithmic Space Machines. Retrieved from http://arxiv.org/abs/1004.3395v1

    2009

    Not All Fair Probabilistic Schedulers Are Equivalent (Conference Paper)

    Chatzigiannakis, I., Dolev, S., Fekete, S. P., Michail, O., & Spirakis, P. C. (2009). Not All Fair Probabilistic Schedulers Are Equivalent. In PRINCIPLES OF DISTRIBUTED SYSTEMS, PROCEEDINGS Vol. 5923 (pp. 33-+). Retrieved from http://gateway.webofknowledge.com/

    Mediated Population Protocols (Conference Paper)

    Chatzigiannakis, I., Michail, O., & Spirakis, P. G. (2009). Mediated Population Protocols. In AUTOMATA, LANGUAGES AND PROGRAMMING, PT II, PROCEEDINGS Vol. 5556 (pp. 363-+). Retrieved from http://gateway.webofknowledge.com/

    Recent Advances in Population Protocols (Conference Paper)

    Chatzigiannakis, I., Michail, O., & Spirakis, P. G. (2009). Recent Advances in Population Protocols. In MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2009 Vol. 5734 (pp. 56-76). Retrieved from http://gateway.webofknowledge.com/

    2008

    Improving the accuracy of neuro-symbolic rules with case-based reasoning (Conference Paper)

    Prentzas, J., Hatzilygeroudis, I., & Michail, O. (2008). Improving the accuracy of neuro-symbolic rules with case-based reasoning. In CEUR Workshop Proceedings Vol. 375 (pp. 49-54).

    Improving the Integration of Neuro-Symbolic Rules with Case-Based Reasoning (Conference Paper)

    Prentzas, J., Hatzilygeroudis, I., & Michail, O. (2008). Improving the Integration of Neuro-Symbolic Rules with Case-Based Reasoning. In ARTIFICIAL INTELLIGENCE: THEORIES, MODELS AND APPLICATIONS, SETN 2008 Vol. 5138 (pp. 377-382). Retrieved from http://gateway.webofknowledge.com/