Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
From MaRDI portal
Publication:2986885
DOI10.1145/2422436.2422476zbMath1361.68086arXiv1301.2626OpenAlexW2084011432WikidataQ59328911 ScholiaQ59328911MaRDI QIDQ2986885
Damien Woods, Peng Yin, Nadine Dabby, Erik Winfree, Ho-Lin Chen, Scott Goodfriend
Publication date: 16 May 2017
Published in: Proceedings of the 4th conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.2626
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Biochemistry, molecular biology (92C40)
Related Items
Improved Leader Election for Self-organizing Programmable Matter ⋮ Terminating distributed construction of shapes and patterns in a fair solution of automata ⋮ Shape formation by programmable particles ⋮ Pushing lines helps: efficient universal centralised transformations for programmable matter ⋮ Leader Election and Shape Formation with Self-organizing Programmable Matter ⋮ The canonical amoebot model: algorithms and concurrency control ⋮ On geometric shape construction via growth operations ⋮ Centralised connectivity-preserving transformations by rotation: 3 musketeers for all orthogonal convex shapes ⋮ The complexity of growing a graph ⋮ On geometric shape construction via growth operations ⋮ Building squares with optimal state complexity in restricted active self-assembly ⋮ A stochastic approach to shortcut bridging in programmable matter ⋮ Network Constructors: A Model for Programmable Matter ⋮ Unnamed Item ⋮ CADbots: algorithmic aspects of manipulating programmable matter with finite automata ⋮ Shape recognition by a finite automaton robot ⋮ On the transformation capability of feasible mechanisms for programmable matter ⋮ Tight bounds for active self-assembly using an insertion primitive ⋮ Connectivity preserving network transformers ⋮ A minimal requirement for self-assembly of lines in polylogarithmic time ⋮ Parallel Computation Using Active Self-assembly ⋮ Iterative Self-assembly with Dynamic Strength Transformation and Temperature Control ⋮ Fast arithmetic in algorithmic self-assembly ⋮ Parallel computation using active self-assembly ⋮ Signal transmission across tile assemblies: 3D static tiles simulate active self-assembly by 2D signal-passing tiles ⋮ Forming tile shapes with simple robots ⋮ Connectivity Preserving Network Transformers ⋮ Simple and efficient local codes for distributed stable network construction ⋮ On efficient connectivity-preserving transformations in a grid ⋮ Connected reconfiguration of lattice-based cellular structures by finite-memory robots ⋮ Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach ⋮ Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach ⋮ Distributed transformations of Hamiltonian shapes based on line moves ⋮ Distributed transformations of Hamiltonian shapes based on line moves ⋮ On the Runtime of Universal Coating for Programmable Matter ⋮ An introduction to tile-based self-assembly and a survey of recent results
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Teachability in computational learning
- Measuring teachability using variants of the teaching dimension
- Teaching a smarter learner.
- Occam's razor
- Pseudorandom generators for space-bounded computation
- On the power of inductive inference from good examples
- A model of interactive teaching
- Learning from different teachers
- On the limits of efficient teachability
- In search of an easy witness: Exponential time vs. probabilistic polynomial time.
- On the complexity of teaching
- On specifying Boolean functions by labelled examples
- Recent Developments in Algorithmic Teaching
- A theory of the learnable
- Teaching Randomized Learners
- Algorithmic Learning Theory
- A theory of goal-oriented communication
- Derandomizing polynomial identity tests means proving circuit lower bounds
This page was built for publication: Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
