3 citations · 4 across the 9 of their papers we have counts for
16 papers
Complexity of Reconfiguration in Surface Chemical Reaction Networks
Robert M. Alaniz, Josh Brunner, Michael Coulombe +9
We analyze the computational complexity of basic reconfiguration problems for the recently introduced surface Chemical Reaction Networks (sCRNs), where ordered pairs of adjacent sp…
Building Squares with Optimal State Complexity in Restricted Active Self-Assembly
Robert M. Alaniz, David Caballero, Sonya C. Cirlos +6
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…
Reachability in Restricted Chemical Reaction Networks
Robert M. Alaniz, Bin Fu, Timothy Gomez +5
The popularity of molecular computation has given rise to several models of abstraction, one of the more recent ones being Chemical Reaction Networks (CRNs). These are equivalent t…
Unique Assembly Verification in Two-Handed Self-Assembly
David Caballero, Timothy Gomez, Robert Schweller +1
One of the most fundamental and well-studied problems in Tile Self-Assembly is the Unique Assembly Verification (UAV) problem. This algorithmic problem asks whether a given tile sy…
Hardness of Reconfiguring Robot Swarms with Uniform External Control in Limited Directions
David Caballero, Angel A. Cantu, Timothy Gomez +3
Motivated by advances is nanoscale applications and simplistic robot agents, we look at problems based on using a global signal to move all agents when given a limited number of di…
Covert Computation in Self-Assembled Circuits
Angel A. Cantu, Austin Luchsinger, Robert Schweller +1
Traditionally, computation within self-assembly models is hard to conceal because the self-assembly process generates a crystalline assembly whose computational history is inherent…
Full Tilt: Universal Constructors for General Shapes with Uniform External Forces
Jose Balanza-Martinez, David Caballero, Angel A. Cantu +6
We investigate the problem of assembling general shapes and patterns in a model in which particles move based on uniform external forces until they encounter an obstacle. While pre…
Crazy Sequential Representations of Numbers for Small Bases
Tim Wylie
Throughout history, recreational mathematics has always played a prominent role in advancing research. Following in this tradition, in this paper we extend some recent work with cr…
Verification in Staged Tile Self-Assembly
Robert Schweller, Andrew Winslow, Tim Wylie
We prove the unique assembly and unique shape verification problems, benchmark measures of self-assembly model power, are -hard and contained in $\math…
Self-Assembly of Shapes at Constant Scale using Repulsive Forces
Austin Luchsinger, Robert Schweller, Tim Wylie
The algorithmic self-assembly of shapes has been considered in several models of self-assembly. For the problem of \emph{shape construction}, we consider an extended version of the…
Universal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces
Cameron Chalk, Erik D. Demaine, Martin L. Demaine +4
We show how to design a universal shape replicator in a self-assembly system with both attractive and repulsive forces. More precisely, we show that there is a universal set of con…
An Interesting Gadget for Chain Pair Simplification
Tim Wylie
In this paper we present an interesting gadget based on the chain pair simplification problem under the discrete Fréchet distance (CPS-3F), which allows the construction of arbitra…
Optimal Staged Self-Assembly of General Shapes
Cameron Chalk, Eric Martinez, Robert Schweller +3
We analyze the number of tile types , bins , and stages necessary to assemble squares and scaled shapes in the staged tile assembly model. For squar…
Concentration Independent Random Number Generation in Tile Self-Assembly
Cameron Chalk, Bin Fu, Eric Martinez +2
In this paper we introduce the \emph{robust random number generation} problem where the goal is to design an abstract tile assembly system (aTAM system) whose terminal assemblies c…
On the Chain Pair Simplification Problem
Chenglin Fan, Omrit Filtser, Matthew J. Katz +2
The problem of efficiently computing and visualizing the structural resemblance between a pair of protein backbones in 3D has led Bereg et al. to pose the Chain Pair Simplification…
Intermittent Map Matching with the Discrete Fréchet Distance
Tim Wylie, Binhai Zhu
In this paper we focus on the map matching problem where the goal is to find a path through a planar graph such that the path through the vertices closely matches a given polygonal…