From post

Experimental progress in computation by self-assembly of DNA tilings.

, , и . DNA Based Computers, том 54 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 123-140. DIMACS/AMS, (1999)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs., , и . Algorithmica, 17 (4): 399-415 (1997)Efficient Parallel Computation of the Characteristic Polynomial of a Sparse, Separable Matrix.. Algorithmica, 29 (3): 487-510 (2001)Logarithmic Depth Circuits for Algebraic Functions.. SIAM J. Comput., 15 (1): 231-242 (1986)The Light Bulb Problem., , и . COLT, стр. 261-268. Morgan Kaufmann, (1989)Tile Complexity of Linear Assemblies., , и . SIAM J. Comput., 41 (4): 1051-1073 (2012)Dynamic Algebraic Algorithms., и . SODA, стр. 290-301. ACM/SIAM, (1994)On energy-minimizing paths on terrains for a mobile robot., и . ICRA, стр. 3782-3788. IEEE, (2003)Temporal DNA Barcodes: A Time-Based Approach for Single-Molecule Imaging., и . DNA, том 11145 из Lecture Notes in Computer Science, стр. 71-86. Springer, (2018)Image Compression Methods with Distortion Controlled Capabilities., и . Data Compression Conference, стр. 93-102. IEEE Computer Society, (1991)Models and Resource Metrics for Parallel and Distributed Computation.. IPPS, стр. 404. IEEE Computer Society, (1994)