{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T16:01:47Z","timestamp":1729612907863,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icdcs.2005.79","type":"proceedings-article","created":{"date-parts":[[2005,7,28]],"date-time":"2005-07-28T01:00:20Z","timestamp":1122512420000},"page":"39-48","source":"Crossref","is-referenced-by-count":4,"title":["The Impossibility of Boosting Distributed Service Resilience"],"prefix":"10.1109","author":[{"given":"P.","family":"Attie","sequence":"first","affiliation":[]},{"given":"R.","family":"Guerraoui","sequence":"additional","affiliation":[]},{"given":"P.","family":"Kouznetsov","sequence":"additional","affiliation":[]},{"given":"N.","family":"Lynch","sequence":"additional","affiliation":[]},{"given":"S.","family":"Rajsbaum","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Distributed Algorithms","year":"1996","author":"lynch","key":"17"},{"key":"18","doi-asserted-by":"crossref","first-page":"1449","DOI":"10.1137\/S0097539796307698","article-title":"Wait-free k-set agreement is impossible: The topology of public knowledge","volume":"29","author":"saks","year":"2000","journal-title":"SIAM Journal on Computing"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"year":"2003","author":"jayanti","key":"16"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500003170"},{"key":"14","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1145\/331524.331529","article-title":"The topological structure of asynchronous computability","volume":"46","author":"herlihy","year":"1999","journal-title":"Journal of the ACM"},{"key":"11","article-title":"A modular approach to fault-tolerant broadcast and related problems","author":"hadzilacos","year":"1994","journal-title":"Technical Report"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102808"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167119"},{"key":"2","article-title":"Boosting fault-tolerance in asynchronous message passing systems is impossible","author":"attie","year":"2002","journal-title":"Technical Report"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2005.79"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39989-6_21"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/93385.93431"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226647"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/234533.234549"},{"key":"4","first-page":"334","article-title":"Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies","author":"chandra","year":"1994","journal-title":"proc the 12th Annual ACM Symposium on Principles of Distributed Computing (PODC)"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2002.1028919"}],"event":{"name":"25th IEEE International Conference on Distributed Computing Systems (ICDCS'05)","location":"Columbus, OH, USA"},"container-title":["25th IEEE International Conference on Distributed Computing Systems (ICDCS'05)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9816\/30952\/01437069.pdf?arnumber=1437069","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T21:36:26Z","timestamp":1497648986000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1437069\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/icdcs.2005.79","relation":{},"subject":[]}}