| 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 | 46 | 2016 |
| 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 | 41 | 2020 |
| 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 | 28 | 2024 |
| Coding against deletions in oblivious and online models V Guruswami, R Li IEEE Transactions on Information Theory 66 (4), 2352-2374, 2020 | 24 | 2020 |
| Polynomial time decodable codes for the binary deletion channel V Guruswami, R Li IEEE Transactions on Information Theory 65 (4), 2171-2178, 2018 | 23 | 2018 |
| Hardness of approximate diameter: Now for undirected graphs M Dalirrooyfard, R Li, V Vassilevska Williams Journal of the ACM, 2021 | 22 | 2021 |
| On edge‐ordered Ramsey numbers J Fox, R Li Random Structures & Algorithms 57 (4), 1174-1204, 2020 | 18 | 2020 |
| 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 | 17 | 2024 |
| 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 | 17 | 2022 |
| 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 | 17 | 2021 |
| 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 | 16 | 2020 |
| Hat guessing numbers of degenerate graphs X He, R Li arXiv preprint arXiv:2003.04990, 2020 | 16 | 2020 |
| Improved list-decodability of random linear binary codes R Li, M Wootters arXiv preprint arXiv:1801.07839, 2018 | 15 | 2018 |
| Central limit theorems for gaps of generalized Zeckendorf decompositions R Li, SJ Miller The Fibonacci Quarterly 57 (3), 213-230, 2019 | 14 | 2019 |
| 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 | 13 | 2024 |
| 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 | 12 | 2021 |
| Lifted multiplicity codes and the disjoint repair group property R Li, M Wootters arXiv preprint arXiv:1905.02270, 2019 | 11 | 2019 |
| A Collection of central limit type results in generalized Zeckendorf decompositions R Li, SJ Miller The Fibonacci Quarterly 55 (5), 105-114, 2017 | 9 | 2017 |
| 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 | 8 | 2021 |
| Improved list-decodability of random linear binary codes R Li, M Wootters IEEE Transactions on Information Theory 67 (3), 1522-1536, 2020 | 8 | 2020 |
Venkatesan GuruswamiUniversity of California, BerkeleyVerified email at berkeley.edu
