13621 search results - page 18 / 2725 » Computability and Complexity in Self-assembly |
149
click to vote
SIGSOFT
2007
ACM
16 years 5 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
140
click to vote
CASES
2009
ACM
15 years 2 months ago
2009
ACM
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
138
click to vote
CRYPTO
2006
Springer
15 years 8 months ago
2006
Springer
We present a robust multiparty computation protocol. The protocol is for the cryptographic model with open channels and a polytime adversary, and allows n parties to actively secur...
172
click to vote
TCS
2010
15 years 2 months ago
2010
We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The ge...
136
click to vote
IWANN
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. A new algorithm is presented for finding genotype-phenotype association rules from data related to complex diseases. The algorithm was based on Genetic Algorithms, a tech...