Filtrer vos résultats
- 4
- 3
- 6
- 1
- 7
- 1
- 2
- 1
- 1
- 1
- 1
- 7
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 7
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
7 résultats
|
|
|
triés par
|
|
|
Lower bounds on the computational power of an optical model of computationNatural Computing, 2008, 7 (1), pp.95 - 108. ⟨10.1007/s11047-007-9039-7⟩
Article dans une revue
hal-01354830v1
|
||
|
|
The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulationSTOC 2017 - Theory Fest 49th Annual ACM Symposium on the Theory of Computing, Jun 2017, Montréal, Canada. pp.328-341, ⟨10.1145/3055399.3055446⟩
Communication dans un congrès
hal-01659730v1
|
||
|
|
Intrinsic Universality in Self-Assembly27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.275-286
Communication dans un congrès
inria-00455225v1
|
||
|
|
Tag Systems and the Complexity of Simple Programs21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2015, Turku, Finland. pp.11-16, ⟨10.1007/978-3-662-47221-7_2⟩
Communication dans un congrès
hal-01442479v1
|
||
|
|
Intrinsic universality in tile self-assembly requires cooperationSODA 2014, Jan 2014, United States. pp. 752-771, ⟨10.1137/1.9781611973402.56⟩
Communication dans un congrès
hal-00943802v1
|
||
|
|
Thermodynamic Binding NetworksDNA 2017 - The 23rd International Conference on DNA Computing and Molecular Programming, Sep 2017, Austin, United States. pp.249-266, ⟨10.1007/978-3-319-66799-7_16⟩
Communication dans un congrès
hal-01662285v1
|
||
|
|
The program-size complexity of self-assembled paths52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC 2020), Jun 2020, Chicago, IL, United States. pp.727--737, ⟨10.1145/3357713.3384263⟩
Communication dans un congrès
hal-02866950v1
|