Othon Michail

J. Comput. Syst. Sci., May, 2024

On geometric shape construction via growth operations.

[BibT_eX]

[DOI]

Nada Almalki

Theor. Comput. Sci., February, 2024

2023

Fault tolerant network constructors.

[BibT_eX]

[DOI]

Inf. Comput., June, 2023

Distributed transformations of Hamiltonian shapes based on line moves.

[BibT_eX]

[DOI]

Abdullah Almethen

Theor. Comput. Sci., 2023

Growing Fast without Colliding: Polylogarithmic Time Step Construction of Geometric Shapes.

[BibT_eX]

[DOI]

Nada Almalki

Siddharth Gupta

CoRR, 2023

Collision Detection for Modular Robots - it is easy to cause collisions and hard to avoid them.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Centralised connectivity-preserving transformations for programmable matter: A minimal seed approach.

[BibT_eX]

[DOI]

Matthew Connor

Theor. Comput. Sci., 2022

On efficient connectivity-preserving transformations in a grid.

[BibT_eX]

[DOI]

Abdullah Almethen

Theor. Comput. Sci., 2022

Special issue on Algorithmic Theory of Dynamic Networks and Its Applications - Preface.

[BibT_eX]

[DOI]

Silvia Bonomi

Giuseppe Antonio Di Luna

Leonardo Querzoni

J. Comput. Syst. Sci., 2022

Simple and fast approximate counting and leader election in populations.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Distributed computation and reconfiguration in actively dynamic networks.

[BibT_eX]

[DOI]

George Skretas

Distributed Comput., 2022

The Complexity of Growing a Graph.

[BibT_eX]

[DOI]

Proceedings of the Algorithmics of Wireless Networks, 2022

Centralised Connectivity-Preserving Transformations by Rotation: 3 Musketeers for All Orthogonal Convex Shapes.

[BibT_eX]

[DOI]

Matthew Connor

Proceedings of the Algorithmics of Wireless Networks, 2022

2021

Beyond Rings: Gathering in 1-Interval Connected Graphs.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2021

On the Distributed Construction of Stable Networks in Polylogarithmic Parallel Time.

[BibT_eX]

[DOI]

Matthew Connor

Inf., 2021

2020

Pushing lines helps: Efficient universal centralised transformations for programmable matter.

[BibT_eX]

[DOI]

Abdullah Almethen

Theor. Comput. Sci., 2020

Gathering in 1-Interval Connected Graphs.

[BibT_eX]

[DOI]

CoRR, 2020

2019

On the transformation capability of feasible mechanisms for programmable matter.

[BibT_eX]

[DOI]

George Skretas

J. Comput. Syst. Sci., 2019

Temporal Network Optimization Subject to Connectivity Constraints.

[BibT_eX]

[DOI]

George B. Mertzios

Algorithmica, 2019

2018

How many cooks spoil the soup?

[BibT_eX]

[DOI]

Distributed Comput., 2018

Terminating distributed construction of shapes and patterns in a fair solution of automata.

[BibT_eX]

[DOI]

Distributed Comput., 2018

Fast Approximate Counting and Leader Election in Populations.

[BibT_eX]

[DOI]

CoRR, 2018

Exact size counting in uniform population protocols in nearly logarithmic time.

[BibT_eX]

[DOI]

CoRR, 2018

Elements of the theory of dynamic networks.

[BibT_eX]

[DOI]

Commun. ACM, 2018

Brief Announcement: Exact Size Counting in Uniform Population Protocols in Nearly Logarithmic Time.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Brief Announcement: Fast Approximate Counting and Leader Election in Populations.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2018

2017

Connectivity preserving network transformers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Network Constructors: A Model for Programmable Matter.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

2016

Traveling salesman problems in temporal graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

An Introduction to Temporal Graphs: An Algorithmic Perspective.

[BibT_eX]

[DOI]

Internet Math., 2016

Simple and efficient local codes for distributed stable network construction.

[BibT_eX]

[DOI]

Distributed Comput., 2016

2015

Terminating population protocols via some minimal global knowledge assumptions.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2015

NETCS: A New Simulator of Population Protocols and Network Constructors.

[BibT_eX]

[DOI]

CoRR, 2015

A Glimpse at Paul G. Spirakis.

[BibT_eX]

[DOI]

Dimitris Fotakis

Spyros C. Kontogiannis

Sotiris E. Nikoletseas

Grammati E. Pantziou

Christos D. Zaroliagis

Proceedings of the Algorithms, Probability, Networks, and Games, 2015

2014

Causality, influence, and computation in possibly disconnected synchronous dynamic networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2014

2013

The computational power of simple protocols for self-awareness on graphs.

[BibT_eX]

[DOI]

Stavros Nikolaou

Theor. Comput. Sci., 2013

Naming and Counting in Anonymous Unknown Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

Temporal Network Optimization Subject to Connectivity Constraints.

[BibT_eX]

[DOI]

George B. Mertzios

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Causality, Influence, and Computation in Possibly Disconnected Dynamic Networks

[BibT_eX]

[DOI]

CoRR, 2012

Brief Announcement: Naming and Counting in Anonymous Unknown Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 26th International Symposium, 2012

Terminating Population Protocols via Some Minimal Global Knowledge Assumptions.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2012

2011

New Models for Population Protocols

[BibT_eX]

[DOI]

Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, ISBN: 978-3-031-02004-9, 2011

Mediated population protocols.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Passively mobile communicating machines that use restricted space.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Computational models for networks of tiny artifacts: A survey.

[BibT_eX]

[DOI]

Carme Àlvarez

Comput. Sci. Rev., 2011

2010

Νέα μοντέλα για πρωτόκολλα πληθυσμών

[BibT_eX]

[DOI]

PhD thesis, 2010

Passively Mobile Communicating Logarithmic Space Machines

[BibT_eX]

[DOI]

CoRR, 2010

Stably Decidable Graph Languages by Mediated Population Protocols.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

Algorithmic Verification of Population Protocols.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

All Symmetric Predicates in NSPACE(n2) Are Stably Computable by the Mediated Population Protocol Model.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009

Brief Announcement: Decidable Graph Languages by Mediated Population Protocols.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Not All Fair Probabilistic Schedulers Are Equivalent.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

Recent Advances in Population Protocols.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

On the Fairness of Probabilistic Schedulers for Population Protocols.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Methods for Distributed Cooperative Systems, 06.09., 2009

2008

Improving the Integration of Neuro-Symbolic Rules with Case-Based Reasoning.

[BibT_eX]

[DOI]

Jim Prentzas

Ioannis Hatzilygeroudis