{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:18:54Z","timestamp":1763468334797,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,25]],"date-time":"2016-07-25T00:00:00Z","timestamp":1469404800000},"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":[[2016,7,25]]},"DOI":"10.1145\/2933057.2933104","type":"proceedings-article","created":{"date-parts":[[2016,7,26]],"date-time":"2016-07-26T20:07:42Z","timestamp":1469563662000},"page":"249-258","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Space Bounds for Reliable Storage"],"prefix":"10.1145","author":[{"given":"Alexander","family":"Spiegelman","sequence":"first","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Yuval","family":"Cassuto","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Gregory","family":"Chockler","sequence":"additional","affiliation":[{"name":"Royal Holloway, London, United Kingdom"}]},{"given":"Idit","family":"Keidar","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]}],"member":"320","published-online":{"date-parts":[[2016,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Byzantine disk paxos: optimal resilience with byzantine shared memory. Distributed Computing, 18(5)","author":"Abraham Ittai","year":"2006","unstructured":"Ittai Abraham , Gregory Chockler , Idit Keidar , and Dahlia Malkhi . Byzantine disk paxos: optimal resilience with byzantine shared memory. Distributed Computing, 18(5) , 2006 . Ittai Abraham, Gregory Chockler, Idit Keidar, and Dahlia Malkhi. Byzantine disk paxos: optimal resilience with byzantine shared memory. Distributed Computing, 18(5), 2006."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/645950.675341"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2005.96"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/200836.200869"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2006.56"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933118"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2014.44"},{"key":"e_1_3_2_1_8_1","volume-title":"Space bounds for reliable multi-writer data store: Inherent cost of read\/write primitives. arXiv preprint arXiv:1508.03762","author":"Chockler Gregory","year":"2015","unstructured":"Gregory Chockler , Dan Dobre , Alexander Shraer , and Alexander Spiegelman . Space bounds for reliable multi-writer data store: Inherent cost of read\/write primitives. arXiv preprint arXiv:1508.03762 , 2015 . Gregory Chockler, Dan Dobre, Alexander Shraer, and Alexander Spiegelman. Space bounds for reliable multi-writer data store: Inherent cost of read\/write primitives. arXiv preprint arXiv:1508.03762, 2015."},{"key":"e_1_3_2_1_9_1","volume-title":"Distributed Computing","author":"Chockler Gregory","year":"2007","unstructured":"Gregory Chockler , Rachid Guerraoui , and Idit Keidar . Amnesic distributed storage . In Distributed Computing . Springer , 2007 . Gregory Chockler, Rachid Guerraoui, and Idit Keidar. Amnesic distributed storage. In Distributed Computing. Springer, 2007."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87779-0_13"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1009382.1009729"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1323293.1294269"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278305"},{"key":"e_1_3_2_1_14_1","volume-title":"On interprocess communication. Distributed computing, 1(2)","author":"Lamport Leslie","year":"1986","unstructured":"Leslie Lamport . On interprocess communication. Distributed computing, 1(2) , 1986 . Leslie Lamport. On interprocess communication. Distributed computing, 1(2), 1986."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/PDP.2010.60"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/07071158X"},{"key":"e_1_3_2_1_17_1","volume-title":"Space bounds for reliable storage: Fundamental limits of coding. arXiv preprint arXiv:1507.05169","author":"Spiegelman Alexander","year":"2015","unstructured":"Alexander Spiegelman , Yuval Cassuto , Gregory Chockler , and Idit Keidar . Space bounds for reliable storage: Fundamental limits of coding. arXiv preprint arXiv:1507.05169 , 2015 . Alexander Spiegelman, Yuval Cassuto, Gregory Chockler, and Idit Keidar. Space bounds for reliable storage: Fundamental limits of coding. arXiv preprint arXiv:1507.05169, 2015."},{"key":"e_1_3_2_1_18_1","volume-title":"Information Theory (ISIT), 2014 IEEE International Symposium on. IEEE","author":"Wang Zhiying","year":"2014","unstructured":"Zhiying Wang and Viveck Cadambe . Multi-version coding in distributed storage . In Information Theory (ISIT), 2014 IEEE International Symposium on. IEEE , 2014 . Zhiying Wang and Viveck Cadambe. Multi-version coding in distributed storage. In Information Theory (ISIT), 2014 IEEE International Symposium on. IEEE, 2014."}],"event":{"name":"PODC '16: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Chicago Illinois USA","acronym":"PODC '16"},"container-title":["Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933057.2933104","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2933057.2933104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:51Z","timestamp":1750222491000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933057.2933104"}},"subtitle":["Fundamental Limits of Coding"],"short-title":[],"issued":{"date-parts":[[2016,7,25]]},"references-count":18,"alternative-id":["10.1145\/2933057.2933104","10.1145\/2933057"],"URL":"https:\/\/doi.org\/10.1145\/2933057.2933104","relation":{},"subject":[],"published":{"date-parts":[[2016,7,25]]},"assertion":[{"value":"2016-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}