An introduction to population protocols

J Aspnes, E Ruppert - Middleware for Network Eccentric and Mobile …, 2009 - Springer
Population protocols are used as a theoretical model for a collection (or population) of tiny
mobile agents that interact with one another to carry out a computation. The agents are …

NNV: the neural network verification tool for deep neural networks and learning-enabled cyber-physical systems

HD Tran, X Yang, D Manzanas Lopez, P Musau… - … on Computer Aided …, 2020 - Springer
This paper presents the Neural Network Verification (NNV) software tool, a set-based
verification framework for deep neural networks (DNNs) and learning-enabled cyber …

Elements of the theory of dynamic networks

O Michail, PG Spirakis - Communications of the ACM, 2018 - dl.acm.org
Elements of the theory of dynamic networks Page 1 72 COMMUNICATIONS OF THE ACM |
FEBRUARY 2018 | VOL. 61 | NO. 2 review articles IMA GE B Y ANITHA DEVI MUR THI A …

Time-varying graphs and dynamic networks

A Casteigts, P Flocchini, W Quattrociocchi… - International Journal of …, 2012 - Taylor & Francis
The past few years have seen intensive research efforts carried out in some apparently
unrelated areas of dynamic systems–delay-tolerant networks, opportunistic-mobility …

Time-varying graphs and dynamic networks

A Casteigts, P Flocchini, W Quattrociocchi… - Ad-hoc, Mobile, and …, 2011 - Springer
The past decade has seen intensive research efforts on highly dynamic wireless and mobile
networks (variously called delay-tolerant, disruptive-tolerant, challenged, opportunistic, etc) …

A simple population protocol for fast robust approximate majority

D Angluin, J Aspnes, D Eisenstat - Distributed Computing, 2008 - Springer
We describe and analyze a 3-state one-way population protocol to compute approximate
majority in the model in which pairs of agents are drawn uniformly at random to interact …

Time-space trade-offs in population protocols

D Alistarh, J Aspnes, D Eisenstat, R Gelashvili… - Proceedings of the twenty …, 2017 - SIAM
Population protocols are a popular model of distributed computing, in which randomly-
interacting agents with little computational power cooperate to jointly perform computational …

Space-optimal majority in population protocols

D Alistarh, J Aspnes, R Gelashvili - Proceedings of the Twenty-Ninth Annual …, 2018 - SIAM
Population protocols are a popular model of distributed computing, in which n agents with
limited local state interact randomly, and cooperate to collectively compute global …

Deterministic function computation with chemical reaction networks

HL Chen, D Doty, D Soloveichik - Natural computing, 2014 - Springer
Chemical reaction networks (CRNs) formally model chemistry in a well-mixed solution.
CRNs are widely used to describe information processing occurring in natural cellular …

Fast computation by population protocols with a leader

D Angluin, J Aspnes, D Eisenstat - Distributed Computing, 2008 - Springer
Fast algorithms are presented for performing computations in a probabilistic population
model. This is a variant of the standard population protocol model, in which finite-state …