Terminating distributed construction of shapes and patterns in a fair solution of automata
暂无分享,去创建一个
[1] Shawn M. Douglas,et al. A Logic-Gated Nanorobot for Targeted Transport of Molecular Payloads , 2012, Science.
[2] Dana Angluin,et al. Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.
[3] Hagit Attiya,et al. Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .
[4] David Eisenstat,et al. The computational power of population protocols , 2006, Distributed Computing.
[5] Paul G. Spirakis,et al. Mediated Population Protocols , 2009, ICALP.
[6] Damien Woods,et al. Parallel computation using active self-assembly , 2014, Natural Computing.
[7] Ferdinand Peper,et al. Massively parallel computing on an organic molecular layer , 2010, ArXiv.
[8] James Aspnes,et al. An Introduction to Population Protocols , 2007, Bull. EATCS.
[9] Christian Scheideler,et al. J ul 2 01 3 Ameba-inspired Self-organizing Particle Systems ( Extended Abstract ) , 2014 .
[10] Nancy A. Lynch,et al. Distributed Algorithms , 1992, Lecture Notes in Computer Science.
[11] E. Hall,et al. The nature of biotechnology. , 1988, Journal of biomedical engineering.
[12] Shay Kutten,et al. On utilizing speed in networks of mobile agents , 2010, PODC '10.
[13] Othon Michail. Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata , 2015, PODC.
[14] Xingsi Zhong,et al. Exponential replication of patterns in the signal tile assembly model , 2014, Natural Computing.
[15] Michael J. Fischer,et al. Computation in networks of passively mobile finite-state sensors , 2004, PODC '04.
[16] M. Sahani,et al. Algorithmic Self-Assembly of DNA , 2006 .
[17] P. Rothemund. Folding DNA to create nanoscale shapes and patterns , 2006, Nature.
[18] Erik D. Demaine,et al. Efficient Reconfiguration of Lattice-Based Modular Robots , 2013, ECMR.
[19] Hagit Attiya,et al. Distributed computing - fundamentals, simulations, and advanced topics (2. ed.) , 2004, Wiley series on parallel and distributed computing.
[20] Jacob Hendricks,et al. Replication of Arbitrary Hole-Free Shapes via Self-assembly with Signal-Passing Tiles , 2015, UCNC.
[21] Feller William,et al. An Introduction To Probability Theory And Its Applications , 1950 .
[22] Paul G. Spirakis,et al. Passively mobile communicating machines that use restricted space , 2011, FOMC '11.
[23] David Doty,et al. Timing in chemical reaction networks , 2013, SODA.
[24] Michael L. Manapat,et al. Spontaneous network formation among cooperative RNA replicators , 2012, Nature.
[25] Paul G. Spirakis,et al. Elements of the theory of dynamic networks , 2018, Commun. ACM.
[26] Matthew J. Patitz,et al. Asynchronous signal Passing for Tile Self-assembly: Fuel Efficient Computation and Efficient assembly of Shapes , 2012, Int. J. Found. Comput. Sci..
[27] Paul G. Spirakis,et al. New Models for Population Protocols , 2011, Synthesis Lectures on Distributed Computing Theory.
[28] David Doty,et al. Theory of algorithmic self-assembly , 2012, CACM.
[29] Christian Scheideler,et al. Universal Shape Formation for Programmable Matter , 2016, SPAA.
[30] Matthew Cook,et al. Computation with finite stochastic chemical reaction networks , 2008, Natural Computing.
[31] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .
[32] Erik Winfree,et al. Active self-assembly of algorithmic shapes and patterns in polylogarithmic time , 2013, ITCS '13.
[33] Erik D. Demaine,et al. Shape replication through self-assembly and RNase enzymes , 2010, SODA '10.
[34] Radhika Nagpal,et al. Programmable self-assembly in a thousand-robot swarm , 2014, Science.
[35] Nicola Santoro,et al. On the computational power of oblivious robots: forming a series of geometric patterns , 2010, PODC '10.
[36] Masafumi Yamashita,et al. Distributed Anonymous Mobile Robots: Formation of Geometric Patterns , 1999, SIAM J. Comput..
[37] M. Kac. Random Walk and the Theory of Brownian Motion , 1947 .
[38] Nicola Santoro,et al. Forming sequences of geometric patterns with oblivious mobile robots , 2015, Distributed Computing.
[39] W. McCarthy. Programmable matter , 2000, Nature.
[40] Erik D. Demaine,et al. Universal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces , 2017, SODA.
[41] Marcin Paprzycki,et al. Distributed Computing: Fundamentals, Simulations and Advanced Topics , 2001, Scalable Comput. Pract. Exp..
[42] Joel L. Schiff,et al. Cellular Automata: A Discrete View of the World (Wiley Series in Discrete Mathematics & Optimization) , 2007 .
[43] L M Adleman,et al. Molecular computation of solutions to combinatorial problems. , 1994, Science.
[44] Paul G. Spirakis,et al. Terminating population protocols via some minimal global knowledge assumptions , 2012, J. Parallel Distributed Comput..
[45] Ho-Lin Chen,et al. Deterministic function computation with chemical reaction networks , 2012, Natural Computing.
[46] Shuguang Zhang. Fabrication of novel biomaterials through molecular self-assembly , 2003, Nature Biotechnology.
[47] Rachid Guerraoui,et al. Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures , 2009, ICALP.
[48] David Eisenstat,et al. Fast computation by population protocols with a leader , 2006, Distributed Computing.
[49] Yukiko Yamauchi,et al. Shape formation by programmable particles , 2017, Distributed Computing.
[50] Paul G. Spirakis,et al. On the Transformation Capability of Feasible Mechanisms for Programmable Matter , 2017, ICALP.
[51] Erik Winfree,et al. The program-size complexity of self-assembled squares (extended abstract) , 2000, STOC '00.
[52] 利久 亀井,et al. California Institute of Technology , 1958, Nature.
[53] Muaz A. Niazi,et al. Technical Problems With "Programmable self-assembly in a thousand-robot swarm" , 2014, ArXiv.
[54] P. A. P. Moran,et al. An introduction to probability theory , 1968 .
[55] Paul G. Spirakis,et al. Simple and efficient local codes for distributed stable network construction , 2013, Distributed Computing.
[56] Christian Scheideler,et al. Amoebot - a new model for programmable matter , 2014, SPAA.