{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T05:35:11Z","timestamp":1740461711706,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157622"},{"type":"electronic","value":"9783642157639"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15763-9_40","type":"book-chapter","created":{"date-parts":[[2010,8,24]],"date-time":"2010-08-24T09:48:44Z","timestamp":1282643324000},"page":"404-405","source":"Crossref","is-referenced-by-count":2,"title":["Brief Announcement: New Bounds for Partially Synchronous Set Agreement"],"prefix":"10.1007","author":[{"given":"Dan","family":"Alistarh","sequence":"first","affiliation":[]},{"given":"Seth","family":"Gilbert","sequence":"additional","affiliation":[]},{"given":"Rachid","family":"Guerraoui","sequence":"additional","affiliation":[]},{"given":"Corentin","family":"Travers","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1007\/978-3-642-10631-6_95","volume-title":"Algorithms and Computation","author":"D. Alistarh","year":"2009","unstructured":"Alistarh, D., Gilbert, S., Guerraoui, R., Travers, C.: Of choices, failures and asynchrony: The many faces of set agreement. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 943\u2013953. Springer, Heidelberg (2009)"},{"key":"40_CR2","unstructured":"Alistarh, D., Gilbert, S., Guerraoui, R., Travers, C.: Of choices, failures and asynchrony: The many faces of set agreement. Algorithmica (to appear)"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. In: STOC, pp. 91\u2013100 (1993)","DOI":"10.1145\/167088.167119"},{"issue":"1","key":"40_CR4","doi-asserted-by":"publisher","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.\u00a0105(1), 132\u2013158 (1993)","journal-title":"Inf. Comput."},{"key":"40_CR5","first-page":"206","volume-title":"FOCS","author":"S. Chaudhuri","year":"1993","unstructured":"Chaudhuri, S., Herlihy, M., Lynch, N.A., Tuttle, M.R.: A tight lower bound for k-set agreement. In: FOCS, pp. 206\u2013215. IEEE, Los Alamitos (1993)"},{"issue":"2","key":"40_CR6","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. J. ACM\u00a035(2), 288\u2013323 (1988)","journal-title":"J. ACM"},{"key":"40_CR7","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":"40_CR8","doi-asserted-by":"crossref","unstructured":"Gafni, E., Guerraoui, R., Pochon, B.: From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement. In: STOC, pp. 714\u2013722 (2005)","DOI":"10.1145\/1060590.1060696"},{"key":"40_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/11945529_3","volume-title":"Principles of Distributed Systems","author":"R. Guerraoui","year":"2006","unstructured":"Guerraoui, R., Herlihy, M., Pochon, B.: A topological treatment of early-deciding set-agreement. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol.\u00a04305, pp. 20\u201335. Springer, Heidelberg (2006)"},{"issue":"6","key":"40_CR10","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\u00a046(6), 858\u2013923 (1999)","journal-title":"J. ACM"},{"issue":"5","key":"40_CR11","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1137\/S0097539796307698","volume":"29","author":"M.E. Saks","year":"2000","unstructured":"Saks, M.E., Zaharoglou, F.: Wait-free k-set agreement is impossible: The topology of public knowledge. SIAM J. Comput.\u00a029(5), 1449\u20131483 (2000)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15763-9_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T23:54:47Z","timestamp":1740441287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15763-9_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157622","9783642157639"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15763-9_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}