The following pages link to Ray Li (Q2081647):
Displaying 28 items.
- Lower bounds for max-cut via semidefinite programming (Q2081648) (← links)
- Hat guessing numbers of degenerate graphs (Q2200434) (← links)
- On edge‐ordered Ramsey numbers (Q3386532) (← links)
- (Q4556764) (← links)
- Coding against deletions in oblivious and online models (Q4607922) (← links)
- Lifted Multiplicity Codes and the Disjoint Repair Group Property (Q4963923) (← links)
- Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming (Q5001844) (← links)
- (Q5002653) (← links)
- Improved List-Decodability of Random Linear Binary Codes (Q5003673) (← links)
- (Q5009547) (← links)
- Bounds for List-Decoding and List-Recovery of Random Linear Codes (Q5030334) (← links)
- (Q5092437) (← links)
- Coding Against Deletions in Oblivious and Online Models (Q5123861) (← links)
- A Tight Analysis of Greedy Yields Subexponential Time Approximation for Uniform Decision Tree (Q5146768) (← links)
- On Ramsey numbers of hedgehogs (Q5222572) (← links)
- Polynomial Time Decodable Codes for the Binary Deletion Channel (Q5223925) (← links)
- Central Limit Theorems for Gaps of Generalized Zeckendorf Decompositions (Q5230671) (← links)
- Lifted Multiplicity Codes and the Disjoint Repair Group Property (Q5875494) (← links)
- (Q6084352) (← links)
- Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings (Q6131199) (← links)
- The Zero-Rate Threshold for Adversarial Bit-Deletions is Less Than 1/2 (Q6153664) (← links)
- Improved list-decodability of random linear binary codes (Q6296851) (← links)
- Enumeration of Preferred Extensions in Almost Oriented Digraphs (Q6321373) (← links)
- Randomly punctured Reed--Solomon codes achieve list-decoding capacity over linear-sized fields (Q6509710) (← links)
- AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets (Q6512650) (← links)
- AG codes have no list-decoding friends: approaching the generalized Singleton bound requires exponential alphabets (Q6645410) (← links)
- On diameter approximation in directed graphs (Q6656937) (← links)
- Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets (Q6735923) (← links)
