Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleJuly 2001
Running time and program size for self-assembled squares
STOC '01: Proceedings of the thirty-third annual ACM symposium on Theory of computingPages 740–748https://doi.org/10.1145/380752.380881Recently Rothemund and Winfree [6] have considered the program size complexity of constructing squares by self-assembly. Here, we consider the time complexity of such constructions using a natural generalization of the Tile Assembly Model defined in [6]...
- ArticleJuly 2001
Computing with continuous-time Liapunov systems
STOC '01: Proceedings of the thirty-third annual ACM symposium on Theory of computingPages 722–731https://doi.org/10.1145/380752.380878We establish a fundamental result in the theory of computation by continuous-time dynamical systems, by showing that systems corresponding to so called continuous-time symmetric Hopfield nets are capable of general computation. More precisely, we prove ...
- ArticleJuly 2001
Estimating true evolutionary distances between genomes
STOC '01: Proceedings of the thirty-third annual ACM symposium on Theory of computingPages 637–646https://doi.org/10.1145/380752.380861Evolution operates on whole genomes by operations that change the order and strandedness of genes within the genomes. This type of data presents new opportunities for discoveries about deep evolutionary rearrangement events, provided that sufficiently ...
- ArticleJuly 2001
Concurrent and resettable zero-knowledge in poly-loalgorithm rounds
STOC '01: Proceedings of the thirty-third annual ACM symposium on Theory of computingPages 560–569https://doi.org/10.1145/380752.380851A proof is concurrent zero-knowledge if it remains zero-knowledge when many copies of the proof are run in an asynchronous environment, such as the Internet. Richardson and Kilian have shown that there exists a concurrent zero-knowledge proof for any ...