Sledovat
Ray Li
Název
Citace
Citace
Rok
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
392016
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
272020
Coding against deletions in oblivious and online models
V Guruswami, R Li
IEEE Transactions on Information Theory 66 (4), 2352-2374, 2020
212020
Polynomial time decodable codes for the binary deletion channel
V Guruswami, R Li
IEEE Transactions on Information Theory 65 (4), 2171-2178, 2018
162018
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
142020
Improved list-decodability of random linear binary codes
R Li, M Wootters
arXiv preprint arXiv:1801.07839, 2018
112018
Central limit theorems for gaps of generalized Zeckendorf decompositions
R Li, SJ Miller
arXiv preprint arXiv:1606.08110, 2016
112016
Lifted multiplicity codes and the disjoint repair group property
R Li, M Wootters
arXiv preprint arXiv:1905.02270, 2019
102019
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
92021
On edge‐ordered Ramsey numbers
J Fox, R Li
Random Structures & Algorithms 57 (4), 1174-1204, 2020
92020
Hat guessing numbers of degenerate graphs
X He, R Li
arXiv preprint arXiv:2003.04990, 2020
92020
A Collection of central limit type results in generalized Zeckendorf decompositions
R Li, SJ Miller
the 17th International Fibonacci Conference, Fibonacci Quarterly 55, 105-114, 2017
82017
Improved List-Decodability of Reed--Solomon Codes via Tree Packings
Z Guo, R Li, C Shangguan, I Tamo, M Wootters
arXiv preprint arXiv:2011.04453, 2020
62020
Improved list-decodability of random linear binary codes
R Li, M Wootters
IEEE Transactions on Information Theory 67 (3), 1522-1536, 2020
52020
Efficiently decodable codes for the binary deletion channel
V Guruswami, R Li
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2017
52017
Hardness of approximate diameter: Now for undirected graphs
M Dalirrooyfard, R Li, VV Williams
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
42022
The zero-rate threshold for adversarial bit-deletions is less than 1/2
V Guruswami, X He, R Li
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
42022
Lifted multiplicity codes and the disjoint repair group property
R Li, M Wootters
IEEE Transactions on Information Theory 67 (2), 716-725, 2020
42020
Improved SETH-hardness of unweighted Diameter
R Li
42020
Wedge-lifted codes
J Hastings, A Kanne, R Li, M Wootters
2021 IEEE International Symposium on Information Theory (ISIT), 2990-2995, 2021
32021
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20