The following pages link to David Doty (Q268442):
Displaying 50 items.
- Deterministic function computation with chemical reaction networks (Q268444) (← links)
- Program size and temperature in self-assembly (Q494811) (← links)
- Limitations of self-assembly at temperature 1 (Q616501) (← links)
- Constructive dimension and Turing degrees (Q733739) (← links)
- Pushdown dimension (Q995564) (← links)
- Dimension extractors and optimal decompression (Q1015378) (← links)
- Speed faults in computation by chemical reaction networks (Q1689751) (← links)
- Thermodynamic binding networks (Q1694444) (← links)
- Programming substrate-independent kinetic barriers with thermodynamic binding networks (Q1796501) (← links)
- Negative interactions in irreversible self-assembly (Q1949756) (← links)
- Producibility in hierarchical self-assembly (Q2003445) (← links)
- Leaderless deterministic chemical reaction networks (Q2003464) (← links)
- Composable computation in discrete chemical reaction networks (Q2064055) (← links)
- ppsim: a software package for efficiently simulating and visualizing population protocols (Q2142123) (← links)
- A survey of size counting in population protocols (Q2243584) (← links)
- Probability 1 computation with chemical reaction networks (Q2311222) (← links)
- Finite-state dimension and real arithmetic (Q2461795) (← links)
- Robustness of Expressivity in Chemical Reaction Networks (Q2835703) (← links)
- Fast Algorithmic Self-assembly of Simple Shapes Using Random Agitation (Q2921470) (← links)
- Probability 1 Computation with Chemical Reaction Networks (Q2921471) (← links)
- Producibility in Hierarchical Self-assembly (Q2945534) (← links)
- Pattern overlap implies runaway growth in hierarchical tile systems (Q2970463) (← links)
- Rate-independent computation in continuous chemical reaction networks (Q2988890) (← links)
- Scalable, Time-Responsive, Digital, Energy-Efficient Molecular Circuits Using DNA Strand Displacement (Q3070960) (← links)
- Program Size and Temperature in Self-Assembly (Q3104639) (← links)
- Intrinsic Universality in Self-Assembly (Q3113756) (← links)
- Random Number Selection in Self-assembly (Q3184765) (← links)
- (Q3191568) (← links)
- A Domain-Specific Language for Programming in the Tile Assembly Model (Q3654669) (← links)
- Limitations of Self-assembly at Temperature One (Q3654670) (← links)
- (Q5111475) (← links)
- Computational Complexity of Atomic Chemical Reaction Networks (Q5127181) (← links)
- Composable Computation in Discrete Chemical Reaction Networks (Q5145173) (← links)
- Efficient Size Estimation and Impossibility of Termination in Uniform Dense Population Protocols (Q5145176) (← links)
- Leaderless Deterministic Chemical Reaction Networks (Q5168497) (← links)
- Randomized Self-Assembly for Exact Shapes (Q5171166) (← links)
- Deterministic Function Computation with Chemical Reaction Networks (Q5200596) (← links)
- (Q5365065) (← links)
- Pattern Overlap Implies Runaway Growth in Hierarchical Tile Systems (Q5368699) (← links)
- Timing in chemical reaction networks (Q5384018) (← links)
- Randomized Self-Assembly for Exact Shapes (Q5390605) (← links)
- Feasible Depth (Q5425324) (← links)
- Constructive Dimension and Weak Truth-Table Degrees (Q5426866) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492865) (← links)
- Speed Faults in Computation by Chemical Reaction Networks (Q5498695) (← links)
- Parallelism and Time in Hierarchical Self-Assembly (Q5737807) (← links)
- (Q5743467) (← links)
- Logical Approaches to Computational Barriers (Q5898813) (← links)
- Stable leader election in population protocols requires linear time (Q5915694) (← links)
- (Q6076669) (← links)
