| 2025 | ICALP | Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets. | Roni Con, Zeyu Guo, Ray Li, Zihan Zhang |
| 2025 | STOC | Locality vs Quantum Codes. | Samuel Dai, Ray Li |
| 2024 | SODA | AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets. | Omar Alrabiah, Venkatesan Guruswami, Ray Li |
| 2024 | STOC | Randomly Punctured Reed-Solomon Codes Achieve List-Decoding Capacity over Linear-Sized Fields. | Omar Alrabiah, Venkatesan Guruswami, Ray Li |
| 2023 | ESA | On Diameter Approximation in Directed Graphs. | Amir Abboud, Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams |
| 2023 | STOC | Approximating Binary Longest Common Subsequence in Almost-Linear Time. | Xiaoyu He, Ray Li |
| 2022 | Interspeech | CopyCat2: A Single Model for Multi-Speaker TTS and Many-to-Many Fine-Grained Prosody Transfer. | Sri Karlapati, Penny Karanasou, Mateusz Lajszczak, Syed Ammar Abbas, Alexis Moinet, Peter Makarov, Ray Li, Arent van Korlaar, Simon Slangen, Thomas Drugman |
| 2022 | ISIT | Improved batch code lower bounds. | Ray Li, Mary Wootters |
| 2022 | ISIT | Efficient Capacity-Achieving Codes for General Repeat Channels. | Francisco Pernice, Ray Li, Mary Wootters |
| 2021 | FOCS | Hardness of Approximate Diameter: Now for Undirected Graphs. | Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams |
| 2021 | FOCS | Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract]. | Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters |
| 2021 | FOCS | The zero-rate threshold for adversarial bit-deletions is less than 1/2. | Venkatesan Guruswami, Xiaoyu He, Ray Li |
| 2021 | ISIT | Wedge-Lifted Codes. | Jabari Hastings, Amy Kanne, Ray Li, Mary Wootters |
| 2021 | STOC | Settling SETH vs. approximate sparse directed unweighted diameter (up to (NU)NSETH). | Ray Li |
| 2020 | FOCS | Coded trace reconstruction in a constant number of traces. | Joshua Brakensiek, Ray Li, Bruce Spang |
| 2020 | LATIN | Lower Bounds for Max-Cut via Semidefinite Programming. | Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan |
| 2020 | SODA | A Tight Analysis of Greedy Yields Subexponential Time Approximation for Uniform Decision Tree. | Ray Li, Percy Liang, Stephen Mussmann |
| 2019 | MFCS | Enumeration of Preferred Extensions in Almost Oriented Digraphs. | Serge Gaspers, Ray Li |
| 2018 | SODA | Coding against deletions in oblivious and online models. | Venkatesan Guruswami, Ray Li |
| 2016 | ISIT | Efficiently decodable insertion/deletion codes for high-noise and high-rate regimes. | Venkatesan Guruswami, Ray Li |