{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T06:10:01Z","timestamp":1746425401559,"version":"3.40.4"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,10,17]],"date-time":"2014-10-17T00:00:00Z","timestamp":1413504000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s00446-014-0231-6","type":"journal-article","created":{"date-parts":[[2014,10,16]],"date-time":"2014-10-16T19:26:17Z","timestamp":1413487577000},"page":"3-19","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Wait-freedom with advice"],"prefix":"10.1007","volume":"28","author":[{"given":"Carole","family":"Delporte-Gallet","sequence":"first","affiliation":[]},{"given":"Hugues","family":"Fauconnier","sequence":"additional","affiliation":[]},{"given":"Eli","family":"Gafni","sequence":"additional","affiliation":[]},{"given":"Petr","family":"Kuznetsov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,17]]},"reference":[{"issue":"4","key":"231_CR1","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1145\/153724.153741","volume":"40","author":"Y Afek","year":"1993","unstructured":"Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic snapshots of shared memory. J. ACM 40(4), 873\u2013890 (1993)","journal-title":"J. ACM"},{"issue":"6","key":"231_CR2","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/s00446-012-0177-5","volume":"25","author":"Y Afek","year":"2012","unstructured":"Afek, Y., Kuznetsov, P., Nir, I.: Renaming and the weakest family of failure detectors. Distrib. Comput. 25(6), 411\u2013425 (2012)","journal-title":"Distrib. Comput."},{"issue":"3","key":"231_CR3","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s00446-012-0158-8","volume":"25","author":"MK Aguilera","year":"2012","unstructured":"Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Partial synchrony based on set timeliness. Distrib. Comput. 25(3), 249\u2013260 (2012)","journal-title":"Distrib. Comput."},{"issue":"2","key":"231_CR4","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/200836.200869","volume":"42","author":"H Attiya","year":"1995","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D.: Sharing memory robustly in message passing systems. J. ACM 42(2), 124\u2013142 (1995)","journal-title":"J. ACM"},{"issue":"3","key":"231_CR5","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1145\/79147.79158","volume":"37","author":"H Attiya","year":"1990","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R.: Renaming in an asynchronous environment. J. ACM 37(3), 524\u2013548 (1990)","journal-title":"J. ACM"},{"issue":"4","key":"231_CR6","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1145\/792538.792541","volume":"50","author":"H Attiya","year":"2003","unstructured":"Attiya, H., Fouren, A.: Algorithms adapting to point contention. J. ACM 50(4), 444\u2013468 (2003)","journal-title":"J. ACM"},{"key":"231_CR7","doi-asserted-by":"crossref","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. Wiley, Hoboken (2004)"},{"key":"231_CR8","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP impossibility result for $$t$$ t -resilient asynchronous computations. In: STOC, pp. 91\u2013100. ACM Press (1993)","DOI":"10.1145\/167088.167119"},{"key":"231_CR9","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Immediate atomic snapshots and fast renaming. In: PODC, pp. 41\u201351. ACM Press (1993)","DOI":"10.1145\/164051.164056"},{"issue":"3","key":"231_CR10","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/PL00008933","volume":"14","author":"E Borowsky","year":"2001","unstructured":"Borowsky, E., Gafni, E., Lynch, N.A., Rajsbaum, S.: The BG distributed simulation algorithm. Distrib. Comput. 14(3), 127\u2013146 (2001)","journal-title":"Distrib. Comput."},{"issue":"5\u20136","key":"231_CR11","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s00446-010-0108-2","volume":"22","author":"A Casta\u00f1eda","year":"2010","unstructured":"Casta\u00f1eda, A., Rajsbaum, S.: New combinatorial topology bounds for renaming: the lower bound. Distrib. Comput. 22(5\u20136), 287\u2013301 (2010)","journal-title":"Distrib. Comput."},{"issue":"4","key":"231_CR12","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"TD Chandra","year":"1996","unstructured":"Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. J. ACM 43(4), 685\u2013722 (1996)","journal-title":"J. ACM"},{"issue":"2","key":"231_CR13","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"TD Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J. ACM 43(2), 225\u2013267 (1996)","journal-title":"J. ACM"},{"issue":"1","key":"231_CR14","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1006\/inco.1993.1043","volume":"105","author":"S Chaudhuri","year":"1993","unstructured":"Chaudhuri, S.: More choices allow more faults: set consensus problems in totally asynchronous systems. Inf. Comput. 105(1), 132\u2013158 (1993)","journal-title":"Inf. Comput."},{"key":"231_CR15","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Gafni, E., Kuznetsov, P.: Wait-freedom with advice. In: PODC, pp. 105\u2013114 (2012)","DOI":"10.1145\/2332432.2332456"},{"key":"231_CR16","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R.: Tight failure detection bounds on atomic object implementations. J. ACM 57(4), 22:1\u201322:32 (2010)","DOI":"10.1145\/1734213.1734216"},{"key":"231_CR17","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Hadzilacos, V., Koutnetzov, P., Toueg, S.: The weakest failure detectors to solve certain fundamental problems in distributed computing. In: PODC, pp. 338\u2013346. ACM Press (2004)","DOI":"10.1145\/1011767.1011818"},{"issue":"4","key":"231_CR18","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1016\/j.jpdc.2004.11.008","volume":"65","author":"C Delporte-Gallet","year":"2005","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Kouznetsov, P.: Mutual exclusion in asynchronous systems with failure detectors. J. Parallel Distrib. Comput. 65(4), 492\u2013505 (2005)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"3\u20134","key":"231_CR19","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s00446-010-0122-4","volume":"24","author":"C Delporte-Gallet","year":"2011","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Tielmann, A.: The disagreement power of an adversary. Distrib. Comput. 24(3\u20134), 137\u2013147 (2011)","journal-title":"Distrib. Comput."},{"issue":"2","key":"231_CR20","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"231_CR21","doi-asserted-by":"crossref","unstructured":"Gafni, E.: Round-by-round fault detectors: unifying synchrony and asynchrony (extended abstract). In: PODC, pp. 143\u2013152 (1998)","DOI":"10.1145\/277697.277724"},{"key":"231_CR22","doi-asserted-by":"crossref","unstructured":"Gafni, E.: The extended BG-simulation and the characterization of t-resiliency. In: STOC, pp. 85\u201392. ACM Press (2009)","DOI":"10.1145\/1536414.1536428"},{"key":"231_CR23","unstructured":"Gafni, E., Guerraoui, R.: Simulating few by many: limited concurrency = set consensus. Technical Report. http:\/\/www.cs.ucla.edu\/eli\/eli\/kconc.pdf (2009)"},{"key":"231_CR24","doi-asserted-by":"crossref","unstructured":"Gafni, E., Guerraoui, R.: Generalized universality. In: Proceedings of the 22nd international conference on concurrency theory, CONCUR\u201911, pp. 17\u201327. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-23217-6_2"},{"key":"231_CR25","doi-asserted-by":"crossref","unstructured":"Gafni, E., Kuznetsov, P.: Turning adversaries into friends: simplified, made constructive, and extended. In: OPODIS, pp. 380\u2013394 (2010)","DOI":"10.1007\/978-3-642-17653-1_28"},{"issue":"3\u20134","key":"231_CR26","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s00446-011-0142-8","volume":"24","author":"E Gafni","year":"2011","unstructured":"Gafni, E., Kuznetsov, P.: On set consensus numbers. Distrib. Comput. 24(3\u20134), 149\u2013163 (2011)","journal-title":"Distrib. Comput."},{"key":"231_CR27","doi-asserted-by":"crossref","unstructured":"Gafni, E., Kuznetsov, P.: Relating L-resilience and wait-freedom via hitting sets. In: ICDCN, pp. 191\u2013202. Full version: http:\/\/arxiv.org\/abs\/1004.4701 (2011)","DOI":"10.1007\/978-3-642-17679-1_17"},{"key":"231_CR28","doi-asserted-by":"crossref","unstructured":"Gafni, E., Rajsbaum, S.: Distributed programming with tasks. In: OPODIS, pp. 205\u2013218 (2010)","DOI":"10.1007\/978-3-642-17653-1_17"},{"key":"231_CR29","doi-asserted-by":"crossref","unstructured":"Gray, J.: Notes on data base operating systems. In: Bayer, R.,Graham, R.M., Seegmueller, G. (eds.) An Advanced Course : Operating Systems. Lecture Notes in Computer Science 60, pp. 393\u2013481. Springer, Berlin (1978)","DOI":"10.1007\/3-540-08755-9_9"},{"issue":"5","key":"231_CR30","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s00446-007-0043-z","volume":"20","author":"R Guerraoui","year":"2008","unstructured":"Guerraoui, R., Kuznetsov, P.: Failure detectors as type boosters. Distrib. Comput. 20(5), 343\u2013358 (2008)","journal-title":"Distrib. Comput."},{"issue":"1","key":"231_CR31","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/114005.102808","volume":"13","author":"M Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Progr. Lang. Syst. 13(1), 123\u2013149 (1991)","journal-title":"ACM Trans. Progr. Lang. Syst."},{"issue":"2","key":"231_CR32","doi-asserted-by":"crossref","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(2), 858\u2013923 (1999)","journal-title":"J. ACM"},{"key":"231_CR33","doi-asserted-by":"crossref","unstructured":"Jayanti, P., Toueg, S.: Every problem has a weakest failure detector. In: PODC, pp. 75\u201384 (2008)","DOI":"10.1145\/1400751.1400763"},{"issue":"7","key":"231_CR34","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L Lamport","year":"1978","unstructured":"Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558\u2013565 (1978)","journal-title":"Commun. ACM"},{"issue":"2","key":"231_CR35","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L Lamport","year":"1998","unstructured":"Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst. 16(2), 133\u2013169 (1998)","journal-title":"ACM Trans. Comput. Syst."},{"key":"231_CR36","first-page":"280","volume":"857","author":"W-K Lo","year":"1994","unstructured":"Lo, W.-K., Hadzilacos, V.: Using failure detectors to solve consensus in asynchronous shared memory systems. WDAG, LNCS 857, 280\u2013295 (1994)","journal-title":"WDAG, LNCS"},{"key":"231_CR37","first-page":"163","volume":"4","author":"M Loui","year":"1987","unstructured":"Loui, M., Abu-Amara, H.: Memory requirements for agreement among unreliable asynchronous processes. Adv. Comput. Res. 4, 163\u2013183 (1987)","journal-title":"Adv. Comput. Res."},{"key":"231_CR38","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, Burlington (1996)"},{"key":"231_CR39","unstructured":"Raynal, M.: $$K$$ K -anti-Omega, August 2007. Rump session at PODC (2007)"},{"key":"231_CR40","doi-asserted-by":"crossref","first-page":"1449","DOI":"10.1137\/S0097539796307698","volume":"29","author":"M Saks","year":"2000","unstructured":"Saks, M., Zaharoglou, F.: Wait-free k-set agreement is impossible: the topology of public knowledge. SIAM J. Comput. 29, 1449\u20131483 (2000)","journal-title":"SIAM J. Comput."},{"issue":"5\u20136","key":"231_CR41","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s00446-010-0101-9","volume":"22","author":"P Zieli\u0144ski","year":"2010","unstructured":"Zieli\u0144ski, P.: Anti- $$Omega$$ O m e g a : the weakest failure detector for set agreement. Distrib. Comput. 22(5\u20136), 335\u2013348 (2010)","journal-title":"Distrib. Comput."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0231-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-014-0231-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0231-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T05:31:19Z","timestamp":1746423079000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-014-0231-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,17]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["231"],"URL":"https:\/\/doi.org\/10.1007\/s00446-014-0231-6","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2014,10,17]]}}}