Author of the publication

Having Your Cake and Eating It Too: Jointly Optimal Erasure Codes for I/O, Storage, and Network-bandwidth.

, , , , and . FAST, page 81-94. USENIX Association, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Online Versus Offline Rate in Streaming Codes for Variable-Size Messages., and . ISIT, page 509-514. IEEE, (2020)GL-Cache: Group-level learning for efficient and high-performance caching., , , and . FAST, page 115-134. USENIX Association, (2023)Compression-Informed Coded Computing., , , and . ISIT, page 2177-2182. IEEE, (2023)Learning-augmented streaming codes for variable-size messages under partial burst losses., and . ISIT, page 1101-1106. IEEE, (2023)Learning-Augmented Streaming Codes are Approximately Optimal for Variable-Size Messages., and . ISIT, page 474-479. IEEE, (2022)Optimality of the product-matrix construction for secure MSR regenerating codes., , , , and . ISCCSP, page 10-14. IEEE, (2014)Optimal Systematic Distributed Storage Codes with Fast Encoding., , and . CoRR, (2015)Parity Models: A General Framework for Coding-Based Resilience in ML Inference., , and . CoRR, (2019)Tambur: Efficient loss recovery for videoconferencing via streaming codes., , , , , and . NSDI, page 953-971. USENIX Association, (2023)Explicit construction of optimal exact regenerating codes for distributed storage., , , and . Allerton, page 1243-1249. IEEE, (2009)