iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1109/ICPP.2006.69
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T09:06:11Z","timestamp":1729674371540,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icpp.2006.69","type":"proceedings-article","created":{"date-parts":[[2006,10,24]],"date-time":"2006-10-24T09:07:05Z","timestamp":1161680825000},"page":"399-406","source":"Crossref","is-referenced-by-count":0,"title":["The Power and Limit of Adding Synchronization Messages for Synchronous Agreement"],"prefix":"10.1109","author":[{"family":"Jiannong Cao","sequence":"first","affiliation":[]},{"given":"M.","family":"Raynal","sequence":"additional","affiliation":[]},{"family":"Xianbing Wang","sequence":"additional","affiliation":[]},{"family":"Weigang Wu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","first-page":"49","article-title":"Solving Consensus Using Chandra-Toueg's Unreliable Failure Detectors: A General Quorum-Based Approach","volume":"1693","author":"moste?faoui","year":"1999","journal-title":"LNCS"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/PRDC.2002.1185641"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00333-2"},{"journal-title":"Morgan Kaufmann Pub","article-title":"Distributed Algorithms","year":"1996","author":"lynch","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2004.1268403"},{"key":"3","first-page":"1988","article-title":"Distributed Computing: Fundamentals, Simulations and Advanced Topics","volume":"451","author":"attiya","year":"0","journal-title":"McGraw-Hill"},{"key":"2","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0020-0190(99)00100-3","article-title":"A Simple Bivalency Proof that t-Resilient Consensus Requires t+1 Rounds","volume":"71","author":"aguilera","year":"1999","journal-title":"IPL"},{"key":"1","first-page":"354","article-title":"On the Impact of Fast failure Detectors on Real-Time Fault-Tolerant Systems","volume":"2508","author":"aguilera","year":"2002","journal-title":"LNCS"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90033-3"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.11.001"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/214451.214456"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226647"},{"journal-title":"The Power and Limit of Synchronization for Synchronous Agreement","year":"2005","author":"cao","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/96559.96565"}],"event":{"name":"2006 International Conference on Parallel Processing (ICPP'06)","location":"Columbus, OH, USA"},"container-title":["2006 International Conference on Parallel Processing (ICPP'06)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/11126\/35641\/01690643.pdf?arnumber=1690643","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T06:40:34Z","timestamp":1497681634000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1690643\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":16,"URL":"http:\/\/dx.doi.org\/10.1109\/icpp.2006.69","relation":{},"subject":[]}}