David Soloveichik

Orcid: 0000-0002-2585-4120

According to our database1, David Soloveichik authored at least 44 papers between 2005 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Rate-independent Computation in Continuous Chemical Reaction Networks.
J. ACM, June, 2023

Harvesting Brownian Motion: Zero Energy Computational Sampling.
CoRR, 2023

Thermodynamically Driven Signal Amplification.
Proceedings of the 29th International Conference on DNA Computing and Molecular Programming, 2023

Optimal Information Encoding in Chemical Reaction Networks.
Proceedings of the 29th International Conference on DNA Computing and Molecular Programming, 2023

2021
Composable Rate-Independent Computation in Continuous Chemical Reaction Networks.
IEEE ACM Trans. Comput. Biol. Bioinform., 2021

Programming Substrate-Independent Kinetic Barriers With Thermodynamic Binding Networks.
IEEE ACM Trans. Comput. Biol. Bioinform., 2021

The Spooky Pebble Game.
CoRR, 2021

Programming and Training Rate-Independent Chemical Reaction Networks.
CoRR, 2021

Molecular Machines from Topological Linkages.
Proceedings of the 27th International Conference on DNA Computing and Molecular Programming, 2021

2020
CRN++: Molecular programming language.
Nat. Comput., 2020

Deep Molecular Programming: A Natural Implementation of Binary-Weight ReLU Neural Networks.
Proceedings of the 37th International Conference on Machine Learning, 2020

CRNs Exposed: A Method for the Systematic Exploration of Chemical Reaction Networks.
Proceedings of the 26th International Conference on DNA Computing and Molecular Programming, 2020

2019
Computing properties of stable configurations of thermodynamic binding networks.
Theor. Comput. Sci., 2019

CRNs Exposed: Systematic Exploration of Chemical Reaction Networks.
CoRR, 2019

SIMD||DNA: Single Instruction, Multiple Data Computation with DNA Strand Displacement Cascades.
Proceedings of the DNA Computing and Molecular Programming - 25th International Conference, 2019

2018
Democratic, existential, and consensus-based output conventions in stable computation by chemical reaction networks.
Nat. Comput., 2018

Stable leader election in population protocols requires linear time.
Distributed Comput., 2018

: Molecular Programming Language.
Proceedings of the DNA Computing and Molecular Programming - 24th International Conference, 2018

2017
Speed faults in computation by chemical reaction networks.
Distributed Comput., 2017

Computing properties of stable configurations of thermodynamic binding networks.
CoRR, 2017

Hardness of Computing and Approximating Predicates and Functions with Leaderless Population Protocols.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

The Design Space of Strand Displacement Cascades with Toehold-Size Clamps.
Proceedings of the DNA Computing and Molecular Programming - 23rd International Conference, 2017

Thermodynamic Binding Networks.
Proceedings of the DNA Computing and Molecular Programming - 23rd International Conference, 2017

Robust Detection in Leak-Prone Population Protocols.
Proceedings of the DNA Computing and Molecular Programming - 23rd International Conference, 2017

2016
Probability 1 computation with chemical reaction networks.
Nat. Comput., 2016

Robustness of Expressivity in Chemical Reaction Networks.
Proceedings of the DNA Computing and Molecular Programming - 22nd International Conference, 2016

2015
Preface.
Nat. Comput., 2015

Leakless DNA Strand Displacement Systems.
Proceedings of the DNA Computing and Molecular Programming - 21st International Conference, 2015

2014
Deterministic function computation with chemical reaction networks.
Nat. Comput., 2014

Rate-independent computation in continuous chemical reaction networks.
Proceedings of the Innovations in Theoretical Computer Science, 2014

NINJA: boolean modelling and formal verification of tiered-rate chemical reaction networks (extended abstract).
Proceedings of the 5th ACM Conference on Bioinformatics, 2014

2011
Erratum to "The computational power of Benenson automata" [Theoret. Comput. Sci. 344 (2005) 279-297]
Theor. Comput. Sci., 2011

2010
Parallelism, Program Size, Time, and Temperature in Self-Assembly.
Electron. Colloquium Comput. Complex., 2010

Efficient Turing-Universal Computation with DNA Polymers.
Proceedings of the DNA Computing and Molecular Programming - 16th International Conference, 2010

2009
Robust Stochastic Chemical Reaction Networks and Bounded Tau-Leaping.
J. Comput. Biol., 2009

Time-Complexity of Multilayered DNA Strand Displacement Circuits.
Proceedings of the DNA Computing and Molecular Programming, 15th International Conference, 2009

Programmability of Chemical Reaction Networks.
Proceedings of the Algorithmic Bioprocesses, 2009

2008
Computation with finite stochastic chemical reaction networks.
Nat. Comput., 2008

Combining self-healing and proofreading in self-assembly.
Nat. Comput., 2008

Statistical Learning of Arbitrary Computable Classifiers
CoRR, 2008

DNA as a Universal Substrate for Chemical Kinetics.
Proceedings of the DNA Computing, 14th International Meeting on DNA Computing, 2008

2007
Complexity of Self-Assembled Shapes.
SIAM J. Comput., 2007

2005
The computational power of Benenson automata.
Theor. Comput. Sci., 2005

Complexity of Compact Proofreading for Self-assembled Patterns.
Proceedings of the DNA Computing, 11th International Workshop on DNA Computing, 2005


  Loading...