| 2026 | ASPLOS | SEVI: Silent Data Corruption of Vector Instructions in Hyper-Scale Datacenters. | Yixuan Mei, Shreya Varshini, Harish Dattatraya Dixit, Sriram Sankar, K. V. Rashmi |
| 2026 | EuroSys | TCO-driven Storage Provisioning for Exascale Data Centers. | Timothy Kim, Saurabh Kadekodi, Arif Merchant, Prashant Nema, Jai Menon, K. V. Rashmi, Gregory R. Ganger |
| 2026 | ISIT | Bandwidth Cost of Locally Repairable Convertible Codes in the Global Merge Regime. | Saransh Chopra, Shubhransh Singhvi, K. V. Rashmi |
| 2026 | ISIT | Lower Bounds on Code Conversion Bandwidth via a Novel Information-theoretic Approach. | Shubhransh Singhvi, Saransh Chopra, K. V. Rashmi |
| 2025 | ISIT | Secure Convertible Codes for Passive Eavesdroppers. | Justin Zhang, K. V. Rashmi |
| 2025 | OSDI | Okapi: Decoupling Data Striping and Redundancy Grouping in Cluster File Systems. | Sanjith Athlur, Timothy Kim, Saurabh Kadekodi, Francisco Maturana, Xavier Ramos, Arif Merchant, K. V. Rashmi, Gregory R. Ganger |
| 2024 | ISIT | On Low Field Size Constructions of Access-Optimal Convertible Codes. | Saransh Chopra, Francisco Maturana, K. V. Rashmi |
| 2024 | NSDI | SIEVE is Simpler than LRU: an Efficient Turn-Key Eviction Algorithm for Web Caches. | Yazhuo Zhang, Juncheng Yang, Yao Yue, Ymir Vigfusson, K. V. Rashmi |
| 2024 | SP | Communication-efficient, Fault Tolerant PIR over Erasure Coded Storage. | Andrew Park, Trevor Leong, Francisco Maturana, Wenting Zheng, K. V. Rashmi |
| 2024 | SOSP | Morph: Efficient File-Lifetime Redundancy Management for Cluster File Systems. | Timothy Kim, Sanjith Athlur, Saurabh Kadekodi, Francisco Maturana, Dax Delvira, Arif Merchant, Gregory R. Ganger, K. V. Rashmi |
| 2023 | FAST | GL-Cache: Group-level learning for efficient and high-performance caching. | Juncheng Yang, Ziming Mao, Yao Yue, K. V. Rashmi |
| 2023 | HotOS | FIFO can be Better than LRU: the Power of Lazy Promotion and Quick Demotion. | Juncheng Yang, Ziyue Qiu, Yazhuo Zhang, Yao Yue, K. V. Rashmi |
| 2023 | ISIT | Locally Repairable Convertible Codes: Erasure Codes for Efficient Repair and Conversion. | Francisco Maturana, K. V. Rashmi |
| 2023 | ISIT | Compression-Informed Coded Computing. | Michael Rudow, Neophytos Charalambides, Alfred O. Hero III, K. V. Rashmi |
| 2023 | ISIT | On expanding the toolkit of locality-based coded computation to the coordinates of inputs. | Michael Rudow, Venkatesan Guruswami, K. V. Rashmi |
| 2023 | ISIT | Learning-augmented streaming codes for variable-size messages under partial burst losses. | Michael Rudow, K. V. Rashmi |
| 2023 | NSDI | Tambur: Efficient loss recovery for videoconferencing via streaming codes. | Michael Rudow, Francis Y. Yan, Abhishek Kumar, Ganesh Ananthanarayanan, Martin Ellis, K. V. Rashmi |
| 2022 | ISIT | Bandwidth Cost of Code Conversions in the Split Regime. | Francisco Maturana, K. V. Rashmi |
| 2022 | ISIT | Learning-Augmented Streaming Codes are Approximately Optimal for Variable-Size Messages. | Michael Rudow, K. V. Rashmi |
| 2022 | NSDI | C2DN: How to Harness Erasure Codes at the Edge for Efficient Content Delivery. | Juncheng Yang, Anirudh Sabnis, Daniel S. Berger, K. V. Rashmi, Ramesh K. Sitaraman |
| 2022 | OSDI | Tiger: Disk-Adaptive Redundancy Without Placement Restrictions. | Saurabh Kadekodi, Francisco Maturana, Sanjith Athlur, Arif Merchant, K. V. Rashmi, Gregory R. Ganger |
| 2021 | ISIT | Bandwidth Cost of Code Conversions in Distributed Storage: Fundamental Limits and Optimal Constructions. | Francisco Maturana, K. V. Rashmi |
| 2021 | ISIT | Irregular Array Codes with Arbitrary Access Sets for Geo-Distributed Storage. | Francisco Maturana, K. V. Rashmi |
| 2021 | ISIT | A locality-based lens for coded computation. | Michael Rudow, K. V. Rashmi, Venkatesan Guruswami |
| 2021 | SC | Arithmetic-intensity-guided fault tolerance for neural network inference on GPUs. | Jack Kosaian, K. V. Rashmi |
| 2020 | ISIT | Access-optimal Linear MDS Convertible Codes for All Parameters. | Francisco Maturana, V. S. Chaitanya Mukka, K. V. Rashmi |
| 2020 | ISIT | Online Versus Offline Rate in Streaming Codes for Variable-Size Messages. | Michael Rudow, K. V. Rashmi |
| 2020 | OSDI | PACEMAKER: Avoiding HeART attacks in storage clusters with disk-adaptive redundancy. | Saurabh Kadekodi, Francisco Maturana, Suhas Jayaram Subramanya, Juncheng Yang, K. V. Rashmi, Gregory R. Ganger |
| 2020 | OSDI | A large scale analysis of hundreds of in-memory cache clusters at Twitter. | Juncheng Yang, Yao Yue, K. V. Rashmi |
| 2019 | FAST | Cluster storage systems gotta have HeART: improving storage efficiency by exploiting disk-reliability heterogeneity. | Saurabh Kadekodi, K. V. Rashmi, Gregory R. Ganger |
| 2019 | SIGCOMM | Vantage: optimizing video upload for time-shifted viewing of social live streams. | Devdeep Ray, Jack Kosaian, K. V. Rashmi, Srinivasan Seshan |
| 2019 | SOSP | Parity models: erasure-coded resilience for prediction serving systems. | Jack Kosaian, K. V. Rashmi, Shivaram Venkataraman |
| 2016 | ISIT | Optimal systematic distributed storage codes with fast encoding. | Preetum Nakkiran, K. V. Rashmi, Kannan Ramchandran |
| 2016 | OSDI | EC-Cache: Load-Balanced, Low-Latency Cluster Caching with Online Erasure Coding. | K. V. Rashmi, Mosharaf Chowdhury, Jack Kosaian, Ion Stoica, Kannan Ramchandran |
| 2015 | FAST | Having Your Cake and Eating It Too: Jointly Optimal Erasure Codes for I/O, Storage, and Network-bandwidth. | K. V. Rashmi, Preetum Nakkiran, Jingyan Wang, Nihar B. Shah, Kannan Ramchandran |
| 2014 | GLOBECOM | Fundamental limits on communication for oblivious updates in storage networks. | Preetum Nakkiran, Nihar B. Shah, K. V. Rashmi |
| 2014 | ISIT | One extra bit of download ensures perfectly private information retrieval. | Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran |
| 2014 | SIGCOMM | A "hitchhiker's" guide to fast and efficient data reconstruction in erasure-coded data centers. | K. V. Rashmi, Nihar B. Shah, Dikang Gu, Hairong Kuang, Dhruba Borthakur, Kannan Ramchandran |
| 2013 | ISIT | A piggybacking design framework for read-and download-efficient distributed storage codes. | K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran |
| 2013 | ISIT | Secure network coding for distributed secret sharing with low communication cost. | Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran |
| 2012 | ISIT | Regenerating codes for errors and erasures in distributed storage. | K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran, P. Vijay Kumar |
| 2011 | GLOBECOM | Information-Theoretically Secure Regenerating Codes for Distributed Storage. | Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar |
| 2011 | ISIT | Enabling node repair in any erasure code for distributed storage. | K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar |
| 2010 | ISIT | Explicit and optimal exact-regenerating codes for the minimum-bandwidth point in distributed storage. | K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar, Kannan Ramchandran |
| 2010 | ISIT | A flexible class of regenerating codes for distributed storage. | Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar |
| 2010 | ITA | Explicit and optimal codes for distributed storage. | K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar, Kannan Ramchandran |
| 2010 | WAIFI | Regenerating Codes for Distributed Storage Networks. | Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran |