447 | -- | 452 | Tal Mor, Renato Renner. Preface |
453 | -- | 458 | Charles H. Bennett, Gilles Brassard, Seth Breidbart. Quantum Cryptography II: How to re-use a one-time pad safely even if P=NP |
459 | -- | 467 | Gregg S. Jaeger, Alexander V. Sergienko. Entanglement sudden death: a threat to advanced quantum key distribution? |
469 | -- | 486 | Ivan Damgård, Thomas Brochmann Pedersen 0002, Louis Salvail. How to re-use a one-time pad safely and almost optimally even if P = NP |
487 | -- | 495 | Thomas Durt, Alex Hermanne. Cryptographic encryption scheme based on metastable excited nuclei |
497 | -- | 498 | Darko Stefanovic, Andrew J. Turberfield. Preface |
499 | -- | 516 | Anne Condon, Bonnie Kirkpatrick, Ján Manuch. Reachability bounds for chemical reaction networks and strand displacement systems |
517 | -- | 534 | Ho-Lin Chen, David Doty, David Soloveichik. Deterministic function computation with chemical reaction networks |
535 | -- | 547 | Petr Sulc, Thomas E. Ouldridge, Flavio Romano, Jonathan P. K. Doye, Ard A. Louis. Simulating a burnt-bridges DNA motor with a coarse-grained DNA model |
549 | -- | 557 | Iñaki Sainz de Murieta, Alfonso Rodríguez-Patón. Probabilistic reasoning with a Bayesian DNA device based on strand displacement |
559 | -- | 572 | Nathanael Aubert, Yannick Rondelez, Teruo Fujii, Masami Hagiya. Enforcing logical delays in DNA computing systems |
573 | -- | 581 | Anton Kan, Yoko Sakai, Ko-ichiroh Shohda, Akira Suyama. A DNA based molecular logic gate capable of a variety of logical operations |
583 | -- | 595 | Peter B. Allen, Xi Chen, Zack B. Simpson, Andrew D. Ellington. Modeling scalable pattern generation in DNA reaction networks |