Preprint.
[ arXiv ]Roni Con, Zeyu Guo, Ray Li, Zihan Zhang.
Preprint.
[ arXiv ]Randomly punctured Reed–Solomon codes achieve list-decoding capacity over linear-sized fields,
Omar Alrabiah, Venkatesan Guruswami, Ray Li.
STOC, 2024.
[ arXiv ] [ ECCC ]Improved rate-distance trade-offs for quantum codes with restricted connectivity,
Nouédyn Baspin, Venkatesan Guruswami, Anirudh Krishna, Ray Li.
QIP, 2024.
[ arXiv ]Omar Alrabiah, Venkatesan Guruswami, Ray Li.
IEEE Transactions on Information Theory, 2024, Conference version in SODA 2024.
[ arXiv ] [ ECCC ] [ journal ]On Diameter Approximation in Directed Graphs,
Amir Abboud, Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams.
ESA, 2023.
[ arXiv ]Approximating binary longest common subsequence in almost-linear time,
STOC, 2023.
[ arXiv ]Efficient Near-Optimal Codes for General Repeat Channels,
Francisco Pernice, Ray Li, Mary Wootters.
ISIT, 2022.
[ arXiv ]Improved batch code lower bounds,
ISIT, 2022.
[ arXiv ]The zero rate threshold for adversarial bit deletions is less than 1/2,
Venkatesan Guruswami, Xiaoyu He, Ray Li.
FOCS, 2021.
[ arXiv ] [ ECCC ]Hardness of Approximate Diameter: Now for Undirected Graphs,
Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams.
FOCS, 2021.
[ arXiv ]Improved List-Decodability of Reed--Solomon Codes via Tree Packings,
Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters.
SIAM Journal on Computing, 2024, Conference version in FOCS 2021.
[ arXiv ] [ ECCC ] [ journal ]Jabari Hastings, Amy Kanne, Ray Li, Mary Wootters.
ISIT, 2021.
[ arXiv ]Settling SETH vs. Approximate Sparse Directed Unweighted Diameter (up to (NU)NSETH),
STOC, 2021.
[ arXiv ]Bounds for list-decoding and list-recovery of random linear codes,
Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters.
IEEE Transactions on Information Theory, 2021, Conference version in RANDOM 2020.
[ arXiv ] [ journal ]Hat guessing numbers of degenerate graphs,
Electronic Journal of Combinatorics, 2020.
[ arXiv ] [ journal ]Coded trace reconstruction in a constant number of traces,
Joshua Brakensiek, Ray Li, Bruce Spang.
FOCS, 2020.
[ arXiv ]A tight analysis of greedy yields subexponential time approximation for uniform decision tree,
Ray Li, Percy Liang, Stephen Mussmann.
SODA, 2020.
[ arXiv ]On edge-ordered Ramsey numbers,
Random Structures and Algorithms, 2020.
[ arXiv ] [ journal ]Lower bounds for max-cut in H-free graphs via semidefinite programming,
Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan.
SIAM Journal on Discrete Mathematics, 2021, Conference version in LATIN 2020.
[ arXiv ] [ journal ]On Ramsey numbers of hedgehogs,
Combinatorics, Probability, and Computing, 2019.
[ arXiv ] [ journal ]Lifted multiplicity codes and the disjoint repair group property,
IEEE Transactions on Information Theory, 2021, Conference version in RANDOM 2019.
[ arXiv ] [ journal ]Improved list-decodability of random linear binary codes,
IEEE Transactions on Information Theory, 2021, Conference version in RANDOM 2018.
[ arXiv ] [ journal ]Coding against deletions in oblivious and online models,
IEEE Transactions on Information Theory, 2020, Conference version in SODA 2018.
[ arXiv ] [ journal ]Polynomial time decodable codes for the binary deletion channel,
IEEE Transactions on Information Theory, 2019, Conference version in RANDOM 2017.
[ arXiv ] [ journal ]Central limit theorems for gaps of Generalized Zeckendorf Decompositions,
Fibonacci Quarterly, 2019, Conference version in Proceedings of the 17th International Fibonacci Conference.
[ arXiv ] [ journal ]Efficiently decodable insertion/deletion codes for high-noise and high-rate regimes,
ISIT, 2016.
[ arXiv ] [ journal ]