747 search results - page 15 / 150 » Theory and Construction of Molecular Computers |
ASIACRYPT
1991
Springer
14 years 4 days ago
1991
Springer
In [1] a construction of a block cipher from a single pseudorandom permutation is proposed. In a complexity theoretical setting they prove that this scheme is secure against a pol...
DNA
2005
Springer
14 years 2 months ago
2005
Springer
In the field of DNA computing, more and more efforts are made for constructing molecular machines made of DNA that work in vitro or in vivo. States of some of those machines are...
BIRTHDAY
2010
Springer
13 years 9 months ago
2010
Springer
In the early 1920s, Pavel Urysohn proved his famous lemma (sometimes referred to as "first non-trivial result of point set topology"). Among other applications, this lemm...
JIB
2006
13 years 8 months ago
2006
The accessible surface of a macromolecule is a significant determinant of its action. The interaction between biomolecules or protein-ligand is dependent on their surfaces rather ...
ISSAC
2005
Springer
14 years 2 months ago
2005
Springer
Symmetric and semisymmetric graphs are used in many scientific domains, especially parallel computation and interconnection networks. The industry and the research world make a h...