{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:31:53Z","timestamp":1750221113761,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,16]],"date-time":"2019-07-16T00:00:00Z","timestamp":1563235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1705007, CCF-1703575, CCF-1763673"],"award-info":[{"award-number":["CCF-1705007, CCF-1703575, CCF-1763673"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Distributed Technologies Research"},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF1810332, W911NF1810400"],"award-info":[{"award-number":["W911NF1810332, W911NF1810400"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["HR001117C0053"],"award-info":[{"award-number":["HR001117C0053"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,16]]},"DOI":"10.1145\/3293611.3331573","type":"proceedings-article","created":{"date-parts":[[2019,7,19]],"date-time":"2019-07-19T13:17:21Z","timestamp":1563542241000},"page":"150-152","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Coded State Machine -- Scaling State Machine Execution under Byzantine Faults"],"prefix":"10.1145","author":[{"given":"Songze","family":"Li","sequence":"first","affiliation":[{"name":"University of Southern California, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saeid","family":"Sahraei","sequence":"additional","affiliation":[{"name":"University of Southern California, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingchao","family":"Yu","sequence":"additional","affiliation":[{"name":"University of Southern California, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salman","family":"Avestimehr","sequence":"additional","affiliation":[{"name":"University of Southern California, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sreeram","family":"Kannan","sequence":"additional","affiliation":[{"name":"University of Washington, Seattle, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pramod","family":"Viswanath","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of the 2nd international conference on Software engineering. IEEE Computer Society Press, 562--570","author":"Alsberg Peter A","year":"1976","unstructured":"Peter A Alsberg and John D Day . 1976 . A principle for resilient sharing of distributed resources . In Proceedings of the 2nd international conference on Software engineering. IEEE Computer Society Press, 562--570 . Peter A Alsberg and John D Day. 1976. A principle for resilient sharing of distributed resources. In Proceedings of the 2nd international conference on Software engineering. IEEE Computer Society Press, 562--570."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-014-0209-4"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2006.56"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933118"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/571637.571640"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/7531.7533"},{"key":"e_1_3_2_1_7_1","volume-title":"Short-dot: Computing large linear transforms distributedly using coded short dot products. In NIPS. 2100--2108.","author":"Dutta Sanghamitra","year":"2016","unstructured":"Sanghamitra Dutta , Viveck Cadambe , and Pulkit Grover . 2016 . Short-dot: Computing large linear transforms distributedly using coded short dot products. In NIPS. 2100--2108. Sanghamitra Dutta, Viveck Cadambe, and Pulkit Grover. 2016. Short-dot: Computing large linear transforms distributedly using coded short dot products. In NIPS. 2100--2108."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897845.2897910"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382250"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1323293.1294269"},{"key":"e_1_3_2_1_12_1","volume-title":"The implementation of reliable distributed multiprocess systems. Computer networks","author":"Lamport Leslie","year":"1978","unstructured":"Leslie Lamport . 1978. The implementation of reliable distributed multiprocess systems. Computer networks , Vol. 2 , 2 ( 1978 ), 95--114. Leslie Lamport. 1978. The implementation of reliable distributed multiprocess systems. Computer networks, Vol. 2, 2 (1978), 95--114."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.980009"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2016.7848828"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/62546.62549"},{"key":"e_1_3_2_1_20_1","volume-title":"INTERPOL: Information Theoretically Verifiable Polynomial Evaluation. arXiv preprint arXiv:1901.03379","author":"Sahraei Saeid","year":"2019","unstructured":"Saeid Sahraei and A Salman Avestimehr . 2019 . INTERPOL: Information Theoretically Verifiable Polynomial Evaluation. arXiv preprint arXiv:1901.03379 (2019). Saeid Sahraei and A Salman Avestimehr. 2019. INTERPOL: Information Theoretically Verifiable Polynomial Evaluation. arXiv preprint arXiv:1901.03379 (2019)."},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of the 34th International Conference on Machine Learning. 3368--3376","author":"Tandon Rashish","year":"2017","unstructured":"Rashish Tandon , Qi Lei , Alexandros G. Dimakis , and Nikos Karampatziakis . 2017 . Gradient Coding: Avoiding Stragglers in Distributed Learning . In Proceedings of the 34th International Conference on Machine Learning. 3368--3376 . Rashish Tandon, Qi Lei, Alexandros G. Dimakis, and Nikos Karampatziakis. 2017. Gradient Coding: Avoiding Stragglers in Distributed Learning. In Proceedings of the 34th International Conference on Machine Learning. 3368--3376."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2725273"},{"key":"e_1_3_2_1_23_1","volume-title":"Mahdi Soltanolkotabi, and A Salman Avestimehr.","author":"Yu Qian","year":"2019","unstructured":"Qian Yu , Songze Li , Netanel Raviv , Seyed Mohammadreza Mousavi Kalan , Mahdi Soltanolkotabi, and A Salman Avestimehr. 2019 . Lagrange Coded Computing: Optimal Design for Resiliency, Security, and Privacy. In AISTATS . Qian Yu, Songze Li, Netanel Raviv, Seyed Mohammadreza Mousavi Kalan, Mahdi Soltanolkotabi, and A Salman Avestimehr. 2019. Lagrange Coded Computing: Optimal Design for Resiliency, Security, and Privacy. In AISTATS ."},{"key":"e_1_3_2_1_24_1","volume-title":"Mohammad Ali Maddah-Ali, and A Salman Avestimehr","author":"Yu Qian","year":"2017","unstructured":"Qian Yu , Mohammad Ali Maddah-Ali, and A Salman Avestimehr . 2017 . Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication. In NIPS. 4406--4416. Qian Yu, Mohammad Ali Maddah-Ali, and A Salman Avestimehr. 2017. Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication. In NIPS. 4406--4416."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13257-0_10"}],"event":{"name":"PODC '19: 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":"Toronto ON Canada","acronym":"PODC '19"},"container-title":["Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3293611.3331573","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3293611.3331573","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3293611.3331573","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:01Z","timestamp":1750208521000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3293611.3331573"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,16]]},"references-count":25,"alternative-id":["10.1145\/3293611.3331573","10.1145\/3293611"],"URL":"https:\/\/doi.org\/10.1145\/3293611.3331573","relation":{},"subject":[],"published":{"date-parts":[[2019,7,16]]},"assertion":[{"value":"2019-07-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}