Mediated population protocols

O Michail, I Chatzigiannakis, PG Spirakis - Theoretical Computer Science, 2011 - Elsevier
We extend here the Population Protocol (PP) model of Angluin et al.(2004, 2006)[2, 4] in
order to model more powerful networks of resource-limited agents that are possibly mobile …

Passively mobile communicating machines that use restricted space

I Chatzigiannakis, O Michail, S Nikolaou… - Proceedings of the 7th …, 2011 - dl.acm.org
We propose a new theoretical model for passively mobile Wireless Sensor Networks, called
PM, standing for Passively mobile Machines. The main modification wrt the Population …

Rate-independent computation in continuous chemical reaction networks

HL Chen, D Doty, D Soloveichik - Proceedings of the 5th conference on …, 2014 - dl.acm.org
Understanding the algorithmic behaviors that are in principle realizable in a chemical
system is necessary for a rigorous understanding of the design principles of biological …

[HTML][HTML] Population protocols with faulty interactions: the impact of a leader

GA Di Luna, P Flocchini, T Izumi, T Izumi… - Theoretical Computer …, 2019 - Elsevier
We consider the problem of simulating traditional population protocols under weaker models
of communication, which include one-way interactions (as opposed to two-way interactions) …

Algorithmic verification of population protocols

I Chatzigiannakis, O Michail, PG Spirakis - … , SSS 2010, New York, NY, USA …, 2010 - Springer
In this work, we study the Population Protocol model of Angluin et al. from the perspective of
protocol verification. In particular, we are interested in algorithmically solving the problem of …

Mediated population protocols

I Chatzigiannakis, O Michail, PG Spirakis - … 5-12, 2009, Proceedings, Part II …, 2009 - Springer
We extend here the Population Protocol model of Angluin et al.[2] in order to model more
powerful networks of very small resource-limited artefacts (agents) that are possibly mobile …

Elementarily computable functions over the real numbers and R-sub-recursive functions

O Bournez, E Hainry - Theoretical Computer Science, 2005 - Elsevier
We present an analog and machine-independent algebraic characterization of elementarily
computable functions over the real numbers in the sense of recursive analysis: we prove that …

Computing with large populations using interactions

O Bournez, P Fraigniaud, X Koegler - International Symposium on …, 2012 - Springer
We define a general model capturing the behavior of a population of anonymous agents that
interact in pairs. This model captures some of the main features of opportunistic networks, in …

Population protocols with faulty interactions: the impact of a leader

GA Di Luna, P Flocchini, T Izumi, T Izumi… - … on Algorithms and …, 2017 - Springer
We consider the problem of simulating traditional population protocols under weaker models
of communication, which include one-way interactions (as opposed to two-way interactions) …

Passively mobile communicating logarithmic space machines

I Chatzigiannakis, O Michail, S Nikolaou… - arXiv preprint arXiv …, 2010 - arxiv.org
We propose a new theoretical model for passively mobile Wireless Sensor Networks. We
call it the PALOMA model, standing for PAssively mobile LOgarithmic space MAchines. The …