{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T07:59:20Z","timestamp":1683791960913},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2015,6,9]],"date-time":"2015-06-09T00:00:00Z","timestamp":1433808000000},"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":["J Supercomput"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s11227-015-1460-6","type":"journal-article","created":{"date-parts":[[2015,6,11]],"date-time":"2015-06-11T05:00:08Z","timestamp":1433998808000},"page":"3726-3743","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Eventual election of multiple leaders for solving consensus in anonymous systems"],"prefix":"10.1007","volume":"71","author":[{"given":"Ernesto","family":"Jim\u00e9nez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Ar\u00e9valo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Herrera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,9]]},"reference":[{"issue":"4","key":"1460_CR1","doi-asserted-by":"crossref","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 MJ, Peralta R (2006) Computation in networks of passively mobile finite-state sensors. Distrib. Comput 18(4):235\u2013253","journal-title":"Distrib. Comput"},{"key":"1460_CR2","doi-asserted-by":"crossref","unstructured":"Aspnes J (2010) A modular approach to shared-memory consensus, with applications to the probabilistic-write model. In: Proceedings of 29th symposium on principles of distributed computing (PODC), pp 460\u2013467","DOI":"10.1145\/1835698.1835802"},{"key":"1460_CR3","doi-asserted-by":"crossref","unstructured":"Aspnes J, Ellen F (2011) Tight bounds for anonymous adopt-commit objects. In: Proceedings of 23rd symposium on parallelism in algorithms and architectures (SPAA), pp 317\u2013324","DOI":"10.1145\/1989493.1989548"},{"issue":"2","key":"1460_CR4","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1006\/inco.2001.3119","volume":"173","author":"H Attiya","year":"2002","unstructured":"Attiya H, Gorbach A, Moran S (2002) Computing in totally anonymous asynchronous shared memory systems. Inf Comput 173(2):162\u2013183","journal-title":"Inf Comput"},{"key":"1460_CR5","doi-asserted-by":"crossref","unstructured":"Bonnet F, Raynal M (2011) The price of anonymity: optimal consensus despite asynchrony, crash, and anonymity. ACM Trans Auton Adapt Syst TAAS 6(4):23","DOI":"10.1145\/2019591.2019592"},{"issue":"3","key":"1460_CR6","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s00446-012-0169-5","volume":"26","author":"F Bonnet","year":"2013","unstructured":"Bonnet F, Raynal M (2013) Anonymous asynchronous systems: the case of failure detectors. Distrib Comput 26(3):141\u2013158","journal-title":"Distrib Comput"},{"key":"1460_CR7","doi-asserted-by":"crossref","unstructured":"Bonnet F, Raynal M (2010) Anonymous asynchronous systems: the case of failure detectors. In: Proceedings of 24th international symposium on distributed computing (DISC), pp 206\u2013220","DOI":"10.1007\/978-3-642-15763-9_22"},{"key":"1460_CR8","doi-asserted-by":"crossref","unstructured":"Bonnet F, Raynal M (2010) Consensus in anonymous distributed systems: is there a weakest failure detector? In: AINA. IEEE Computer Society, Australia, pp 206\u2013213","DOI":"10.1109\/AINA.2010.19"},{"key":"1460_CR9","doi-asserted-by":"crossref","unstructured":"Bouzid Z, Sutra P, Travers C (2011) Anonymous agreement: the janus algorithm. In: Proceedings of 15th international conference on principles of distributed systems (OPODIS). France, pp 175\u2013190","DOI":"10.1007\/978-3-642-25873-2_13"},{"key":"1460_CR10","unstructured":"Bouzid Z, Travers C (2012) Anonymity, failures, detectors and consensus. In: Proceedings of 26th international symposium on distributed computing (DISC), pp 427\u2013428"},{"key":"1460_CR11","unstructured":"Bouzid Z, Travers C (2012) Anonymity, failures, detectors and consensus. Technical report. http:\/\/hal.inria.fr\/hal-00723309 . INRIA, August 2012"},{"issue":"4","key":"1460_CR12","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"T Chandra","year":"1996","unstructured":"Chandra T, Hadzilacos V, Toueg S (1996) The weakest failure detector for solving consensus. J ACM 43(4):685\u2013722","journal-title":"J ACM"},{"issue":"2","key":"1460_CR13","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T Chandra","year":"1996","unstructured":"Chandra T, Toueg S (1996) Unreliable failure detectors for reliable distributed systems. J ACM 43(2):225\u2013267","journal-title":"J ACM"},{"key":"1460_CR14","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet C, Fauconnier H (2009) Two consensus algorithms with atomic registers and failure detector $$\\varOmega $$ \u03a9 . In: Proceedings of 10th international conference on distributed computing and networking (ICDCN\u201909), vol 5408. LNCS, pp 251\u2013262","DOI":"10.1007\/978-3-540-92295-7_31"},{"key":"1460_CR15","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet C, Fauconnier H, Guerraoui R (2010) Tight failure detection bounds on atomic object implementations. J ACM 57(4)","DOI":"10.1145\/1734213.1734216"},{"issue":"5\u20136","key":"1460_CR16","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s00446-013-0190-3","volume":"26","author":"C Delporte-Gallet","year":"2013","unstructured":"Delporte-Gallet C, Fauconnier H, Guerraoui R, Kermarrec AM, Ruppert E, Tran-The H (2013) Byzantine agreement with homonyms. Distrib Comput 26(5\u20136):321\u2013340","journal-title":"Distrib Comput"},{"key":"1460_CR17","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet C, Fauconnier H, Tielmann A (2009) Fault-tolerant consensus in unknown and anonymous networks. In: Proceedings of 29th IEEE international conference on distributed computing systems (ICDCS\u201909). Canada, pp 368\u2013375","DOI":"10.1109\/ICDCS.2009.36"},{"key":"1460_CR18","doi-asserted-by":"crossref","unstructured":"Durresi A, Paruchuri V, Durresi M, Barolli L (2005) A hierarchical anonymous communication protocol for sensor networks. In: Proceedings of international conference on embedded and ubiquitous systems (EUS\u201905). LNCS, vol 3824. Springer, Berlin, pp 1123\u20131132","DOI":"10.1007\/11596356_111"},{"key":"1460_CR19","doi-asserted-by":"crossref","unstructured":"Fischer M, Jiang H (2006) Self-stabilizing leader election in networks of finite-state anonymous agents. In: Proceedings of 10th international conference on principles of distributed systems (OPODIS). France, pp 395\u2013409","DOI":"10.1007\/11945529_28"},{"issue":"2","key":"1460_CR20","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer MJ, Lynch N, Paterson MS (1985) Impossibility of distributed consensus with one faulty process. J ACM 32(2):374\u2013382","journal-title":"J ACM"},{"key":"1460_CR21","unstructured":"Gafni E (1998) Round-by-round fault detectors: unifying synchrony and asynchrony. In: Proceedings of 17th symposium on principles of distributed computing (PODC), pp 143\u2013152"},{"issue":"2","key":"1460_CR22","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.ipl.2006.05.009","volume":"100","author":"E Jim\u00e9nez","year":"2006","unstructured":"Jim\u00e9nez E, Ar\u00e9valo S, Fern\u00e1ndez A (2006) Implementing unreliable failure detectors with unknown membership. Inf Process Lett 100(2):60\u201363","journal-title":"Inf Process Lett"},{"key":"1460_CR23","unstructured":"Raynal M (2009) Failure detectors for asynchronous distributed systems: an introduction. In: Wiley encyclopedia of computer science and engineering, vol 2, pp 1181\u20131191"},{"key":"1460_CR24","doi-asserted-by":"crossref","unstructured":"Raynal M (2010) Communication and agreement abstractions for fault-tolerant asynchronous distributed systems. In: Synthesis lectures on distributed computing theory. Morgan & Claypool Publishers","DOI":"10.2200\/S00236ED1V01Y201004DCT002"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-015-1460-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-015-1460-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-015-1460-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T15:56:40Z","timestamp":1566835000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-015-1460-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,9]]},"references-count":24,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["1460"],"URL":"https:\/\/doi.org\/10.1007\/s11227-015-1460-6","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,9]]}}}