{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:53:19Z","timestamp":1773377599213,"version":"3.50.1"},"reference-count":37,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9173985","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"191-196","source":"Crossref","is-referenced-by-count":4,"title":["Coded QR Decomposition"],"prefix":"10.1109","author":[{"given":"Quang Minh","family":"Nguyen","sequence":"first","affiliation":[{"name":"National University of Singapore,Department of Computer Science"}]},{"given":"Haewon","family":"Jeong","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University,Department of Electrical and Computer Engineering"}]},{"given":"Pulkit","family":"Grover","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University,Department of Electrical and Computer Engineering"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.1206"},{"key":"ref32","article-title":"Full version of the paper","year":"0"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/11549468_90"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2013.01.006"},{"key":"ref37","first-page":"271","author":"rezaei","year":"2019","journal-title":"End-to-End Resilience for HPC Applications"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.2172\/1081941"},{"key":"ref35","doi-asserted-by":"crossref","DOI":"10.1016\/j.parco.2019.02.002","article-title":"Comparing the performance of rigid, moldable and grid-shaped applications on failure-prone hpc platforms","volume":"85","author":"f\u00e8vre","year":"2019","journal-title":"Parallel Computing"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1177\/1094342005051521"},{"key":"ref10","first-page":"225","article-title":"Algorithm-based fault tolerance for dense matrix factorizations","author":"du","year":"0"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2133173.2133179"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2600212.2600232"},{"key":"ref13","doi-asserted-by":"crossref","DOI":"10.1016\/0743-7315(88)90027-5","article-title":"An analysis of algorithm-based fault tolerance techniques","volume":"5","author":"luk","year":"1988","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(92)90100-2"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ASAP.1992.218551"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1995896.1995923"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0057933"},{"key":"ref18","article-title":"Low synchronization gmres algorithms","author":"swirydowicz","year":"2018"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/11549468_90"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2897189"},{"key":"ref4","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"arXiv preprint arXiv 1705 10464"},{"key":"ref27","doi-asserted-by":"crossref","DOI":"10.56021\/9781421407944","author":"golub","year":"2013","journal-title":"Matrix Computations"},{"key":"ref3","article-title":"Gradient coding","author":"tandon","year":"2016","journal-title":"arXiv preprint arXiv 1612 03301"},{"key":"ref6","article-title":"System resilience at extreme scale. Defense Advanced Research Project Agency (DARPA)","author":"elnozahy","year":"2008"},{"key":"ref29","author":"herault","year":"2015","journal-title":"Fault-Tolerance Techniques for High-Performance Computing"},{"key":"ref5","article-title":"On the optimal recovery threshold of coded matrix multiplication","author":"dutta","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref8","article-title":"Algorithmic Based Fault Tolerance Applied to High Performance Computing","author":"bosilca","year":"2008"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2006.1639333"},{"key":"ref2","article-title":"Short-dot: Computing large linear transforms distributedly using coded short dot products","author":"dutta","year":"2016","journal-title":"Advances in neural information processing systems"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1177\/1094342015578487"},{"key":"ref1","article-title":"Speeding up distributed machine learning using codes","author":"lee","year":"2017","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1080\/10637199808947392"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.120"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-9659(99)00028-2"},{"key":"ref24","article-title":"The linpack benchmark: Past, present, and future","author":"dongarra","year":"2002"},{"key":"ref23","article-title":"Givens and householder reductions for linear least squares on a cluster of workstations","author":"egecioglu","year":"1995","journal-title":"Santa Barbara CA Tech Rep"},{"key":"ref26","author":"sterling","year":"2017","journal-title":"High Performance Computing Modern Systems and Practices"},{"key":"ref25","article-title":"Spooles: An object-oriented sparse matrix library","author":"ashcraft","year":"1999","journal-title":"PPSC"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09173985.pdf?arnumber=9173985","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:32Z","timestamp":1773347672000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9173985\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9173985","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}