Ray Li - RankMe

75 papers A* 12A 3B 6Journal 47Unranked 6

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	AG Codes Have No List-Decoding Friends: Approaching the Generalized Singleton Bound Requires Exponential Alphabets. IEEE Trans. Inf. Theory Omar Alrabiah, Venkatesan Guruswami, Ray Li
2025	J	`jnl`	Expected Length of the Longest Common Subsequence of Multiple Strings. CoRR Ray Li, William Ren, Yiran Wen
2025	J	`jnl`	Hardness of Approximate Diameter: Now for Undirected Graphs. J. ACM Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams
2025	A*	`conf`	Locality vs Quantum Codes. STOC Samuel Dai, Ray Li
2025	A	`conf`	Near-Optimal List-Recovery of Linear Code Families. APPROX/RANDOM Ray Li, Nikhil Shagrithaya
2025	J	`jnl`	Near-Optimal List-Recovery of Linear Code Families. CoRR Ray Li, Nikhil Shagrithaya
2025	J	`jnl`	Oblivious Deletion Codes. CoRR Roni Con, Ray Li
2025	—	`conf`	Optimal Locality and Parameter Tradeoffs for Subsystem Codes. TQC Samuel Dai, Ray Li, Eugene Tang
2025	J	`jnl`	Optimal Locality and Parameter Tradeoffs for Subsystem Codes. CoRR Samuel Dai, Ray Li, Eugene Tang
2025	A*	`conf`	Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets. ICALP Roni Con, Zeyu Guo, Ray Li, Zihan Zhang
2024	J	`jnl`	A Debate-Driven Experiment on LLM Hallucinations and Accuracy. CoRR Ray Li, Tanishka Bagade, Kevin Martinez, Flora Yasmin, Grant Ayala, Michael Lam, Kevin Zhu
2024	A*	`conf`	AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets. SODA Omar Alrabiah, Venkatesan Guruswami, Ray Li
2024	J	`jnl`	Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings. SIAM J. Comput. Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
2024	J	`jnl`	Locality vs Quantum Codes. CoRR Samuel Dai, Ray Li
2024	J	`jnl`	Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets. CoRR Roni Con, Zeyu Guo, Ray Li, Zihan Zhang
2024	A*	`conf`	Randomly Punctured Reed-Solomon Codes Achieve List-Decoding Capacity over Linear-Sized Fields. STOC Omar Alrabiah, Venkatesan Guruswami, Ray Li
2023	J	`jnl`	AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets. CoRR Omar Alrabiah, Venkatesan Guruswami, Ray Li
2023	J	`jnl`	AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets. Electron. Colloquium Comput. Complex. Omar Alrabiah, Venkatesan Guruswami, Ray Li
2023	A*	`conf`	Approximating Binary Longest Common Subsequence in Almost-Linear Time. STOC Xiaoyu He, Ray Li
2023	J	`jnl`	Improved rate-distance trade-offs for quantum codes with restricted connectivity. CoRR Nouédyn Baspin, Venkatesan Guruswami, Anirudh Krishna, Ray Li
2023	A	`conf`	On Diameter Approximation in Directed Graphs. ESA Amir Abboud, Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams
2023	J	`jnl`	On Diameter Approximation in Directed Graphs. CoRR Amir Abboud, Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams
2023	J	`jnl`	Randomly punctured Reed-Solomon codes achieve list-decoding capacity over linear-sized fields. CoRR Omar Alrabiah, Venkatesan Guruswami, Ray Li
2023	J	`jnl`	Randomly punctured Reed-Solomon codes achieve list-decoding capacity over linear-sized fields. Electron. Colloquium Comput. Complex. Omar Alrabiah, Venkatesan Guruswami, Ray Li
2023	J	`jnl`	The Zero-Rate Threshold for Adversarial Bit-Deletions is Less Than 1/2. IEEE Trans. Inf. Theory Venkatesan Guruswami, Xiaoyu He, Ray Li
2022	J	`jnl`	Approximating binary longest common subsequence in near-linear time. CoRR Xiaoyu He, Ray Li
2022	J	`jnl`	Bounds for List-Decoding and List-Recovery of Random Linear Codes. IEEE Trans. Inf. Theory Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters
2022	A	`conf`	CopyCat2: A Single Model for Multi-Speaker TTS and Many-to-Many Fine-Grained Prosody Transfer. INTERSPEECH Sri Karlapati, Penny Karanasou, Mateusz Lajszczak, Syed Ammar Abbas, Alexis Moinet, Peter Makarov, Ray Li, Arent van Korlaar, Simon Slangen, Thomas Drugman
2022	J	`jnl`	CopyCat2: A Single Model for Multi-Speaker TTS and Many-to-Many Fine-Grained Prosody Transfer. CoRR Sri Karlapati, Penny Karanasou, Mateusz Lajszczak, Ammar Abbas, Alexis Moinet, Peter Makarov, Ray Li, Arent van Korlaar, Simon Slangen, Thomas Drugman
2022	B	`conf`	Efficient Capacity-Achieving Codes for General Repeat Channels. ISIT Francisco Pernice, Ray Li, Mary Wootters
2022	J	`jnl`	Efficient Near-Optimal Codes for General Repeat Channels. CoRR Francisco Pernice, Ray Li, Mary Wootters
2022	B	`conf`	Improved batch code lower bounds. ISIT Ray Li, Mary Wootters
2022	—	`—`	New combinatorial bounds for error correcting codes. Ray Li
2021	A*	`conf`	Hardness of Approximate Diameter: Now for Undirected Graphs. FOCS Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams
2021	J	`jnl`	Hardness of Approximate Diameter: Now for Undirected Graphs. CoRR Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams
2021	A*	`conf`	Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract]. FOCS Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
2021	J	`jnl`	Improved List-Decodability of Random Linear Binary Codes. IEEE Trans. Inf. Theory Ray Li, Mary Wootters
2021	J	`jnl`	Improved batch code lower bounds. CoRR Ray Li, Mary Wootters
2021	J	`jnl`	Lifted Multiplicity Codes and the Disjoint Repair Group Property. IEEE Trans. Inf. Theory Ray Li, Mary Wootters
2021	J	`jnl`	Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming. SIAM J. Discret. Math. Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan
2021	A*	`conf`	Settling SETH vs. approximate sparse directed unweighted diameter (up to (NU)NSETH). STOC Ray Li
2021	A*	`conf`	The zero-rate threshold for adversarial bit-deletions is less than 1/2. FOCS Venkatesan Guruswami, Xiaoyu He, Ray Li
2021	J	`jnl`	The zero-rate threshold for adversarial bit-deletions is less than 1/2. CoRR Venkatesan Guruswami, Xiaoyu He, Ray Li
2021	J	`jnl`	The zero-rate threshold for adversarial bit-deletions is less than 1/2. Electron. Colloquium Comput. Complex. Venkatesan Guruswami, Xiaoyu He, Ray Li
2021	B	`conf`	Wedge-Lifted Codes. ISIT Jabari Hastings, Amy Kanne, Ray Li, Mary Wootters
2020	A*	`conf`	A Tight Analysis of Greedy Yields Subexponential Time Approximation for Uniform Decision Tree. SODA Ray Li, Percy Liang, Stephen Mussmann
2020	—	`conf`	Bounds for List-Decoding and List-Recovery of Random Linear Codes. APPROX-RANDOM Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters
2020	J	`jnl`	Bounds for list-decoding and list-recovery of random linear codes. CoRR Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters
2020	A*	`conf`	Coded trace reconstruction in a constant number of traces. FOCS Joshua Brakensiek, Ray Li, Bruce Spang
2020	J	`jnl`	Coding Against Deletions in Oblivious and Online Models. IEEE Trans. Inf. Theory Venkatesan Guruswami, Ray Li
2020	J	`jnl`	Hat Guessing Numbers of Degenerate Graphs. Electron. J. Comb. Xiaoyu He, Ray Li
2020	J	`jnl`	Improved List-Decodability of Reed-Solomon Codes via Tree Packings. CoRR Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
2020	J	`jnl`	Improved List-Decodability of Reed-Solomon Codes via Tree Packings. Electron. Colloquium Comput. Complex. Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
2020	J	`jnl`	Improved SETH-hardness of unweighted Diameter. CoRR Ray Li
2020	B	`conf`	Lower Bounds for Max-Cut via Semidefinite Programming. LATIN Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan
2020	J	`jnl`	On Ramsey numbers of hedgehogs. Comb. Probab. Comput. Jacob Fox, Ray Li
2020	J	`jnl`	On edge-ordered Ramsey numbers. Random Struct. Algorithms Jacob Fox, Ray Li
2020	J	`jnl`	Wedge-Lifted Codes. CoRR Jabari Hastings, Amy Kanne, Ray Li, Mary Wootters
2019	J	`jnl`	A Tight Analysis of Greedy Yields Subexponential Time Approximation for Uniform Decision Tree. CoRR Ray Li, Percy Liang, Stephen Mussmann
2019	J	`jnl`	Coded trace reconstruction in a constant number of traces. CoRR Joshua Brakensiek, Ray Li, Bruce Spang
2019	B	`conf`	Enumeration of Preferred Extensions in Almost Oriented Digraphs. MFCS Serge Gaspers, Ray Li
2019	J	`jnl`	Enumeration of Preferred Extensions in Almost Oriented Digraphs. CoRR Serge Gaspers, Ray Li
2019	—	`conf`	Lifted Multiplicity Codes and the Disjoint Repair Group Property. APPROX-RANDOM Ray Li, Mary Wootters
2019	J	`jnl`	Lifted Multiplicity Codes. CoRR Ray Li, Mary Wootters
2019	J	`jnl`	On Ramsey numbers of hedgehogs. CoRR Jacob Fox, Ray Li
2019	J	`jnl`	Polynomial Time Decodable Codes for the Binary Deletion Channel. IEEE Trans. Inf. Theory Venkatesan Guruswami, Ray Li
2018	A*	`conf`	Coding against deletions in oblivious and online models. SODA Venkatesan Guruswami, Ray Li
2018	—	`conf`	Improved List-Decodability of Random Linear Binary Codes. APPROX-RANDOM Ray Li, Mary Wootters
2018	J	`jnl`	Random linear binary codes have smaller list sizes than uniformly random binary codes. CoRR Ray Li, Mary Wootters
2017	—	`conf`	Efficiently Decodable Codes for the Binary Deletion Channel. APPROX-RANDOM Venkatesan Guruswami, Ray Li
2017	J	`jnl`	Efficiently decodable codes for the binary deletion channel. CoRR Venkatesan Guruswami, Ray Li
2016	J	`jnl`	Codes correcting deletions in oblivious and random models. CoRR Venkatesan Guruswami, Ray Li
2016	B	`conf`	Efficiently decodable insertion/deletion codes for high-noise and high-rate regimes. ISIT Venkatesan Guruswami, Ray Li
2016	J	`jnl`	Efficiently decodable insertion/deletion codes for high-noise and high-rate regimes. CoRR Venkatesan Guruswami, Ray Li
2012	—	`conf`	Critical gate module process enabling the implementation of a 50A/600V AlGaN/GaN MOS-HEMT. ESSDERC 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