, Accelerating approximate consensus with self-organizing overlays, Spatial Computing Workshop, 2013.
, Superdiffusive Dispersion and Mixing of Swarms, ACM Transactions on Autonomous and Adaptive Systems, vol.10, issue.2, p.10, 2015.
DOI : 10.1038/nature06518
, Aggregate Programming for the Internet of Things, Computer, vol.48, issue.9, pp.22-30, 2015.
DOI : 10.1109/MC.2015.261
, Building Blocks for Aggregate Programming of Self-Organising Applications, 2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops, pp.8-13, 2014.
DOI : 10.1109/SASOW.2014.6
, The promise, and limitations, of gossip protocols, ACM SIGOPS Operating Systems Review, vol.41, issue.5, pp.8-13, 2007.
DOI : 10.1145/1317379.1317382
, Paxos made live, Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, PODC '07, pp.398-407, 2007.
DOI : 10.1145/1281100.1281103
, A type-sound calculus of computational fields, Science of Computer Programming, vol.117, pp.17-44, 2016.
DOI : 10.1016/j.scico.2015.11.005
, Code Mobility Meets Self-organisation: A Higher-Order Calculus of Computational Fields, Formal Techniques for Distributed Objects, Components, and Systems, pp.113-128, 2015.
DOI : 10.1007/978-3-319-19195-9_8
, Laplacian-based consensus on spatial computers, Int'l Conf. on Autonomous Agents and Multiagent Systems, pp.907-914, 2010.
, Impossibility of distributed consensus with one faulty process, Journal of the ACM, vol.32, issue.2, pp.374-382, 1985.
DOI : 10.1145/3149.214121
, Kelips: Building an efficient and stable p2p dht through increased memory and background overhead. In: Peer-to-Peer Systems II, pp.160-169, 2003.
DOI : 10.1007/978-3-540-45172-3_15
URL : http://www.cs.cornell.edu/gupta/Papers/iptps03.kelips.ps
, Gossip-based aggregation in large dynamic networks, ACM Transactions on Computer Systems, vol.23, issue.3, pp.219-252, 2005.
DOI : 10.1145/1082469.1082470
URL : http://www.cs.unibo.it/bison/publications/aggregation-tocs.pdf
, T-Man: Gossip-based fast overlay topology construction, Computer Networks, vol.53, issue.13, pp.2321-2339, 2009.
DOI : 10.1016/j.comnet.2009.03.013
, The part-time parliament, ACM Transactions on Computer Systems, vol.16, issue.2, pp.133-169, 1998.
DOI : 10.1145/279227.279229
, Distributed Algorithms, 1996.
, Fast distributed algorithms for computing separable functions. Information Theory, IEEE Transactions on, vol.54, issue.7, pp.2997-3007, 2008.
DOI : 10.1109/tit.2008.924648
URL : http://arxiv.org/pdf/cs/0504029
, Consensus and Cooperation in Networked Multi-Agent Systems, Proceedings of the IEEE, vol.95, issue.1, pp.215-233, 2007.
DOI : 10.1109/JPROC.2006.887293
, Fault-tolerant broadcast of routing information, Computer Networks (1976), vol.7, issue.6, pp.395-4050376, 1983.
DOI : 10.1016/0376-5075(83)90034-X
URL : http://www.cs.berkeley.edu/%7Epbg/courses/cs598fa09/readings/p83.pdf
, Chemical-oriented simulation of computational systems with ALCHEMIST, Journal of Simulation, vol.7, issue.3, pp.202-215, 2013.
DOI : 10.1108/17427371111172997
, Protelis, Proceedings of the 30th Annual ACM Symposium on Applied Computing, SAC '15, pp.1846-1853, 2015.
DOI : 10.1145/1060289.1060313
, Gossip Algorithms, Foundations and Trends?? in Networking, vol.3, issue.1, 2009.
DOI : 10.1561/1300000014
, Efficient engineering of complex selforganising systems by self-stabilising fields, pp.81-90, 2015.
DOI : 10.1109/saso.2015.16
, An Epidemic Protocol for Managing Routing Tables in Very Large Peer-to-Peer Networks, Self-Managing Distributed Systems, pp.41-54, 2003.
DOI : 10.1007/978-3-540-39671-0_5
, Toward Sociotechnical Urban Superorganisms, Computer, vol.45, issue.8, pp.76-78, 2012.
DOI : 10.1109/MC.2012.280