Elements of the theory of dynamic networks

The challenge of computing in a highly dynamic environment.

[1]  Othon Michail,et al.  Terminating distributed construction of shapes and patterns in a fair solution of automata , 2015, Distributed Computing.

[2]  Paul G. Spirakis,et al.  Traveling salesman problems in temporal graphs , 2014, Theor. Comput. Sci..

[3]  Emanuele Viola,et al.  On the Complexity of Information Spreading in Dynamic Networks , 2013, SODA.

[4]  Michael J. Fischer,et al.  Computation in networks of passively mobile finite-state sensors , 2004, PODC '04.

[5]  Roger Wattenhofer,et al.  Information dissemination in highly dynamic graphs , 2005, DIALM-POMC '05.

[6]  Luca Cardelli,et al.  Morphisms of reaction networks that couple structure to function , 2014, BMC Systems Biology.

[7]  James Aspnes,et al.  An Introduction to Population Protocols , 2007, Bull. EATCS.

[8]  Bernard Mans,et al.  On the exploration of time-varying networks , 2013, Theor. Comput. Sci..

[9]  Paul G. Spirakis,et al.  New Models for Population Protocols , 2011, Synthesis Lectures on Distributed Computing Theory.

[10]  Dan Alistarh,et al.  Polylogarithmic-Time Leader Election in Population Protocols , 2015, ICALP.

[11]  Rachid Guerraoui,et al.  Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures , 2009, ICALP.

[12]  Ho-Lin Chen,et al.  Speed faults in computation by chemical reaction networks , 2014, Distributed Computing.

[13]  David Eisenstat,et al.  The computational power of population protocols , 2006, Distributed Computing.

[14]  Paul G. Spirakis,et al.  Mediated Population Protocols , 2009, ICALP.

[15]  Amit Kumar,et al.  Connectivity and inference problems for temporal networks , 2000, STOC '00.

[16]  Paul G. Spirakis,et al.  On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols , 2015, ICALP.

[17]  David Soloveichik,et al.  Stable leader election in population protocols requires linear time , 2015, Distributed Computing.

[18]  Thomas Erlebach,et al.  On Temporal Graph Exploration , 2015, ICALP.

[19]  David Eisenstat,et al.  Fast computation by population protocols with a leader , 2006, Distributed Computing.

[20]  K. Berman.  Vulnerability of scheduled networks and a generalization of Menger's Theorem , 1996, Networks.

[21]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[22]  Nancy A. Lynch,et al.  Distributed computation in dynamic networks , 2010, STOC '10.

[23]  David Doty,et al.  Theory of algorithmic self-assembly , 2012, CACM.

[24]  Chen Avin,et al.  How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs) , 2008, ICALP.

[25]  Paul G. Spirakis,et al.  Causality, influence, and computation in possibly disconnected synchronous dynamic networks , 2012, J. Parallel Distributed Comput..

[26]  Dana Angluin,et al.  Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.

[27]  Othon Michail,et al.  An Introduction to Temporal Graphs: An Algorithmic Perspective* , 2015, Internet Math..

[28]  Paul G. Spirakis,et al.  Simple and efficient local codes for distributed stable network construction , 2013, Distributed Computing.

[29]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[30]  Paul G. Spirakis,et al.  Temporal Network Optimization Subject to Connectivity Constraints , 2013, Algorithmica.

[31]  Andrea E. F. Clementi,et al.  Flooding time in edge-Markovian dynamic graphs , 2008, PODC '08.

[32]  Radhika Nagpal,et al.  Programmable self-assembly in a thousand-robot swarm , 2014, Science.

[33]  Kenneth A. Berman,et al.  Vulnerability of scheduled networks and a generalization of Menger's Theorem , 1996, Networks.

[34]  Gregory Mone,et al.  The new smart cities , 2015, Commun. ACM.

[35]  Fabian Kuhn,et al.  Dynamic networks: models and algorithms , 2011, SIGA.

[36]  Paul G. Spirakis,et al.  Passively mobile communicating machines that use restricted space , 2011, FOMC '11.

[37]  David Doty,et al.  Timing in chemical reaction networks , 2013, SODA.

[38]  Nicola Santoro,et al.  Time-varying graphs and dynamic networks , 2010, Int. J. Parallel Emergent Distributed Syst..

[39]  Paul G. Spirakis,et al.  How many cooks spoil the soup? , 2017, Distributed Computing.

[40]  Paul G. Spirakis,et al.  Ephemeral networks with random availability of links: The case of fast networks , 2016, J. Parallel Distributed Comput..