Seguir
Ray Li
Título
Citado por
Citado por
Año
Efficiently decodable insertion/deletion codes for high-noise and high-rate regimes
V Guruswami, R Li
2016 IEEE International Symposium on Information Theory (ISIT), 620-624, 2016
462016
Coded trace reconstruction in a constant number of traces
J Brakensiek, R Li, B Spang
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
412020
Randomly punctured Reed–Solomon codes achieve list-decoding capacity over linear-sized fields
O Alrabiah, V Guruswami, R Li
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1458-1469, 2024
282024
Coding against deletions in oblivious and online models
V Guruswami, R Li
IEEE Transactions on Information Theory 66 (4), 2352-2374, 2020
242020
Polynomial time decodable codes for the binary deletion channel
V Guruswami, R Li
IEEE Transactions on Information Theory 65 (4), 2171-2178, 2018
232018
Hardness of approximate diameter: Now for undirected graphs
M Dalirrooyfard, R Li, V Vassilevska Williams
Journal of the ACM, 2021
222021
On edge‐ordered Ramsey numbers
J Fox, R Li
Random Structures & Algorithms 57 (4), 1174-1204, 2020
182020
Improved list-decodability and list-recoverability of Reed–Solomon codes via tree packings
Z Guo, R Li, C Shangguan, I Tamo, M Wootters
SIAM Journal on Computing 53 (2), 389-430, 2024
172024
The zero-rate threshold for adversarial bit-deletions is less than 1/2
V Guruswami, X He, R Li
IEEE Transactions on Information Theory 69 (4), 2218-2239, 2022
172022
Settling SETH vs. approximate sparse directed unweighted diameter (up to (NU) NSETH)
R Li
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
172021
Bounds for list-decoding and list-recovery of random linear codes
V Guruswami, R Li, J Mosheiff, N Resch, S Silas, M Wootters
arXiv preprint arXiv:2004.13247, 2020
162020
Hat guessing numbers of degenerate graphs
X He, R Li
arXiv preprint arXiv:2003.04990, 2020
162020
Improved list-decodability of random linear binary codes
R Li, M Wootters
arXiv preprint arXiv:1801.07839, 2018
152018
Central limit theorems for gaps of generalized Zeckendorf decompositions
R Li, SJ Miller
The Fibonacci Quarterly 57 (3), 213-230, 2019
142019
Improved rate-distance trade-offs for quantum codes with restricted connectivity
N Baspin, V Guruswami, A Krishna, R Li
Quantum Science and Technology 10 (1), 015021, 2024
132024
Bounds for list-decoding and list-recovery of random linear codes
V Guruswami, R Li, J Mosheiff, N Resch, S Silas, M Wootters
IEEE Transactions on Information Theory 68 (2), 923-939, 2021
122021
Lifted multiplicity codes and the disjoint repair group property
R Li, M Wootters
arXiv preprint arXiv:1905.02270, 2019
112019
A Collection of central limit type results in generalized Zeckendorf decompositions
R Li, SJ Miller
The Fibonacci Quarterly 55 (5), 105-114, 2017
92017
Lower Bounds for Max-Cut in -Free Graphs via Semidefinite Programming
C Carlson, A Kolla, R Li, N Mani, B Sudakov, L Trevisan
SIAM Journal on Discrete Mathematics 35 (3), 1557-1568, 2021
82021
Improved list-decodability of random linear binary codes
R Li, M Wootters
IEEE Transactions on Information Theory 67 (3), 1522-1536, 2020
82020
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20