Concentration independent random number generation in tile self-assembly
From MaRDI portal
Publication:511914
DOI10.1016/j.tcs.2016.12.021zbMath1359.68068arXiv1506.00680OpenAlexW2962800744MaRDI QIDQ511914
Eric Martinez, Bin Fu, Cameron T. Chalk, Tim Wylie, Robert T. Schweller
Publication date: 22 February 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.00680
Cites Work
- Unnamed Item
- Unnamed Item
- An introduction to tile-based self-assembly and a survey of recent results
- Negative interactions in irreversible self-assembly
- Fast arithmetic in algorithmic self-assembly
- Self-assembly with Geometric Tiles
- Flipping Tiles: Concentration Independent Coin Flips in Tile Self-Assembly
- Exact Shapes and Turing Universality at Temperature 1 with a Single Negative Glue
- Tile Complexity of Linear Assemblies
- Random Number Selection in Self-assembly
- The program-size complexity of self-assembled squares (extended abstract)
- Randomized Self-assembly for Approximate Shapes
- One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile
- Complexities for Generalized Models of Self-Assembly
- Universal Computation with Arbitrary Polyomino Tiles in Non-Cooperative Self-Assembly
- Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time
- Randomized Self-Assembly for Exact Shapes
- Complexity of Self‐Assembled Shapes
- DNA Computing
