We first give an introduction to the field of tile-based self-assembly, focusing primarily on
theoretical models and their algorithmic nature. We start with a description of Winfree's …

The field of algorithmic self-assembly is concerned with the computational and expressive
power of nanoscale self-assembling molecular systems. In the well-studied cooperative, or …

Tile Automata is a recently defined model of self-assembly that borrows many concepts from
cellular automata to create active self-assembling systems where changes may be occurring …

We prove a Pum** Lemma for the noncooperative abstract Tile Assembly Model, a model
central to the theory of algorithmic self-assembly since the beginning of the field. This theory …

In this paper we define the Dupled abstract Tile Assembly Model (DaTAM), which is a slight
extension to the abstract Tile Assembly Model (aTAM) that allows for not only the standard …

We analyze the number of tile types t, bins b, and stages necessary to assemble n * nn× n
squares and scaled shapes in the staged tile assembly model. For n * nn× n squares, we …

We provide a complete characterisation of all final states of a model called directed non-
cooperative tile self-assembly, also called directed temperature 1 tile assembly, which …

In this paper we present a series of results which show separations between the standard
seeded model of self-assembly, Winfree's abstract Tile Assembly Model (aTAM), and the …

Algorithmic self-assembly has been an active area of research at the intersection of
computer science, chemistry, and mathematics for almost two decades now, motivated by …

This habilitation à diriger des recherches deals with tilings, a computational model where
tiles are bound together in order to do computation as complex as the ones done by Turing …