{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,20]],"date-time":"2026-09-20T11:44:03Z","timestamp":1789904643533,"version":"4.0.1"},"publisher-location":"New York, NY, USA","reference-count":1,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T00:00:00Z","timestamp":1307318400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,6]]},"DOI":"10.1145\/1993806.1993846","type":"proceedings-article","created":{"date-parts":[[2011,6,8]],"date-time":"2011-06-08T14:36:21Z","timestamp":1307543781000},"page":"227-228","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Easy impossibility proofs for k-set agreement in message passing systems"],"prefix":"10.1145","author":[{"given":"Martin","family":"Biely","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t Wien, Wien, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Robinson","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ulrich","family":"Schmid","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Wien, Wien, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2011,6,6]]},"reference":[{"key":"e_1_3_2_1_2_1","volume-title":"phDistributed algorithms","author":"Lynch Nancy","year":"1996","unstructured":"Nancy Lynch , phDistributed algorithms , Morgan Kaufman Publishers, Inc. , San Francisco, USA , 1996 . Nancy Lynch, phDistributed algorithms, Morgan Kaufman Publishers, Inc., San Francisco, USA, 1996."}],"event":{"name":"PODC '11: ACM Symposium on Principles of Distributed Computing","location":"San Jose California USA","acronym":"PODC '11","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993806.1993846","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993806.1993846","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:05:52Z","timestamp":1750244752000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993806.1993846"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,6]]},"references-count":1,"alternative-id":["10.1145\/1993806.1993846","10.1145\/1993806"],"URL":"https:\/\/doi.org\/10.1145\/1993806.1993846","relation":{},"subject":[],"published":{"date-parts":[[2011,6,6]]},"assertion":[{"value":"2011-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}