| Publication | Date of Publication | Type |
|---|
All for one and one for all: an O(1)-musketeers generic transformation for rotating robots
Theoretical Computer Science | 2025-11-10 | Paper |
On the exponential growth of geometric shapes
Theoretical Computer Science | 2025-09-16 | Paper |
Transformation of modular robots by rotation: 3 + 1 musketeers for all orthogonally convex shapes
Journal of Computer and System Sciences | 2025-03-26 | Paper |
The complexity of growing a graph
Journal of Computer and System Sciences | 2024-10-29 | Paper |
| Fault tolerant network constructors | 2024-04-19 | Paper |
| Pushing lines helps: efficient universal centralised transformations for programmable matter | 2024-04-05 | Paper |
On geometric shape construction via growth operations
Theoretical Computer Science | 2024-01-02 | Paper |
Centralised connectivity-preserving transformations by rotation: 3 musketeers for all orthogonal convex shapes
Algorithmics of Wireless Networks | 2023-08-04 | Paper |
On geometric shape construction via growth operations
Algorithmics of Wireless Networks | 2023-08-04 | Paper |
The complexity of growing a graph
Algorithmics of Wireless Networks | 2023-08-04 | Paper |
Simple and fast approximate counting and leader election in populations
Lecture Notes in Computer Science | 2023-08-02 | Paper |
Fault tolerant network constructors
Information and Computation | 2023-05-19 | Paper |
Distributed transformations of Hamiltonian shapes based on line moves
Theoretical Computer Science | 2022-12-21 | Paper |
Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach
Theoretical Computer Science | 2022-10-21 | Paper |
Beyond rings: gathering in 1-interval connected graphs
Parallel Processing Letters | 2022-07-08 | Paper |
Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach
Algorithms for Sensor Systems | 2022-06-24 | Paper |
Distributed transformations of Hamiltonian shapes based on line moves
Algorithms for Sensor Systems | 2022-06-24 | Paper |
Simple and fast approximate counting and leader election in populations
Information and Computation | 2022-05-17 | Paper |
Distributed computation and reconfiguration in actively dynamic networks
Distributed Computing | 2022-04-01 | Paper |
How many cooks spoil the soup?
Distributed Computing | 2022-02-15 | Paper |
On efficient connectivity-preserving transformations in a grid
Theoretical Computer Science | 2021-12-01 | Paper |
On efficient connectivity-preserving transformations in a grid
Lecture Notes in Computer Science | 2021-07-08 | Paper |
An introduction to temporal graphs: an algorithmic perspective
Internet Mathematics | 2021-03-26 | Paper |
Distributed Computation and Reconfiguration in Actively Dynamic Networks
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
| On the transformation capability of feasible mechanisms for programmable matter | 2020-05-27 | Paper |
Pushing lines helps: efficient universal centralised transformations for programmable matter
Theoretical Computer Science | 2020-05-26 | Paper |
On the transformation capability of feasible mechanisms for programmable matter
Journal of Computer and System Sciences | 2019-05-03 | Paper |
On the transformation capability of feasible mechanisms for programmable matter
Journal of Computer and System Sciences | 2019-05-03 | Paper |
Temporal network optimization subject to connectivity constraints
Algorithmica | 2019-04-25 | Paper |
| Brief announcement: Fast approximate counting and leader election in populations | 2019-01-30 | Paper |
Connectivity preserving network transformers
Emergent Computation | 2018-10-04 | Paper |
Terminating distributed construction of shapes and patterns in a fair solution of automata
Distributed Computing | 2018-08-10 | Paper |
Connectivity preserving network transformers
Theoretical Computer Science | 2017-05-18 | Paper |
Network Constructors: A Model for Programmable Matter
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
How Many Cooks Spoil the Soup?
Structural Information and Communication Complexity | 2016-12-01 | Paper |
| Computing in dynamic networks | 2016-07-29 | Paper |
Simple and efficient local codes for distributed stable network construction
Distributed Computing | 2016-07-05 | Paper |
Traveling salesman problems in temporal graphs
Theoretical Computer Science | 2016-05-18 | Paper |
Terminating distributed construction of shapes and patterns in a fair solution of automata
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
An introduction to temporal graphs: an algorithmic perspective
Algorithms, Probability, Networks, and Games | 2016-01-27 | Paper |
A glimpse at Paul G. Spirakis
Algorithms, Probability, Networks, and Games | 2016-01-27 | Paper |
Causality, influence, and computation in possibly disconnected synchronous dynamic networks
Journal of Parallel and Distributed Computing | 2015-12-18 | Paper |
Simple and efficient local codes for distributed stable network construction
Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
Computational models for networks of tiny artifacts: a survey
Computer Science Review | 2014-10-24 | Paper |
Traveling salesman problems in temporal graphs
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Naming and counting in anonymous unknown dynamic networks
Lecture Notes in Computer Science | 2014-09-30 | Paper |
The computational power of simple protocols for self-awareness on graphs
Theoretical Computer Science | 2014-01-13 | Paper |
Temporal network optimization subject to connectivity constraints
Automata, Languages, and Programming | 2013-08-07 | Paper |
Temporal network optimization subject to connectivity constraints
Automata, Languages, and Programming | 2013-08-07 | Paper |
Passively mobile communicating machines that use restricted space
Theoretical Computer Science | 2011-12-07 | Paper |
Mediated population protocols
Theoretical Computer Science | 2011-05-10 | Paper |
All symmetric predicates in NSPACE\((n^{2})\) are stably computable by the mediated population protocol model
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Recent Advances in Population Protocols
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Mediated Population Protocols
Automata, Languages and Programming | 2009-07-14 | Paper |
