Publications
2025
Transformation of Modular Robots by Rotation: 3+1 Musketeers for all Orthogonally Convex Shapes
Connor, M., & Michail, O. (n.d.). Transformation of Modular Robots by Rotation: 3+1 Musketeers for all Orthogonally Convex Shapes. Journal of Computer and System Sciences. doi:10.1016/j.jcss.2024.103618
The complexity of growing a graph
Mertzios, G., Michail, O., Skretas, G., Spirakis, P. G., & Theofilatos, M. (2025). The complexity of growing a graph. Journal of Computer and System Sciences, 147, 103587. doi:10.1016/j.jcss.2024.103587
Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid Them
Gupta, S., van Kreveld, M., Michail, O., & Padalkin, A. (2025). Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid Them. In Unknown Conference (pp. 76-90). Springer Nature Switzerland. doi:10.1007/978-3-031-74580-5_6
On the Exponential Growth of Geometric Shapes
Almalki, N., Gupta, S., & Michail, O. (2025). On the Exponential Growth of Geometric Shapes. In Unknown Conference (pp. 16-30). Springer Nature Switzerland. doi:10.1007/978-3-031-74580-5_2
2024
All for One and One for All: An O(1)-Musketeers Universal Transformation for Rotating Robots
Connor, M., Michail, O., & Skretas, G. (2024). All for One and One for All: An O(1)-Musketeers Universal Transformation for Rotating Robots. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 292. doi:10.4230/LIPIcs.SAND.2024.9
Brief Announcement: Collision Detection for Modular Robots – It Is Easy to Cause Collisions and Hard to Avoid Them
Gupta, S., van Kreveld, M., Michail, O., & Padalkin, A. (2024). Brief Announcement: Collision Detection for Modular Robots – It Is Easy to Cause Collisions and Hard to Avoid Them. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 292. doi:10.4230/LIPIcs.SAND.2024.26
Brief Announcement: On the Exponential Growth of Geometric Shapes
Almalki, N., Gupta, S., & Michail, O. (2024). Brief Announcement: On the Exponential Growth of Geometric Shapes. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 292. doi:10.4230/LIPIcs.SAND.2024.23
Special Issue on the 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)
Aspnes, J., & Michail, O. (2024). Special Issue on the 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). Journal of Computer and System Sciences, 141, 103503. doi:10.1016/j.jcss.2023.103503
On geometric shape construction via growth operations
Almalki, N., & Michail, O. (2024). On geometric shape construction via growth operations. Theoretical Computer Science, 984, 114324. doi:10.1016/j.tcs.2023.114324
2023
On the Exponential Growth of Geometric Shapes
Fault tolerant network constructors
Michail, O., Spirakis, P. G., & Theofilatos, M. (2023). Fault tolerant network constructors. Information and Computation, 292, 105037. doi:10.1016/j.ic.2023.105037
Fault tolerant network constructors
Michail, O., Spirakis, P. G., & Theofilatos, M. (2023). Fault tolerant network constructors. In INFORMATION AND COMPUTATION Vol. 292. doi:10.1016/j.ic.2023.105037
Distributed transformations of Hamiltonian shapes based on line moves
Almethen, A., Michail, O., & Potapov, I. (2023). Distributed transformations of Hamiltonian shapes based on line moves. THEORETICAL COMPUTER SCIENCE, 942, 142-168. doi:10.1016/j.tcs.2022.11.029
2022
Centralised connectivity-preserving transformations for programmable matter: A minimal seed approach
Connor, M., Michail, O., & Potapov, I. (2022). Centralised connectivity-preserving transformations for programmable matter: A minimal seed approach. THEORETICAL COMPUTER SCIENCE, 936, 77-91. doi:10.1016/j.tcs.2022.09.016
On Geometric Shape Construction via Growth Operations
Centralised Connectivity-Preserving Transformations by Rotation: 3 Musketeers for all Orthogonal Convex Shapes
Simple and fast approximate counting and leader election in populations
Michail, O., Spirakis, P. G., & Theofilatos, M. (2022). Simple and fast approximate counting and leader election in populations. INFORMATION AND COMPUTATION, 285. doi:10.1016/j.ic.2021.104698
Distributed Computation and Reconfiguration in Actively Dynamic Networks
Michail, O., Skretas, G., & Spirakis, P. (2022). Distributed Computation and Reconfiguration in Actively Dynamic Networks. Distributed Computing. doi:10.1007/s00446-021-00415-5
Preface
Aspnes, J., & Michail, O. (2022). Preface. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 221. doi:10.4230/LIPIcs.SAND.2022.0
Special issue on Algorithmic Theory of Dynamic Networks and Its Applications – Preface
Bonomi, S., Di Luna, G. A., Michail, O., & Querzoni, L. (2022). Special issue on Algorithmic Theory of Dynamic Networks and Its Applications – Preface. Journal of Computer and System Sciences, 123, 157-158. doi:10.1016/j.jcss.2021.08.002
On efficient connectivity-preserving transformations in a grid
Almethen, A., Michail, O., & Potapov, I. (2022). On efficient connectivity-preserving transformations in a grid. THEORETICAL COMPUTER SCIENCE, 898, 132-148. doi:10.1016/j.tcs.2021.11.004
Centralised Connectivity-Preserving Transformations by Rotation: 3 Musketeers for All Orthogonal Convex Shapes
Connor, M., & Michail, O. (2022). Centralised Connectivity-Preserving Transformations by Rotation: 3 Musketeers for All Orthogonal Convex Shapes. In Unknown Conference (pp. 60-76). Springer International Publishing. doi:10.1007/978-3-031-22050-0_5
On Geometric Shape Construction via Growth Operations
Almalki, N., & Michail, O. (2022). On Geometric Shape Construction via Growth Operations. In ALGORITHMICS OF WIRELESS NETWORKS, ALGOSENSORS 2022 Vol. 13707 (pp. 1-17). doi:10.1007/978-3-031-22050-0_1
The Complexity of Growing a Graph
Mertzios, G. B., Michail, O., Skretas, G., Spirakis, P. G., & Theofilatos, M. (2022). The Complexity of Growing a Graph. In ALGORITHMICS OF WIRELESS NETWORKS, ALGOSENSORS 2022 Vol. 13707 (pp. 123-137). doi:10.1007/978-3-031-22050-0_9
2021
On the Distributed Construction of Stable Networks in Polylogarithmic Parallel Time
Connor, M., Michail, O., & Spirakis, P. (n.d.). On the Distributed Construction of Stable Networks in Polylogarithmic Parallel Time. Information, 12(6), 254. doi:10.3390/info12060254
Centralised Connectivity-Preserving Transformations for Programmable Matter: A Minimal Seed Approach
Connor, M., Michail, O., & Potapov, I. (2021). Centralised Connectivity-Preserving Transformations for Programmable Matter: A Minimal Seed Approach. In ALGORITHMS FOR SENSOR SYSTEMS, ALGOSENSORS 2021 Vol. 12961 (pp. 45-60). doi:10.1007/978-3-030-89240-1_4
Distributed Transformations of Hamiltonian Shapes Based on Line Moves
Almethen, A., Michail, O., & Potapov, I. (2021). Distributed Transformations of Hamiltonian Shapes Based on Line Moves. In ALGORITHMS FOR SENSOR SYSTEMS, ALGOSENSORS 2021 Vol. 12961 (pp. 1-16). doi:10.1007/978-3-030-89240-1_1
2020
Gathering in 1-Interval Connected Graphs
Michail, O., Spirakis, P. G., & Theofilatos, M. (n.d.). Gathering in 1-Interval Connected Graphs. Retrieved from http://arxiv.org/abs/2008.07455v1
Beyond Rings: Gathering in 1-Interval Connected Graphs
Michail, O., Spirakis, P. G., & Theofilatos, M. (2021). Beyond Rings: Gathering in 1-Interval Connected Graphs. PARALLEL PROCESSING LETTERS, 31(04). doi:10.1142/S0129626421500201
Gathering in 1-Interval Connected Graphs
Distributed Computation and Reconfiguration in Actively Dynamic Networks
Michail, O., Skretas, G., & Spirakis, P. (2020). Distributed Computation and Reconfiguration in Actively Dynamic Networks. In PODC '20: Proceedings of the 39th Symposium on Principles of Distributed Computing (pp. 448-457). doi:10.1145/3382734.3405744
On the Distributed Construction of Stable Networks in Polylogarithmic Parallel Time
On Efficient Connectivity-Preserving Transformations in a Grid
Almethen, A., Michail, O., & Potapov, I. (2020). On Efficient Connectivity-Preserving Transformations in a Grid. ALGORITHMS FOR SENSOR SYSTEMS, ALGOSENSORS 2020, 12503, 76-91. doi:10.1007/978-3-030-62401-9_6
On Efficient Connectivity-Preserving Transformations in a Grid
On Efficient Connectivity-Preserving Transformations in a Grid.
Almethen, A., Michail, O., & Potapov, I. (2020). On Efficient Connectivity-Preserving Transformations in a Grid.. In C. M. Pinotti, A. Navarra, & A. Bagchi (Eds.), ALGOSENSORS Vol. 12503 (pp. 76-91). Springer. Retrieved from https://doi.org/10.1007/978-3-030-62401-9
Pushing lines helps: Efficient universal centralised transformations for programmable matter.
Almethen, A., Michail, O., & Potapov, I. (2020). Pushing lines helps: Efficient universal centralised transformations for programmable matter.. Theor. Comput. Sci., 830-831, 43-59. doi:10.1016/j.tcs.2020.04.026
2019
Fault Tolerant Network Constructors
Michail, O., Spirakis, P. G., & Theofilatos, M. (2019). Fault Tolerant Network Constructors. Lecture Notes in Computer Science. Retrieved from http://arxiv.org/abs/1903.05992v2
Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable Matter
Almethen, A., Michail, O., & Potapov, I. (2019). Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable Matter. In International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS). doi:10.1007/978-3-030-34405-4_3
On the Transformation Capability of Feasible Mechanisms for Programmable Matter
Michail, O., Skretas, G., & Spirakis, P. G. (2019). On the Transformation Capability of Feasible Mechanisms for Programmable Matter. Journal of Computer and System Sciences, 102, 18-39. doi:10.1016/j.jcss.2018.12.001
Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable Matter
Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable Matter
Almethen, A., Michail, O., & Potapov, I. (2019). Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable Matter. doi:10.1007/978-3-030-34405-4_3
Temporal Network Optimization Subject to Connectivity Constraints
Mertzios, G., Michail, O., & Spirakis, P. (2019). Temporal Network Optimization Subject to Connectivity Constraints. Algorithmica: an international journal in computer science, 81, 1416-1449. doi:10.1007/s00453-018-0478-6
Fault Tolerant Network Constructors
Fault Tolerant Network Constructors
Michail, O., Spirakis, P. G., & Theofilatos, M. (2019). Fault Tolerant Network Constructors. In Stabilization, Safety, and Security of Distributed Systems (Vol. 11914, pp. 243-255). Springer Nature. doi:10.1007/978-3-030-34992-9_19
On the transformation capability of feasible mechanisms for programmable matter.
Michail, O., Skretas, G., & Spirakis, P. G. (2019). On the transformation capability of feasible mechanisms for programmable matter.. J. Comput. Syst. Sci., 102, 18-39.
2018
How many cooks spoil the soup?
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
Simple and Fast Approximate Counting and Leader Election in Populations
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
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
Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata
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
Fast Approximate Counting and Leader Election in Populations
Fast Approximate Counting and Leader Election in Populations
Michail, O., Spirakis, P. G., & Theofilatos, M. (2018). 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
Doty, D., Eftekhari, M., Michail, O., Spirakis, P. G., & Theofilatos, M. (2018). Exact size counting in uniform population protocols in nearly logarithmic time. Retrieved from http://arxiv.org/abs/1805.04832v1
Exact size counting in uniform population protocols in nearly logarithmic time
Communications of ACM (CACM)
Spirakis, P. G., & Michail, O. (2018). Communications of ACM (CACM). Communications of the ACM.
Elements of the Theory of Dynamic Networks
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
Brief Announcement: Fast Approximate Counting and Leader Election in Populations
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
2017
On the Transformation Capability of Feasible Mechanisms for Programmable Matter
Michail, O., Skretas, G., & Spirakis, P. G. (2017). On the Transformation Capability of Feasible Mechanisms for Programmable Matter. Retrieved from http://arxiv.org/abs/1703.04381v1
On the Transformation Capability of Feasible Mechanisms for Programmable Matter
Connectivity Preserving Network Transformers
Michail, O., & Spirakis, P. G. (2017). Connectivity Preserving Network Transformers. In EMERGENT COMPUTATION: A FESTSCHRIFT FOR SELIM G. AKL Vol. 24 (pp. 337-359). doi:10.1007/978-3-319-46376-6_15
Network Constructors: A Model for Programmable Matter
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
2016
How Many Cooks Spoil the Soup?
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).
Traveling Salesman Problems in Temporal Graphs
Spirakis, P. G., & Michail, O. (2016). Traveling Salesman Problems in Temporal Graphs. Theoretical Computer Science, 634, 1-23. doi:10.1016/j.tcs.2016.04.006
Simple and efficient local codes for distributed stable network construction
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
How Many Cooks Spoil the Soup?
How Many Cooks Spoil the Soup?
Michail, O., & Spirakis, P. G. (2016). How Many Cooks Spoil the Soup?. In Structural Information and Communication Complexity (Vol. 9988, pp. 3-18). Springer Nature. doi:10.1007/978-3-319-48314-6_1
2015
Connectivity Preserving Network Transformers
Connectivity preserving network transformers
Michail, O., & Spirakis, P. G. (2017). Connectivity preserving network transformers. THEORETICAL COMPUTER SCIENCE, 671, 36-55. doi:10.1016/j.tcs.2016.02.040
NETCS: A New Simulator of Population Protocols and Network Constructors
Amaxilatis, D., Logaras, M., Michail, O., & Spirakis, P. G. (2015). NETCS: A New Simulator of Population Protocols and Network Constructors. Retrieved from http://arxiv.org/abs/1508.06731v1
NETCS: A New Simulator of Population Protocols and Network Constructors
Session details: Session 10
Michail, O. (2015). Session details: Session 10. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing. ACM. doi:10.1145/3260486
Terminating population protocols via some minimal global knowledge assumptions
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
Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata
Michail, O. (2015). Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata. In PODC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (pp. 37-46). doi:10.1145/2767386.2767402
AN INTRODUCTION TO TEMPORAL GRAPHS: AN ALGORITHMIC PERSPECTIVE
Michail, O. (2016). AN INTRODUCTION TO TEMPORAL GRAPHS: AN ALGORITHMIC PERSPECTIVE. INTERNET MATHEMATICS, 12(4), 239-280. doi:10.1080/15427951.2016.1177801
Temporal Network Optimization Subject to Connectivity Constraints
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 https://www.webofscience.com/
Temporal Network Optimization Subject to Connectivity Constraints
A Glimpse at Paul G. Spirakis
Chatzigiannakis, I., Fotakis, D., Kontogiannis, S., Michail, O., Nikoletseas, S., Pantziou, G., & Zaroliagis, C. (2015). A Glimpse at Paul G. Spirakis. In ALGORITHMS, PROBABILITY, NETWORKS, AND GAMES: SCIENTIFIC PAPERS AND ESSAYS DEDICATED TO PAUL G. SPIRAKIS ON THE OCCASION OF HIS 60TH BIRTHDAY Vol. 9295 (pp. 3-24). doi:10.1007/978-3-319-24024-4_1
An Introduction to Temporal Graphs: An Algorithmic Perspective
Michail, O. (2015). An Introduction to Temporal Graphs: An Algorithmic Perspective. In ALGORITHMS, PROBABILITY, NETWORKS, AND GAMES: SCIENTIFIC PAPERS AND ESSAYS DEDICATED TO PAUL G. SPIRAKIS ON THE OCCASION OF HIS 60TH BIRTHDAY Vol. 9295 (pp. 308-343). doi:10.1007/978-3-319-24024-4_18
2014
Traveling Salesman Problems in Temporal Graphs
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 https://www.webofscience.com/
2013
The computational power of simple protocols for self-awareness on graphs
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
Simple and efficient local codes for distributed stable network construction
Michail, O., & Spirakis, P. G. (2014). Simple and Efficient Local Codes for Distributed Stable Network Construction. In PROCEEDINGS OF THE 2014 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'14) (pp. 76-85). doi:10.1145/2611462.2611466
Strong Bounds for Evolution in Networks
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 https://www.webofscience.com/
Naming and Counting in Anonymous Unknown Dynamic Networks
Michail, O., Chatzigiannakis, I., & Spirakis, P. G. (2013). Naming and Counting in Anonymous Unknown Dynamic Networks. In Stabilization, Safety, and Security of Distributed Systems (Vol. 8255, pp. 281-295). Springer Nature. doi:10.1007/978-3-319-03089-0_20
Temporal Network Optimization Subject to Connectivity Constraints
Mertzios, G. B., Michail, O., Chatzigiannakis, I., & Spirakis, P. G. (2013). Temporal Network Optimization Subject to Connectivity Constraints. In Automata, Languages, and Programming (Vol. 7966, pp. 657-668). Springer Nature. doi:10.1007/978-3-642-39212-2_57
2012
Causality, Influence, and Computation in Possibly Disconnected Synchronous Dynamic Networks
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
Brief Announcement: Naming and Counting in Anonymous Unknown Dynamic Networks
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 https://www.webofscience.com/
Terminating Population Protocols via Some Minimal Global Knowledge Assumptions
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
Naming and Counting in Anonymous Unknown Dynamic Networks
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 https://www.webofscience.com/
Causality, influence, and computation in possibly disconnected synchronous dynamic networks
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(01), 2016-2026. doi:10.1016/j.jpdc.2013.07.007
2011
The Computational Power of Simple Protocols for Self-awareness on Graphs
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 https://www.webofscience.com/
Passively mobile communicating machines that use restricted space
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 (pp. 6-15). ACM. doi:10.1145/1998476.1998480
Mediated population protocols
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
New Models for Population Protocols
Michail, O., Chatzigiannakis, I., & Spirakis, P. G. (2011). New Models for Population Protocols (Vol. 2). Springer Science and Business Media LLC. doi:10.2200/s00328ed1v01y201101dct006
Computational models for networks of tiny artifacts: A survey
À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
2010
Passively mobile communicating machines that use restricted space
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
All Symmetric Predicates in <i>NSPACE</i>(<i>n</i><SUP>2</SUP>) Are Stably Computable by the Mediated Population Protocol Model
Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A., & Spirakis, P. G. (2010). All Symmetric Predicates in <i>NSPACE</i>(<i>n</i><SUP>2</SUP>) Are Stably Computable by the Mediated Population Protocol Model. In MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2010 Vol. 6281 (pp. 270-+). Retrieved from https://www.webofscience.com/
Algorithmic Verification of Population Protocols
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 https://www.webofscience.com/
Stably Decidable Graph Languages by Mediated Population Protocols
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 https://www.webofscience.com/
Passively Mobile Communicating Logarithmic Space Machines
Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A., & Spirakis, P. G. (2010). Passively Mobile Communicating Logarithmic Space Machines. Retrieved from http://arxiv.org/abs/1004.3395v1
On the Fairness of Probabilistic Schedulers for Population Protocols
Chatzigiannakis, I., Dolev, S., Fekete, S. P., Michail, O., & Spirakis, P. G. (2010). On the Fairness of Probabilistic Schedulers for Population Protocols. In Dagstuhl Seminar Proceedings Vol. 9371.
2009
Not All Fair Probabilistic Schedulers Are Equivalent
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 https://www.webofscience.com/
Mediated Population Protocols
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 https://www.webofscience.com/
Recent Advances in Population Protocols
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 https://www.webofscience.com/
Brief Announcement: Decidable Graph Languages by Mediated Population Protocols
Chatzigiannakis, I., Michail, O., & Spirakis, P. G. (2009). Brief Announcement: Decidable Graph Languages by Mediated Population Protocols. In Lecture Notes in Computer Science (pp. 239-240). Springer Berlin Heidelberg. doi:10.1007/978-3-642-04355-0_24
2008
Improving the accuracy of neuro-symbolic rules with case-based reasoning
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
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 https://www.webofscience.com/