scientific article; zbMATH DE number 7278016

DOI10.4230/LIPIcs.ISAAC.2017.11zbMath1457.68120arXiv1709.06299MaRDI QIDQ5136226

Sándor P. Fekete, Christian Scheffer, Dominik Krupke, Phillip Keldenich, Christian Rieck, Arne Schmidt, Aaron Becker

Publication date: 25 November 2020

Full work available at URL: https://arxiv.org/abs/1709.06299

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximationhardnessprogrammable mattertile assemblytiltmicro-factories

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (2)

Particle-based assembly using precise global control ⋮ Connected reconfiguration of lattice-based cellular structures by finite-memory robots

Cites Work

• Unnamed Item
• New geometric algorithms for fully connected staged self-assembly
• Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
• Reconfiguring massive particle swarms with limited, global control
• Parallelism and Time in Hierarchical Self-Assembly

This page was built for publication: