3 papers
cs.IT2025
Optimal Erasure Codes and Codes on Graphs
Yeyuan Chen, Mahdi Cheraghchi, Nikhil Shagrithaya
We construct constant-sized ensembles of linear error-correcting codes over any fixed alphabet that can correct a given fraction of adversarial erasures at rates approaching the Si…
cs.DS2024
The Gap Between Greedy Algorithm and Minimum Multiplicative Spanner
Yeyuan Chen
The greedy algorithm adapted from Kruskal's algorithm is an efficient and folklore way to produce a -spanner with girth at least . The greedy algorithm has shown to be `exi…
cs.LG2023
Calibrate and Boost Logical Expressiveness of GNN Over Multi-Relational and Temporal Graphs
Yeyuan Chen, Dingmin Wang
As a powerful framework for graph representation learning, Graph Neural Networks (GNNs) have garnered significant attention in recent years. However, to the best of our knowledge,…