{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:15:20Z","timestamp":1740100520626,"version":"3.37.3"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foun-dation of China (NSFC)","doi-asserted-by":"publisher","award":["61901534"],"award-info":[{"award-number":["61901534"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1109\/globecom46510.2021.9685369","type":"proceedings-article","created":{"date-parts":[[2022,2,2]],"date-time":"2022-02-02T21:59:04Z","timestamp":1643839144000},"page":"1-6","source":"Crossref","is-referenced-by-count":2,"title":["Fault-Tolerant Computation Meets Network Coding: Optimal Scheduling in Parallel Computing"],"prefix":"10.1109","author":[{"given":"Congduan","family":"Li","sequence":"first","affiliation":[{"name":"Sun Yat-sen University,School of Electronics and Communication Engineering,Shenzhen,China"}]},{"given":"Chee Wei","family":"Tan","sequence":"additional","affiliation":[{"name":"City University of Hong Kong,Department of Computer Science,Hong Kong"}]},{"given":"Jingting","family":"Li","sequence":"additional","affiliation":[{"name":"City University of Hong Kong,Department of Computer Science,Hong Kong"}]},{"given":"Siya","family":"Chen","sequence":"additional","affiliation":[{"name":"City University of Hong Kong,Department of Computer Science,Hong Kong"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"journal-title":"Elementary Number Theory and Its Applications","year":"2000","author":"rosen","key":"ref12"},{"key":"ref13","volume":"2","author":"knuth","year":"1997","journal-title":"The art of computer programming"},{"journal-title":"Chinese Remainder Theorem Applications in Computing Coding Cryptography","year":"1996","author":"pei","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301309"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2846228"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2216937"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/263876.263881"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.86.21.8178"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1272996.1273005"},{"key":"ref6","first-page":"414","article-title":"The great prime number record races","volume":"51","author":"ziegler","year":"2004","journal-title":"Notices of the AMS"},{"key":"ref5","first-page":"54","article-title":"Schönhage-strassen algorithm with mapreduce for multiplying terabit integers","author":"sze","year":"0","journal-title":"Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/107109"},{"key":"ref7","article-title":"A possible new quantum algorithm: arithmetic with large integers via the chinese remainder theorem","author":"fulling","year":"1999","journal-title":"arXiv preprint quant-ph"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2934664"},{"key":"ref9","article-title":"Fast multiplication of large integers: Implementation and analysis of the DKSS algorithm","volume":"abs 1503 4955","author":"l\u00fcders","year":"2015","journal-title":"CoRR"},{"key":"ref1","first-page":"137","article-title":"Mapreduce: Simplified data processing on large clusters","author":"dean","year":"2004","journal-title":"Sixth Symposium on Operating System Design and Implementation"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2873128"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"}],"event":{"name":"GLOBECOM 2021 - 2021 IEEE Global Communications Conference","start":{"date-parts":[[2021,12,7]]},"location":"Madrid, Spain","end":{"date-parts":[[2021,12,11]]}},"container-title":["2021 IEEE Global Communications Conference (GLOBECOM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9685019\/9685006\/09685369.pdf?arnumber=9685369","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,6]],"date-time":"2022-06-06T20:25:12Z","timestamp":1654547112000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9685369\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/globecom46510.2021.9685369","relation":{},"subject":[],"published":{"date-parts":[[2021,12]]}}}