{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T14:27:14Z","timestamp":1776522434212,"version":"3.51.2"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032111265","type":"print"},{"value":"9783032111272","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T00:00:00Z","timestamp":1763424000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T00:00:00Z","timestamp":1763424000000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-11127-2_5","type":"book-chapter","created":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T20:03:41Z","timestamp":1763409821000},"page":"40-55","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Distributed Algorithms for\u00a0Shape Reduction via\u00a0Reconfigurable Circuits"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9403-1702","authenticated-orcid":false,"given":"Nada","family":"Almalki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4671-9822","authenticated-orcid":false,"given":"Siddharth","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6234-3960","authenticated-orcid":false,"given":"Othon","family":"Michail","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4601-9597","authenticated-orcid":false,"given":"Andreas","family":"Padalkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,18]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Almalki, N., Gupta, S., Michail, O.: On the exponential growth of geometric shapes. In: ALGOWIN. LNCS, vol. 15026, pp. 16\u201330. Springer (2024)","DOI":"10.1007\/978-3-031-74580-5_2"},{"key":"5_CR2","unstructured":"Almalki, N., Gupta, S., Michail, O., Padalkin, A.: Efficient distributed algorithms for shape reduction via reconfigurable circuits. CoRR abs\/2503.18663 (2025)"},{"key":"5_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114324","volume":"984","author":"N Almalki","year":"2024","unstructured":"Almalki, N., Michail, O.: On geometric shape construction via growth operations. Theor. Comput. Sci. 984, 114324 (2024)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"5_CR4","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. Distributed Comput. 18(4), 235\u2013253 (2006)","journal-title":"Distributed Comput."},{"key":"5_CR5","unstructured":"Artmann, M., Padalkin, A., Scheideler, C.: On the shape containment problem within the amoebot model with reconfigurable circuits. CoRR abs\/2501.16892 (2025)"},{"issue":"5","key":"5_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/3310165.3310170","volume":"48","author":"C Avin","year":"2018","unstructured":"Avin, C., Schmid, S.: Toward demand-aware networking: a theory for self-adjusting networks. Comput. Commun. Rev. 48(5), 31\u201340 (2018)","journal-title":"Comput. Commun. Rev."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Cornejo, A., Kuhn, F.: Deploying wireless networks with beeps. In: DISC. LNCS, vol. 6343, pp. 148\u2013162. Springer (2010)","DOI":"10.1007\/978-3-642-15763-9_15"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Derakhshandeh, Z., Dolev, S., Gmyr, R., Richa, A.W., Scheideler, C., Strothmann, T.: Brief announcement: amoebot - a new model for programmable matter. In: 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA \u201914, pp. 220\u2013222. ACM (2014)","DOI":"10.1145\/2612669.2612712"},{"issue":"4","key":"5_CR9","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1089\/cmb.2021.0363","volume":"29","author":"M Feldmann","year":"2022","unstructured":"Feldmann, M., Padalkin, A., Scheideler, C., Dolev, S.: Coordinating amoebots via reconfigurable circuits. J. Comput. Biol. 29(4), 317\u2013343 (2022)","journal-title":"J. Comput. Biol."},{"issue":"3","key":"5_CR10","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s00446-023-00442-4","volume":"36","author":"T G\u00f6tte","year":"2023","unstructured":"G\u00f6tte, T., Hinnenthal, K., Scheideler, C., Werthmann, J.: Time-optimal construction of overlay networks. Distributed Comput. 36(3), 313\u2013347 (2023)","journal-title":"Distributed Comput."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Gupta, S., van Kreveld, M.J., Michail, O., Padalkin, A.: Collision detection for modular robots - it is easy to cause collisions and hard to avoid them. In: ALGOWIN. LNCS, vol. 15026, pp. 76\u201390. Springer (2024)","DOI":"10.1007\/978-3-031-74580-5_6"},{"key":"5_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2024.103587","volume":"147","author":"GB Mertzios","year":"2025","unstructured":"Mertzios, G.B., Michail, O., Skretas, G., Spirakis, P.G., Theofilatos, M.: The complexity of growing a graph. J. Comput. Syst. Sci. 147, 103587 (2025)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s00446-021-00415-5","volume":"35","author":"O Michail","year":"2022","unstructured":"Michail, O., Skretas, G., Spirakis, P.G.: Distributed computation and reconfiguration in actively dynamic networks. Distributed Comput. 35(2), 185\u2013206 (2022)","journal-title":"Distributed Comput."},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Padalkin, A., Scheideler, C.: Polylogarithmic time algorithms for shortest path forests in programmable matter. In: PODC, pp. 65\u201375. ACM (2024)","DOI":"10.1145\/3662158.3662776"},{"issue":"4","key":"5_CR15","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s11047-024-09981-6","volume":"23","author":"A Padalkin","year":"2024","unstructured":"Padalkin, A., Scheideler, C., Warner, D.: The structural power of reconfigurable circuits in the amoebot model. Nat. Comput. 23(4), 603\u2013625 (2024)","journal-title":"Nat. Comput."},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Woods, D., Chen, H., Goodfriend, S., Dabby, N., Winfree, E., Yin, P.: Active self-assembly of algorithmic shapes and patterns in polylogarithmic time. In: ITCS, pp. 353\u2013354. ACM (2013)","DOI":"10.1145\/2422436.2422476"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-11127-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T20:03:44Z","timestamp":1763409824000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11127-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,18]]},"ISBN":["9783032111265","9783032111272"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11127-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,18]]},"assertion":[{"value":"18 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kathmandu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nepal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}