Particle-based assembly using precise global control
From MaRDI portal
Publication:5918538
DOI10.1007/s00453-022-00992-2OpenAlexW3163069634MaRDI QIDQ5918538
Jakob Keller, Christian Scheffer, Arne Schmidt, Christian Rieck
Publication date: 6 October 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-022-00992-2
Cites Work
- Unnamed Item
- An introduction to tile-based self-assembly and a survey of recent results
- New geometric algorithms for fully connected staged self-assembly
- Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
- Optimal staged self-assembly of general shapes
- Reconfiguring massive particle swarms with limited, global control
- Optimal staged self-assembly of linear assemblies
- Tilt assembly: algorithms for micro-factories that build objects with uniform external forces
- Nearly constant tile complexity for any shape in two-handed tile assembly
- Self-assembly with Geometric Tiles
- The program-size complexity of self-assembled squares (extended abstract)
- Hierarchical Shape Construction and Complexity for Slidable Polyominoes under Uniform External Forces
- One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile
- Full Tilt: Universal Constructors for General Shapes with Uniform External Forces
- OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE
- Complexity of Self‐Assembled Shapes
- Parallelism and Time in Hierarchical Self-Assembly
- Particle-based assembly using precise global control
- Fast reconfiguration of robot swarms with uniform control signals
- Particle computation: complexity, algorithms, and logic
This page was built for publication: Particle-based assembly using precise global control
