Yeyuan Chen

From MaRDI portal
(Redirected from Yeyuan Chen)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Unique-neighbor expanders with better expansion for polynomial-sized sets2026-07-03Paper
Bounds and Limitations on Codes Achieving List Recovery Capacity
(available as arXiv preprint)
2026-01-01Paper
Optimal Sparsifiers for Minkowski Sums and Sums of Seminorms
(available as arXiv preprint)
2026-01-01Paper
Optimal Erasure Codes and Codes on Graphs
(available as arXiv preprint)
2025-01-01Paper
Combinatorial Bounds for List Recovery via Discrete Brascamp--Lieb Inequalities
(available as arXiv preprint)
2025-01-01Paper
From Random to Explicit via Subspace Designs With Applications to Local Properties and Matroids
(available as arXiv preprint)
2025-01-01Paper
Range avoidance, remote point, and hard partial truth table via satisfying-pairs algorithms2024-05-08Paper
Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds
(available as arXiv preprint)
2024-01-01Paper
Unique-neighbor Expanders with Better Expansion for Polynomial-sized Sets
(available as arXiv preprint)
2024-01-01Paper
The Gap Between Greedy Algorithm and Minimum Multiplicative Spanner
(available as arXiv preprint)
2024-01-01Paper


Research outcomes over time


This page was built for person: Yeyuan Chen