- [1] . DEGENERATE TURAN DENSITIES OF SPARSE HYPERGRAPHS II: A SOLUTION TO THE BROWN-EROS-SOS PROBLEM FOR EVERY UNIFORMITY. SIAM JOURNAL ON DISCRETE MATHEMATICS, 37, 1920, 2023.
- [2] . List-decoding and List-recovery of Reed-Solomon Codes beyond the Johnson Radius for Every Rate. 《IEEE TRANSACTIONS ON INFORMATION THEORY》, 69, 2261-2268, 2022.
- [3] . Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract]. 2022-February, 708-719, 2022.
- [4] Guo, Zeyu. Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract]. 2022-February, 708-719, 2022.
- [5] 上官冲. NEW TURAN EXPONENTS FOR TWO EXTREMAL HYPERGRAPH PROBLEMS. SIAM JOURNAL ON DISCRETE MATHEMATICS, 34, 2338, 2020.
- [6] Ge, Gennian. Sparse hypergraphs: New bounds and constructions. 《JOURNAL OF COMBINATORIAL THEORY SERIES B》, 147, 96, 2021.
|