default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRay Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Zeyu Guo
, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters:
Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings. SIAM J. Comput. 53(2): 389-430 (2024)- [c23]Omar Alrabiah, Venkatesan Guruswami, Ray Li:
AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets. SODA 2024: 1367-1378 - [c22]Omar Alrabiah, Venkatesan Guruswami, Ray Li:
Randomly Punctured Reed-Solomon Codes Achieve List-Decoding Capacity over Linear-Sized Fields. STOC 2024: 1458-1469 - [i30]Roni Con, Zeyu Guo, Ray Li, Zihan Zhang:
Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets. CoRR abs/2407.07299 (2024) - [i29]Samuel Dai, Ray Li:
Locality vs Quantum Codes. CoRR abs/2409.15203 (2024) - [i28]Ray Li, Tanishka Bagade, Kevin Martinez, Flora Yasmin, Grant Ayala, Michael Lam, Kevin Zhu:
A Debate-Driven Experiment on LLM Hallucinations and Accuracy. CoRR abs/2410.19485 (2024) - 2023
- [j10]Venkatesan Guruswami, Xiaoyu He, Ray Li:
The Zero-Rate Threshold for Adversarial Bit-Deletions is Less Than 1/2. IEEE Trans. Inf. Theory 69(4): 2218-2239 (2023) - [c21]Amir Abboud, Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams:
On Diameter Approximation in Directed Graphs. ESA 2023: 2:1-2:17 - [c20]Xiaoyu He, Ray Li:
Approximating Binary Longest Common Subsequence in Almost-Linear Time. STOC 2023: 1145-1158 - [i27]Omar Alrabiah, Venkatesan Guruswami, Ray Li:
Randomly punctured Reed-Solomon codes achieve list-decoding capacity over linear-sized fields. CoRR abs/2304.09445 (2023) - [i26]Nouédyn Baspin, Venkatesan Guruswami, Anirudh Krishna, Ray Li:
Improved rate-distance trade-offs for quantum codes with restricted connectivity. CoRR abs/2307.03283 (2023) - [i25]Amir Abboud, Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams:
On Diameter Approximation in Directed Graphs. CoRR abs/2307.07583 (2023) - [i24]Omar Alrabiah, Venkatesan Guruswami, Ray Li:
AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets. CoRR abs/2308.13424 (2023) - [i23]Omar Alrabiah, Venkatesan Guruswami, Ray Li:
Randomly punctured Reed-Solomon codes achieve list-decoding capacity over linear-sized fields. Electron. Colloquium Comput. Complex. TR23 (2023) - [i22]Omar Alrabiah, Venkatesan Guruswami, Ray Li:
AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [b1]Ray Li:
New combinatorial bounds for error correcting codes. Stanford University, USA, 2022 - [j9]Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters:
Bounds for List-Decoding and List-Recovery of Random Linear Codes. IEEE Trans. Inf. Theory 68(2): 923-939 (2022) - [c19]Sri Karlapati, Penny Karanasou, Mateusz Lajszczak, Syed Ammar Abbas, Alexis Moinet, Peter Makarov, Ray Li, Arent van Korlaar, Simon Slangen, Thomas Drugman:
CopyCat2: A Single Model for Multi-Speaker TTS and Many-to-Many Fine-Grained Prosody Transfer. INTERSPEECH 2022: 3363-3367 - [c18]Ray Li, Mary Wootters:
Improved batch code lower bounds. ISIT 2022: 1596-1599 - [c17]Francisco Pernice, Ray Li, Mary Wootters:
Efficient Capacity-Achieving Codes for General Repeat Channels. ISIT 2022: 3097-3102 - [i21]Francisco Pernice, Ray Li, Mary Wootters:
Efficient Near-Optimal Codes for General Repeat Channels. CoRR abs/2201.12746 (2022) - [i20]Sri Karlapati, Penny Karanasou, Mateusz Lajszczak, Ammar Abbas, Alexis Moinet, Peter Makarov, Ray Li, Arent van Korlaar, Simon Slangen, Thomas Drugman:
CopyCat2: A Single Model for Multi-Speaker TTS and Many-to-Many Fine-Grained Prosody Transfer. CoRR abs/2206.13443 (2022) - [i19]Xiaoyu He, Ray Li:
Approximating binary longest common subsequence in near-linear time. CoRR abs/2211.16660 (2022) - 2021
- [j8]Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan:
Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming. SIAM J. Discret. Math. 35(3): 1557-1568 (2021) - [j7]Ray Li, Mary Wootters:
Lifted Multiplicity Codes and the Disjoint Repair Group Property. IEEE Trans. Inf. Theory 67(2): 716-725 (2021) - [j6]Ray Li, Mary Wootters:
Improved List-Decodability of Random Linear Binary Codes. IEEE Trans. Inf. Theory 67(3): 1522-1536 (2021) - [c16]Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters:
Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract]. FOCS 2021: 708-719 - [c15]Venkatesan Guruswami, Xiaoyu He, Ray Li:
The zero-rate threshold for adversarial bit-deletions is less than 1/2. FOCS 2021: 727-738 - [c14]Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams:
Hardness of Approximate Diameter: Now for Undirected Graphs. FOCS 2021: 1021-1032 - [c13]Jabari Hastings, Amy Kanne, Ray Li, Mary Wootters:
Wedge-Lifted Codes. ISIT 2021: 2990-2995 - [c12]Ray Li:
Settling SETH vs. approximate sparse directed unweighted diameter (up to (NU)NSETH). STOC 2021: 1684-1696 - [i18]Ray Li, Mary Wootters:
Improved batch code lower bounds. CoRR abs/2106.02163 (2021) - [i17]Venkatesan Guruswami, Xiaoyu He, Ray Li:
The zero-rate threshold for adversarial bit-deletions is less than 1/2. CoRR abs/2106.05250 (2021) - [i16]Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams:
Hardness of Approximate Diameter: Now for Undirected Graphs. CoRR abs/2106.06026 (2021) - [i15]Venkatesan Guruswami, Xiaoyu He, Ray Li:
The zero-rate threshold for adversarial bit-deletions is less than 1/2. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j5]Xiaoyu He, Ray Li:
Hat Guessing Numbers of Degenerate Graphs. Electron. J. Comb. 27(3): 3 (2020) - [j4]Jacob Fox, Ray Li:
On Ramsey numbers of hedgehogs. Comb. Probab. Comput. 29(1): 101-112 (2020) - [j3]Jacob Fox, Ray Li:
On edge-ordered Ramsey numbers. Random Struct. Algorithms 57(4): 1174-1204 (2020) - [j2]Venkatesan Guruswami, Ray Li:
Coding Against Deletions in Oblivious and Online Models. IEEE Trans. Inf. Theory 66(4): 2352-2374 (2020) - [c11]Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters:
Bounds for List-Decoding and List-Recovery of Random Linear Codes. APPROX-RANDOM 2020: 9:1-9:21 - [c10]Joshua Brakensiek, Ray Li, Bruce Spang:
Coded trace reconstruction in a constant number of traces. FOCS 2020: 482-493 - [c9]Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan:
Lower Bounds for Max-Cut via Semidefinite Programming. LATIN 2020: 479-490 - [c8]Ray Li, Percy Liang, Stephen Mussmann:
A Tight Analysis of Greedy Yields Subexponential Time Approximation for Uniform Decision Tree. SODA 2020: 102-121 - [i14]Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters:
Bounds for list-decoding and list-recovery of random linear codes. CoRR abs/2004.13247 (2020) - [i13]Ray Li:
Improved SETH-hardness of unweighted Diameter. CoRR abs/2008.05106 (2020) - [i12]Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters:
Improved List-Decodability of Reed-Solomon Codes via Tree Packings. CoRR abs/2011.04453 (2020) - [i11]Jabari Hastings, Amy Kanne, Ray Li, Mary Wootters:
Wedge-Lifted Codes. CoRR abs/2011.12435 (2020) - [i10]Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters:
Improved List-Decodability of Reed-Solomon Codes via Tree Packings. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j1]Venkatesan Guruswami, Ray Li:
Polynomial Time Decodable Codes for the Binary Deletion Channel. IEEE Trans. Inf. Theory 65(4): 2171-2178 (2019) - [c7]Ray Li, Mary Wootters:
Lifted Multiplicity Codes and the Disjoint Repair Group Property. APPROX-RANDOM 2019: 38:1-38:18 - [c6]Serge Gaspers, Ray Li:
Enumeration of Preferred Extensions in Almost Oriented Digraphs. MFCS 2019: 74:1-74:15 - [i9]Jacob Fox, Ray Li:
On Ramsey numbers of hedgehogs. CoRR abs/1902.10221 (2019) - [i8]Ray Li, Mary Wootters:
Lifted Multiplicity Codes. CoRR abs/1905.02270 (2019) - [i7]Ray Li, Percy Liang, Stephen Mussmann:
A Tight Analysis of Greedy Yields Subexponential Time Approximation for Uniform Decision Tree. CoRR abs/1906.11385 (2019) - [i6]Serge Gaspers, Ray Li:
Enumeration of Preferred Extensions in Almost Oriented Digraphs. CoRR abs/1907.01006 (2019) - [i5]Joshua Brakensiek, Ray Li, Bruce Spang:
Coded trace reconstruction in a constant number of traces. CoRR abs/1908.03996 (2019) - 2018
- [c5]Ray Li, Mary Wootters:
Improved List-Decodability of Random Linear Binary Codes. APPROX-RANDOM 2018: 50:1-50:19 - [c4]Venkatesan Guruswami, Ray Li:
Coding against deletions in oblivious and online models. SODA 2018: 625-643 - [i4]Ray Li, Mary Wootters:
Random linear binary codes have smaller list sizes than uniformly random binary codes. CoRR abs/1801.07839 (2018) - 2017
- [c3]Venkatesan Guruswami, Ray Li:
Efficiently Decodable Codes for the Binary Deletion Channel. APPROX-RANDOM 2017: 47:1-47:13 - [i3]Venkatesan Guruswami, Ray Li:
Efficiently decodable codes for the binary deletion channel. CoRR abs/1705.01963 (2017) - 2016
- [c2]Venkatesan Guruswami, Ray Li:
Efficiently decodable insertion/deletion codes for high-noise and high-rate regimes. ISIT 2016: 620-624 - [i2]Venkatesan Guruswami, Ray Li:
Efficiently decodable insertion/deletion codes for high-noise and high-rate regimes. CoRR abs/1605.04611 (2016) - [i1]Venkatesan Guruswami, Ray Li:
Codes correcting deletions in oblivious and random models. CoRR abs/1612.06335 (2016) - 2012
- [c1]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:
Critical gate module process enabling the implementation of a 50A/600V AlGaN/GaN MOS-HEMT. ESSDERC 2012: 310-313
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
