{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:36:08Z","timestamp":1743132968543,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031606021"},{"type":"electronic","value":"9783031606038"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-60603-8_12","type":"book-chapter","created":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T12:01:39Z","timestamp":1716379299000},"page":"208-225","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Non-negotiating Distributed Computing"],"prefix":"10.1007","author":[{"given":"Carole","family":"Delporte-Gallet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hugues","family":"Fauconnier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Fraigniaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Corentin","family":"Travers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,23]]},"reference":[{"issue":"6014","key":"12_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1126\/science.1193210","volume":"331","author":"Y Afek","year":"2011","unstructured":"Afek, Y., Alon, N., Barad, O., Hornstein, E., Barkai, N., Bar-Joseph, Z.: A biological solution to a fundamental distributed computing problem. Science 331(6014), 183\u2013185 (2011)","journal-title":"Science"},{"key":"12_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-030-61792-9_33","volume-title":"LATIN 2020: Theoretical Informatics","author":"B Ancona","year":"2020","unstructured":"Ancona, B., Bajwa, A., Lynch, N.A., Mallmann-Trenn, F.: How to color a French flag - biologically inspired algorithms for scale-invariant patterning. In: Kohayakawa, Y., Miyazawa, F.K. (eds.) LATIN 2021. LNCS, vol. 12118, pp. 413\u2013424. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-61792-9_33"},{"issue":"4","key":"12_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. Distrib. Comput. 18(4), 235\u2013253 (2006)","journal-title":"Distrib. Comput."},{"key":"12_CR4","unstructured":"Attiya, H., Ellen, F.: The step complexity of multidimensional approximate agreement. In: 26th International Conference on Principles of Distributed Systems, OPODIS. LIPIcs, vol.\u00a0253, pp. 6:1\u20136:12 (2022)"},{"issue":"4","key":"12_CR5","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1137\/S0097539797330689","volume":"31","author":"H Attiya","year":"2002","unstructured":"Attiya, H., Rajsbaum, S.: The combinatorial structure of wait-free solvable tasks. SIAM J. Comput. 31(4), 1286\u20131313 (2002)","journal-title":"SIAM J. Comput."},{"key":"12_CR6","doi-asserted-by":"publisher","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing: Fundamentals, Simulations, and Advanced Topics","author":"H Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations, and Advanced Topics, vol. 19. Wiley, Hoboken (2004)"},{"key":"12_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-642-15763-9_15","volume-title":"Distributed Computing (DISC)","author":"A Cornejo","year":"2010","unstructured":"Cornejo, A., Kuhn, F.: Deploying wireless networks with beeps. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 148\u2013162. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15763-9_15"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Davies, P.: Optimal message-passing with noisy beeps. In: 42th ACM Symposium on Principles of Distributed Computing (PODC), pp. 300\u2013309 (2023)","DOI":"10.1145\/3583668.3594594"},{"key":"12_CR9","unstructured":"Delporte-Gallet, C., Fauconnier, H., Fraigniaud, P., Rajsbaum, S., Travers, C.: Non-negotiating distributed computing. https:\/\/hal.science\/hal-04470425"},{"key":"12_CR10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-030-54921-3_17","volume-title":"Structural Information and Communication Complexity (SIROCCO)","author":"C Delporte-Gallet","year":"2020","unstructured":"Delporte-Gallet, C., Fauconnier, H., Rajsbaum, S.: Communication complexity of wait-free computability in dynamic networks. In: Richa, A., Scheideler, C. (eds.) SIROCCO 2020. LNCS, vol. 12156, pp. 291\u2013309. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-54921-3_17"},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/5925.5931","volume":"33","author":"D Dolev","year":"1986","unstructured":"Dolev, D., Lynch, N.A., Pinter, S.S., Stark, E.W., Weihl, W.E.: Reaching approximate agreement in the presence of faults. J. ACM 33(3), 499\u2013516 (1986)","journal-title":"J. ACM"},{"issue":"4","key":"12_CR12","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s00446-022-00427-9","volume":"35","author":"EM El-Mhamdi","year":"2022","unstructured":"El-Mhamdi, E.M., Guerraoui, R., Guirguis, A., Hoang, L.N., Rouault, S.: Genuinely distributed byzantine machine learning. Distrib. Comput. 35(4), 305\u2013331 (2022)","journal-title":"Distrib. Comput."},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Emek, Y., Wattenhofer, R.: Stone age distributed computing. In: 32nd ACM Symposium on Principles of Distributed Computing (PODC), pp. 137\u2013146 (2013)","DOI":"10.1145\/2484239.2484244"},{"issue":"5","key":"12_CR14","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s00446-015-0249-4","volume":"30","author":"O Feinerman","year":"2017","unstructured":"Feinerman, O., Haeupler, B., Korman, A.: Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication. Distributed Comput. 30(5), 339\u2013355 (2017)","journal-title":"Distributed Comput."},{"issue":"3","key":"12_CR15","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00446-016-0285-8","volume":"30","author":"O Feinerman","year":"2017","unstructured":"Feinerman, O., Korman, A.: The ANTS problem. Distrib. Comput. 30(3), 149\u2013168 (2017)","journal-title":"Distrib. Comput."},{"issue":"2","key":"12_CR16","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"F\u00fcgger, M., Nowak, T., Schwarz, M.: Tight bounds for asymptotic and approximate consensus. J. ACM 68(6), 46:1\u201346:35 (2021)","DOI":"10.1145\/3485242"},{"issue":"3","key":"12_CR18","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1137\/S0097539796305766","volume":"28","author":"E Gafni","year":"1999","unstructured":"Gafni, E., Koutsoupias, E.: Three-processor tasks are undecidable. SIAM J. Comput. 28(3), 970\u2013983 (1999)","journal-title":"SIAM J. Comput."},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Gelblum, A., Fonio, E., Rodeh, Y., Korman, A., Feinerman, O.: Ant collective cognition allows for efficient navigation through disordered environments. eLife 9, e55195 (2020)","DOI":"10.7554\/eLife.55195"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Ghinea, D., Liu-Zhang, C., Wattenhofer, R.: Multidimensional approximate agreement with asynchronous fallback. In: 35th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 141\u2013151 (2023)","DOI":"10.1145\/3558481.3591105"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Giakkoupis, G., Ziccardi, I.: Distributed self-stabilizing MIS with few states and weak communication. In: 42nd ACM Symposium on Principles of Distributed Computing (PODC), pp. 310\u2013320 (2023)","DOI":"10.1145\/3583668.3594581"},{"issue":"1","key":"12_CR22","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s00446-013-0202-3","volume":"28","author":"L Hella","year":"2015","unstructured":"Hella, L.: Weak models of distributed computing, with connections to modal logic. Distrib. Comput. 28(1), 31\u201353 (2015)","journal-title":"Distrib. Comput."},{"issue":"1","key":"12_CR23","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"12_CR24","volume-title":"Distributed Computing Through Combinatorial Topology","author":"M Herlihy","year":"2013","unstructured":"Herlihy, M., Kozlov, D.N., Rajsbaum, S.: Distributed Computing Through Combinatorial Topology. Morgan Kaufmann, Burlington (2013)"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Rajsbaum, S.: The decidability of distributed decision tasks. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing (STOC), pp. 589\u2013598. ACM (1997)","DOI":"10.1145\/258533.258652"},{"issue":"3","key":"12_CR26","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s00446-013-0189-9","volume":"26","author":"M Herlihy","year":"2013","unstructured":"Herlihy, M., Rajsbaum, S.: The topology of distributed adversaries. Distrib. Comput. 26(3), 173\u2013192 (2013)","journal-title":"Distrib. Comput."},{"key":"12_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2017.04.007","volume":"683","author":"M Herlihy","year":"2017","unstructured":"Herlihy, M., Rajsbaum, S., Raynal, M., Stainer, J.: From wait-free to arbitrary concurrent solo executions in colorless distributed computing. Theor. Comput. Sci. 683, 1\u201321 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"12_CR28","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M Herlihy","year":"1999","unstructured":"Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. J. ACM 46(6), 858\u2013923 (1999)","journal-title":"J. ACM"},{"issue":"2","key":"12_CR29","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1137\/S0097539701397412","volume":"36","author":"G Hoest","year":"2006","unstructured":"Hoest, G., Shavit, N.: Toward a topological characterization of asynchronous complexity. SIAM J. Comput. 36(2), 457\u2013497 (2006)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"12_CR30","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s00446-014-0240-5","volume":"28","author":"H Mendes","year":"2015","unstructured":"Mendes, H., Herlihy, M., Vaidya, N.H., Garg, V.K.: Multidimensional agreement in byzantine systems. Distrib. Comput. 28(6), 423\u2013441 (2015)","journal-title":"Distrib. Comput."},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics (2000)","DOI":"10.1137\/1.9780898719772"},{"key":"12_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-94141-7","volume-title":"Fault-Tolerant Message-Passing Distributed Systems - An Algorithmic Approach","author":"M Raynal","year":"2018","unstructured":"Raynal, M.: Fault-Tolerant Message-Passing Distributed Systems - An Algorithmic Approach. Springer, Cham (2018)"},{"key":"12_CR33","doi-asserted-by":"crossref","unstructured":"Taubenfeld, G.: Anonymous shared memory. J. ACM 69(4) (2022)","DOI":"10.1145\/3529752"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-60603-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T12:03:06Z","timestamp":1716379386000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60603-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031606021","9783031606038"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60603-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"23 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietri sul Mare","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"27 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sirocco2024.di.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}