{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T17:28:37Z","timestamp":1770139717313,"version":"3.49.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031812019","type":"print"},{"value":"9783031812026","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-81202-6_4","type":"book-chapter","created":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T00:52:48Z","timestamp":1740444768000},"page":"52-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Computing Threshold Circuits with\u00a0Void Reactions in\u00a0Step Chemical Reaction Networks"],"prefix":"10.1007","author":[{"given":"Rachel","family":"Anderson","sequence":"first","affiliation":[]},{"given":"Alberto","family":"Avila","sequence":"additional","affiliation":[]},{"given":"Bin","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Timothy","family":"Gomez","sequence":"additional","affiliation":[]},{"given":"Elise","family":"Grizzell","sequence":"additional","affiliation":[]},{"given":"Aiden","family":"Massie","sequence":"additional","affiliation":[]},{"given":"Gourab","family":"Mukhopadhyay","sequence":"additional","affiliation":[]},{"given":"Adrian","family":"Salinas","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Schweller","sequence":"additional","affiliation":[]},{"given":"Evan","family":"Tomai","sequence":"additional","affiliation":[]},{"given":"Tim","family":"Wylie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,26]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Alaniz, R.M., et al.: Reachability in restricted chemical reaction networks (2022). arXiv:2211.12603","DOI":"10.2139\/ssrn.4665761"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Anderson, R., et al.: Computing threshold circuits with bimolecular void reactions in step chemical reaction networks. In: Proceedings of the 21st International Conference on Unconventional Computation and Natural Computation, UCNC 2024 (2024, to appear)","DOI":"10.1007\/978-3-031-63742-1_18"},{"issue":"4","key":"4_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00446-005-0138-3","volume":"18","author":"D Angluin","year":"2006","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Disturb. Comput. 18(4), 235\u2013253 (2006). https:\/\/doi.org\/10.1007\/s00446-005-0138-3","journal-title":"Disturb. Comput."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s00446-008-0059-z","volume":"21","author":"D Angluin","year":"2008","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: A simple population protocol for fast robust approximate majority. Distrib. Comput. 21, 87\u2013102 (2008)","journal-title":"Distrib. Comput."},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The computational power of population protocols. Distrib. Comput. (2007)","DOI":"10.1007\/s00446-007-0040-2"},{"issue":"2","key":"4_CR6","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF00282276","volume":"19","author":"R Aris","year":"1965","unstructured":"Aris, R.: Prolegomena to the rational analysis of systems of chemical reactions. Arch. Ration. Mech. Anal. 19(2), 81\u201399 (1965)","journal-title":"Arch. Ration. Mech. Anal."},{"issue":"5","key":"4_CR7","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/BF00251438","volume":"27","author":"R Aris","year":"1968","unstructured":"Aris, R.: Prolegomena to the rational analysis of systems of chemical reactions II. Some addenda. Arch. Ration. Mech. Anal. 27(5), 356\u2013364 (1968)","journal-title":"Arch. Ration. Mech. Anal."},{"issue":"2","key":"4_CR8","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1016\/S0006-3495(94)80516-8","volume":"67","author":"A Arkin","year":"1994","unstructured":"Arkin, A., Ross, J.: Computational functions in biochemical reaction networks. Biophys. J . 67(2), 560\u2013578 (1994)","journal-title":"Biophys. J ."},{"issue":"17","key":"4_CR9","doi-asserted-by":"publisher","first-page":"5687","DOI":"10.1021\/ja00225a017","volume":"110","author":"A Aviram","year":"1988","unstructured":"Aviram, A.: Molecules for memory, logic, and amplification. J. Am. Chem. Soc. 110(17), 5687\u20135692 (1988)","journal-title":"J. Am. Chem. Soc."},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s11047-017-9665-7","volume":"17","author":"L Cardelli","year":"2018","unstructured":"Cardelli, L., Kwiatkowska, M., Whitby, M.: Chemical reaction network designs for asynchronous logic circuits. Nat. Comput. 17, 109\u2013130 (2018)","journal-title":"Nat. Comput."},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s11047-019-09761-7","volume":"19","author":"L Cardelli","year":"2020","unstructured":"Cardelli, L., Tribastone, M., Tschaikowski, M.: From electric circuits to chemical networks. Nat. Comput. 19, 237\u2013248 (2020)","journal-title":"Nat. Comput."},{"issue":"4","key":"4_CR12","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s11047-013-9393-6","volume":"13","author":"HL Chen","year":"2014","unstructured":"Chen, H.L., Doty, D., Soloveichik, D.: Deterministic function computation with chemical reaction networks. Nat. Comput. 13(4), 517\u2013534 (2014)","journal-title":"Nat. Comput."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Cook, M., Soloveichik, D., Winfree, E., Bruck, J.: Programmability of chemical reaction networks. In: Algorithmic Bioprocesses, pp. 543\u2013584. Springer, Cham (2009)","DOI":"10.1007\/978-3-540-88869-7_27"},{"issue":"8","key":"4_CR14","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1021\/acssynbio.5b00044","volume":"4","author":"N Dalchau","year":"2015","unstructured":"Dalchau, N., Chandran, H., Gopalkrishnan, N., Phillips, A., Reif, J.: Probabilistic analysis of localized DNA hybridization circuits. ACS Synth. Biol. 4(8), 898\u2013913 (2015)","journal-title":"ACS Synth. Biol."},{"key":"4_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.biosystems.2019.103983","volume":"186","author":"SJ Ellis","year":"2019","unstructured":"Ellis, S.J., Klinge, T.H., Lathrop, J.I.: Robust chemical circuits. Biosystems 186, 103983 (2019)","journal-title":"Biosystems"},{"issue":"2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/s11426-021-1131-1","volume":"65","author":"D Fan","year":"2022","unstructured":"Fan, D., Wang, J., Han, J., Wang, E., Dong, S.: Engineering DNA logic systems with non-canonical DNA-nanostructures: basic principles, recent developments and bio-applications. Sci. China Chem. 65(2), 284\u2013297 (2022)","journal-title":"Sci. China Chem."},{"issue":"24","key":"4_CR17","doi-asserted-by":"publisher","first-page":"10983","DOI":"10.1073\/pnas.88.24.10983","volume":"88","author":"A Hjelmfelt","year":"1991","unstructured":"Hjelmfelt, A., Weinberger, E.D., Ross, J.: Chemical implementation of neural networks and turing machines. Proc. Natl. Acad. Sci. 88(24), 10983\u201310987 (1991)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Jiang, H., Riedel, M.D., Parhi, K.K.: Digital logic with molecular reactions. In: International Conference on Computer-Aided Design, ICCAD 2013, pp. 721\u2013727. IEEE (2013)","DOI":"10.1109\/ICCAD.2013.6691194"},{"issue":"2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"RM Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147\u2013195 (1969)","journal-title":"J. Comput. Syst. Sci."},{"issue":"24","key":"4_CR20","doi-asserted-by":"publisher","first-page":"6775","DOI":"10.1021\/jp504057u","volume":"118","author":"S Mailloux","year":"2014","unstructured":"Mailloux, S., Guz, N., Zakharchenko, A., Minko, S., Katz, E.: Majority and minority gates realized in enzyme-biocatalyzed systems integrated with logic networks and interfaced with bioelectronic systems. J. Phys. Chem. B 118(24), 6775\u20136784 (2014)","journal-title":"J. Phys. Chem. B"},{"key":"4_CR21","unstructured":"Petri, C.A.: Kommunikation mit Automaten. Ph.D. thesis, Rheinisch-Westf\u00e4lischen Institutes f\u00fcr Instrumentelle Mathematik an der Universit\u00e4t Bonn (1962)"},{"issue":"6034","key":"4_CR22","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1126\/science.1200520","volume":"332","author":"L Qian","year":"2011","unstructured":"Qian, L., Winfree, E.: Scaling up digital circuit computation with DNA strand displacement cascades. Science 332(6034), 1196\u20131201 (2011)","journal-title":"Science"},{"issue":"62","key":"4_CR23","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.1098\/rsif.2010.0729","volume":"8","author":"L Qian","year":"2011","unstructured":"Qian, L., Winfree, E.: A simple DNA gate motif for synthesizing large-scale circuits. J. R. Soc. Interface 8(62), 1281\u20131297 (2011)","journal-title":"J. R. Soc. Interface"},{"key":"4_CR24","doi-asserted-by":"publisher","first-page":"30","DOI":"10.3103\/S1066369X14050041","volume":"58","author":"IS Sergeev","year":"2014","unstructured":"Sergeev, I.S.: Upper bounds for the formula size of symmetric Boolean functions. Russ. Math. 58, 30\u201342 (2014)","journal-title":"Russ. Math."},{"issue":"4","key":"4_CR25","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s11047-008-9067-y","volume":"7","author":"D Soloveichik","year":"2008","unstructured":"Soloveichik, D., Cook, M., Winfree, E., Bruck, J.: Computation with finite stochastic chemical reaction networks. Nat. Comput. 7(4), 615\u2013633 (2008)","journal-title":"Nat. Comput."},{"issue":"12","key":"4_CR26","doi-asserted-by":"publisher","first-page":"5393","DOI":"10.1073\/pnas.0909380107","volume":"107","author":"D Soloveichik","year":"2010","unstructured":"Soloveichik, D., Seelig, G., Winfree, E.: DNA as a universal substrate for chemical kinetics. Proc. Natl. Acad. Sci. 107(12), 5393\u20135398 (2010)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Thachuk, C., Condon, A.: Space and energy efficient computation with DNA strand displacement systems. In: International Workshop on DNA-Based Computers (2012)","DOI":"10.1007\/978-3-642-32208-2_11"},{"issue":"52","key":"4_CR28","doi-asserted-by":"publisher","first-page":"E12182","DOI":"10.1073\/pnas.1806859115","volume":"115","author":"B Wang","year":"2018","unstructured":"Wang, B., Thachuk, C., Ellington, A.D., Winfree, E., Soloveichik, D.: Effective design principles for leakless strand displacement systems. Proc. Natl. Acad. Sci. 115(52), E12182\u2013E12191 (2018)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Winfree, E.: Chemical reaction networks and stochastic local search. In: DNA Computing and Molecular Programming, DNA 2019. Springer (2019)","DOI":"10.1007\/978-3-030-26807-7_1"},{"key":"4_CR30","doi-asserted-by":"publisher","first-page":"189796","DOI":"10.1109\/ACCESS.2020.3031221","volume":"8","author":"W Xiao","year":"2020","unstructured":"Xiao, W., Zhang, X., Zhang, Z., Chen, C., Shi, X.: Molecular full adder based on DNA strand displacement. IEEE Access 8, 189796\u2013189801 (2020)","journal-title":"IEEE Access"}],"container-title":["Lecture Notes in Computer Science","Machines, Computations, and Universality"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-81202-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T06:22:01Z","timestamp":1757139721000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-81202-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031812019","9783031812026"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-81202-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"26 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MCU","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machines, Computations, and Universality","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mcu2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/webusers.i3s.unice.fr\/MCU2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}