Ray Li

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 64

Top Topics

Error Correction

Semidefinite Programming

Top Venues

IEEE Trans. Inf. Theory

Publications

Omar Alrabiah, Venkatesan Guruswami, Ray Li
Randomly Punctured Reed-Solomon Codes Achieve List-Decoding Capacity over Linear-Sized Fields. STOC (2024)
Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings. SIAM J. Comput. 53 (2) (2024)
Roni Con, Zeyu Guo, Ray Li, Zihan Zhang
Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets. CoRR (2024)
Omar Alrabiah, Venkatesan Guruswami, Ray Li
AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets. SODA (2024)
Omar Alrabiah, Venkatesan Guruswami, Ray Li
AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets. CoRR (2023)
Venkatesan Guruswami, Xiaoyu He, Ray Li
The Zero-Rate Threshold for Adversarial Bit-Deletions is Less Than 1/2. IEEE Trans. Inf. Theory 69 (4) (2023)
Xiaoyu He, Ray Li
Approximating Binary Longest Common Subsequence in Almost-Linear Time. STOC (2023)
Omar Alrabiah, Venkatesan Guruswami, Ray Li
Randomly punctured Reed-Solomon codes achieve list-decoding capacity over linear-sized fields. Electron. Colloquium Comput. Complex. (2023)
Amir Abboud, Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams
On Diameter Approximation in Directed Graphs. ESA (2023)
Nouédyn Baspin, Venkatesan Guruswami, Anirudh Krishna, Ray Li
Improved rate-distance trade-offs for quantum codes with restricted connectivity. CoRR (2023)
Omar Alrabiah, Venkatesan Guruswami, Ray Li
Randomly punctured Reed-Solomon codes achieve list-decoding capacity over linear-sized fields. CoRR (2023)
Omar Alrabiah, Venkatesan Guruswami, Ray Li
AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets. Electron. Colloquium Comput. Complex. (2023)
Amir Abboud, Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams
On Diameter Approximation in Directed Graphs. CoRR (2023)
Sri Karlapati, Penny Karanasou, Mateusz Lajszczak, Ammar Abbas, Alexis Moinet, Peter Makarov, Ray Li, Arent van Korlaar, Simon Slangen, Thomas Drugman
CopyCat2: A Single Model for Multi-Speaker TTS and Many-to-Many Fine-Grained Prosody Transfer. CoRR (2022)
Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters
Bounds for List-Decoding and List-Recovery of Random Linear Codes. IEEE Trans. Inf. Theory 68 (2) (2022)
Sri Karlapati, Penny Karanasou, Mateusz Lajszczak, Syed Ammar Abbas, Alexis Moinet, Peter Makarov, Ray Li, Arent van Korlaar, Simon Slangen, Thomas Drugman
CopyCat2: A Single Model for Multi-Speaker TTS and Many-to-Many Fine-Grained Prosody Transfer. INTERSPEECH (2022)
Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams
Hardness of Approximate Diameter: Now for Undirected Graphs. FOCS (2022)
Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract]. FOCS (2022)
Ray Li, Mary Wootters
Improved batch code lower bounds. ISIT (2022)
Venkatesan Guruswami, Xiaoyu He, Ray Li
The zero-rate threshold for adversarial bit-deletions is less than 1/2. FOCS (2022)
Xiaoyu He, Ray Li
Approximating binary longest common subsequence in near-linear time. CoRR (2022)
Francisco Pernice, Ray Li, Mary Wootters
Efficient Near-Optimal Codes for General Repeat Channels. CoRR (2022)
Francisco Pernice, Ray Li, Mary Wootters
Efficient Capacity-Achieving Codes for General Repeat Channels. ISIT (2022)
Ray Li, Mary Wootters
Improved batch code lower bounds. CoRR (2021)
Venkatesan Guruswami, Xiaoyu He, Ray Li
The zero-rate threshold for adversarial bit-deletions is less than 1/2. Electron. Colloquium Comput. Complex. 28 (2021)
Ray Li, Mary Wootters
Improved List-Decodability of Random Linear Binary Codes. IEEE Trans. Inf. Theory 67 (3) (2021)
Jabari Hastings, Amy Kanne, Ray Li, Mary Wootters
Wedge-Lifted Codes. ISIT (2021)
Ray Li, Mary Wootters
Lifted Multiplicity Codes and the Disjoint Repair Group Property. IEEE Trans. Inf. Theory 67 (2) (2021)
Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract]. FOCS (2021)
Venkatesan Guruswami, Xiaoyu He, Ray Li
The zero-rate threshold for adversarial bit-deletions is less than 1/2. FOCS (2021)
Venkatesan Guruswami, Xiaoyu He, Ray Li
The zero-rate threshold for adversarial bit-deletions is less than 1/2. CoRR (2021)
Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams
Hardness of Approximate Diameter: Now for Undirected Graphs. FOCS (2021)
Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams
Hardness of Approximate Diameter: Now for Undirected Graphs. CoRR (2021)
Ray Li
Settling SETH vs. approximate sparse directed unweighted diameter (up to (NU)NSETH). STOC (2021)
Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan
Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming. SIAM J. Discret. Math. 35 (3) (2021)
Jacob Fox, Ray Li
On edge-ordered Ramsey numbers. Random Struct. Algorithms 57 (4) (2020)
Jabari Hastings, Amy Kanne, Ray Li, Mary Wootters
Wedge-Lifted Codes. CoRR (2020)
Ray Li
Improved SETH-hardness of unweighted Diameter. CoRR (2020)
Xiaoyu He, Ray Li
Hat Guessing Numbers of Degenerate Graphs. Electron. J. Comb. 27 (3) (2020)
Jacob Fox, Ray Li
On Ramsey numbers of hedgehogs. Comb. Probab. Comput. 29 (1) (2020)
Joshua Brakensiek, Ray Li, Bruce Spang
Coded trace reconstruction in a constant number of traces. FOCS (2020)
Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan
Lower Bounds for Max-Cut via Semidefinite Programming. LATIN (2020)
Ray Li, Percy Liang, Stephen Mussmann
A Tight Analysis of Greedy Yields Subexponential Time Approximation for Uniform Decision Tree. SODA (2020)
Venkatesan Guruswami, Ray Li
Coding Against Deletions in Oblivious and Online Models. IEEE Trans. Inf. Theory 66 (4) (2020)
Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
Improved List-Decodability of Reed-Solomon Codes via Tree Packings. CoRR (2020)
Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters
Bounds for list-decoding and list-recovery of random linear codes. CoRR (2020)
Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters
Bounds for List-Decoding and List-Recovery of Random Linear Codes. APPROX-RANDOM (2020)
Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
Improved List-Decodability of Reed-Solomon Codes via Tree Packings. Electron. Colloquium Comput. Complex. 27 (2020)
Jacob Fox, Ray Li
On Ramsey numbers of hedgehogs. CoRR (2019)
Joshua Brakensiek, Ray Li, Bruce Spang
Coded trace reconstruction in a constant number of traces. CoRR (2019)
Serge Gaspers, Ray Li
Enumeration of Preferred Extensions in Almost Oriented Digraphs. MFCS (2019)
Venkatesan Guruswami, Ray Li
Polynomial Time Decodable Codes for the Binary Deletion Channel. IEEE Trans. Inf. Theory 65 (4) (2019)
Ray Li, Mary Wootters
Lifted Multiplicity Codes and the Disjoint Repair Group Property. APPROX-RANDOM (2019)
Serge Gaspers, Ray Li
Enumeration of Preferred Extensions in Almost Oriented Digraphs. CoRR (2019)
Ray Li, Percy Liang, Stephen Mussmann
A Tight Analysis of Greedy Yields Subexponential Time Approximation for Uniform Decision Tree. CoRR (2019)
Ray Li, Mary Wootters
Lifted Multiplicity Codes. CoRR (2019)
Ray Li, Mary Wootters
Random linear binary codes have smaller list sizes than uniformly random binary codes. CoRR (2018)
Venkatesan Guruswami, Ray Li
Coding against deletions in oblivious and online models. SODA (2018)
Ray Li, Mary Wootters
Improved List-Decodability of Random Linear Binary Codes. APPROX-RANDOM (2018)
Venkatesan Guruswami, Ray Li
Efficiently Decodable Codes for the Binary Deletion Channel. APPROX-RANDOM (2017)
Venkatesan Guruswami, Ray Li
Efficiently decodable codes for the binary deletion channel. CoRR (2017)
Venkatesan Guruswami, Ray Li
Codes correcting deletions in oblivious and random models. CoRR (2016)
Venkatesan Guruswami, Ray Li
Efficiently decodable insertion/deletion codes for high-noise and high-rate regimes. ISIT (2016)
Venkatesan Guruswami, Ray Li
Efficiently decodable insertion/deletion codes for high-noise and high-rate regimes. CoRR (2016)
Sameh G. Khalil, Rongming Chu, Ray Li, Danny Wong, Scott Newell, Xu Chen, M. Chen, D. Zehnder, S. Kim, A. Corrion, Brian Hughes, Karim Boutros, C. Namuduri
Critical gate module process enabling the implementation of a 50A/600V AlGaN/GaN MOS-HEMT. ESSDERC (2012)