Published in: LIPIcs, Volume 276, 29th International Conference on DNA Computing and Molecular Programming (DNA 29) (2023)
Ahmed Shalaby, Chris Thachuk, and Damien Woods. Minimum Free Energy, Partition Function and Kinetics Simulation Algorithms for a Multistranded Scaffolded DNA Computer. In 29th International Conference on DNA Computing and Molecular Programming (DNA 29). Leibniz International Proceedings in Informatics (LIPIcs), Volume 276, pp. 1:1-1:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{shalaby_et_al:LIPIcs.DNA.29.1, author = {Shalaby, Ahmed and Thachuk, Chris and Woods, Damien}, title = {{Minimum Free Energy, Partition Function and Kinetics Simulation Algorithms for a Multistranded Scaffolded DNA Computer}}, booktitle = {29th International Conference on DNA Computing and Molecular Programming (DNA 29)}, pages = {1:1--1:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-297-6}, ISSN = {1868-8969}, year = {2023}, volume = {276}, editor = {Chen, Ho-Lin and Evans, Constantine G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DNA.29.1}, URN = {urn:nbn:de:0030-drops-187840}, doi = {10.4230/LIPIcs.DNA.29.1}, annote = {Keywords: thermodynamic computation, model of computation, molecular computing, minimum free energy, partition function, DNA computing, DNA self-assembly, DNA strand displacement, kinetics simulation} }
Published in: LIPIcs, Volume 238, 28th International Conference on DNA Computing and Molecular Programming (DNA 28) (2022)
Tiernan Kennedy, Cadence Pearce, and Chris Thachuk. Fast and Robust Strand Displacement Cascades via Systematic Design Strategies. In 28th International Conference on DNA Computing and Molecular Programming (DNA 28). Leibniz International Proceedings in Informatics (LIPIcs), Volume 238, pp. 1:1-1:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{kennedy_et_al:LIPIcs.DNA.28.1, author = {Kennedy, Tiernan and Pearce, Cadence and Thachuk, Chris}, title = {{Fast and Robust Strand Displacement Cascades via Systematic Design Strategies}}, booktitle = {28th International Conference on DNA Computing and Molecular Programming (DNA 28)}, pages = {1:1--1:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-253-2}, ISSN = {1868-8969}, year = {2022}, volume = {238}, editor = {Ouldridge, Thomas E. and Wickham, Shelley F. J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DNA.28.1}, URN = {urn:nbn:de:0030-drops-167869}, doi = {10.4230/LIPIcs.DNA.28.1}, annote = {Keywords: DNA strand displacement, Energy barriers, Kinetics} }
Published in: LIPIcs, Volume 114, 10th International Conference on Geographic Information Science (GIScience 2018)
Chi-Feng Yen, Ming-Hsiang Tsou, and Chris Allen. Assessing Neighborhood Conditions using Geographic Object-Based Image Analysis and Spatial Analysis (Short Paper). In 10th International Conference on Geographic Information Science (GIScience 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 114, pp. 70:1-70:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{yen_et_al:LIPIcs.GISCIENCE.2018.70, author = {Yen, Chi-Feng and Tsou, Ming-Hsiang and Allen, Chris}, title = {{Assessing Neighborhood Conditions using Geographic Object-Based Image Analysis and Spatial Analysis}}, booktitle = {10th International Conference on Geographic Information Science (GIScience 2018)}, pages = {70:1--70:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-083-5}, ISSN = {1868-8969}, year = {2018}, volume = {114}, editor = {Winter, Stephan and Griffin, Amy and Sester, Monika}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.GISCIENCE.2018.70}, URN = {urn:nbn:de:0030-drops-93983}, doi = {10.4230/LIPIcs.GISCIENCE.2018.70}, annote = {Keywords: neighborhood conditions assessment, geographic object-based image analysis, spatial analysis} }
Published in: LIPIcs, Volume 110, 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018)
Chris Dowden, Mihyun Kang, and Michael Krivelevich. The Genus of the Erdös-Rényi Random Graph and the Fragile Genus Property. In 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 110, pp. 17:1-17:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{dowden_et_al:LIPIcs.AofA.2018.17, author = {Dowden, Chris and Kang, Mihyun and Krivelevich, Michael}, title = {{The Genus of the Erd\"{o}s-R\'{e}nyi Random Graph and the Fragile Genus Property}}, booktitle = {29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018)}, pages = {17:1--17:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-078-1}, ISSN = {1868-8969}, year = {2018}, volume = {110}, editor = {Fill, James Allen and Ward, Mark Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2018.17}, URN = {urn:nbn:de:0030-drops-89100}, doi = {10.4230/LIPIcs.AofA.2018.17}, annote = {Keywords: Random graphs, Genus, Fragile genus} }
Published in: LIPIcs, Volume 60, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)
Ryuhei Mori and David Witmer. Lower Bounds for CSP Refutation by SDP Hierarchies. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 60, pp. 41:1-41:30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{mori_et_al:LIPIcs.APPROX-RANDOM.2016.41, author = {Mori, Ryuhei and Witmer, David}, title = {{Lower Bounds for CSP Refutation by SDP Hierarchies}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)}, pages = {41:1--41:30}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-018-7}, ISSN = {1868-8969}, year = {2016}, volume = {60}, editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.41}, URN = {urn:nbn:de:0030-drops-66645}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.41}, annote = {Keywords: constraint satisfaction problems, LP and SDP relaxations, average-case complexity} }
Feedback for Dagstuhl Publishing