| An introduction to temporal graphs: An algorithmic perspective O Michail Internet Mathematics 12 (4), 239-280, 2016 | 103 | 2016 |
| Mediated population protocols O Michail, I Chatzigiannakis, PG Spirakis Theoretical Computer Science 412 (22), 2434-2450, 2011 | 99* | 2011 |
| Passively mobile communicating machines that use restricted space I Chatzigiannakis, O Michail, S Nikolaou, A Pavlogiannis, PG Spirakis Theoretical Computer Science 412 (46), 6469-6483, 2011 | 63* | 2011 |
| New models for population protocols O Michail, I Chatzigiannakis, PG Spirakis Synthesis Lectures on Distributed Computing Theory 2 (1), 1-156, 2011 | 63 | 2011 |
| Temporal network optimization subject to connectivity constraints GB Mertzios, O Michail, PG Spirakis Algorithmica 81 (4), 1416-1449, 2019 | 62* | 2019 |
| Traveling salesman problems in temporal graphs O Michail, PG Spirakis Theoretical Computer Science 634, 1-23, 2016 | 58 | 2016 |
| Simple and efficient local codes for distributed stable network construction O Michail, PG Spirakis Distributed Computing 29 (3), 207-237, 2016 | 46 | 2016 |
| Causality, influence, and computation in possibly disconnected synchronous dynamic networks O Michail, I Chatzigiannakis, PG Spirakis Journal of Parallel and Distributed Computing 74 (1), 2016-2026, 2014 | 43 | 2014 |
| Naming and counting in anonymous unknown dynamic networks O Michail, I Chatzigiannakis, PG Spirakis Symposium on Self-Stabilizing Systems, 281-295, 2013 | 41 | 2013 |
| Elements of the theory of dynamic networks O Michail, PG Spirakis Communications of the ACM 61 (2), 72-72, 2018 | 40 | 2018 |
| Algorithmic verification of population protocols I Chatzigiannakis, O Michail, PG Spirakis Symposium on Self-Stabilizing Systems, 221-235, 2010 | 25 | 2010 |
| Not all fair probabilistic schedulers are equivalent I Chatzigiannakis, S Dolev, SP Fekete, O Michail, PG Spirakis International Conference On Principles Of Distributed Systems, 33-47, 2009 | 25 | 2009 |
| Terminating population protocols via some minimal global knowledge assumptions O Michail, PG Spirakis Journal of Parallel and Distributed Computing 81, 1-10, 2015 | 24 | 2015 |
| Terminating distributed construction of shapes and patterns in a fair solution of automata O Michail Distributed Computing 31 (5), 343-365, 2018 | 20 | 2018 |
| Recent advances in population protocols I Chatzigiannakis, O Michail, PG Spirakis International Symposium on Mathematical Foundations of Computer Science, 56-76, 2009 | 18 | 2009 |
| Brief announcement: Naming and counting in anonymous unknown dynamic networks O Michail, I Chatzigiannakis, PG Spirakis International Symposium on Distributed Computing, 437-438, 2012 | 17 | 2012 |
| On the transformation capability of feasible mechanisms for programmable matter O Michail, G Skretas, PG Spirakis Journal of Computer and System Sciences 102, 18-39, 2019 | 14 | 2019 |
| All Symmetric Predicates in NSPACE(n2) Are Stably Computable by the Mediated Population Protocol Model I Chatzigiannakis, O Michail, S Nikolaou, A Pavlogiannis, PG Spirakis International Symposium on Mathematical Foundations of Computer Science, 270-281, 2010 | 12 | 2010 |
| Brief announcement: Decidable graph languages by mediated population protocols I Chatzigiannakis, O Michail, PG Spirakis International Symposium on Distributed Computing, 239-240, 2009 | 12 | 2009 |
| Stably decidable graph languages by mediated population protocols I Chatzigiannakis, O Michail, PG Spirakis Symposium on Self-Stabilizing Systems, 252-266, 2010 | 10 | 2010 |
Paul SpirakisProfessor of Computer Science U. Liverpool and U. PatrasVerified email at liverpool.ac.uk
