Yeyuan Chen
Orcid: 0009-0006-5696-4628
According to our database1,
Yeyuan Chen authored at least 12 papers
between 2023 and 2026.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2026
From Random to Explicit via Subspace Designs with Applications to Local Properties and Matroids.
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026
2025
CoRR, April, 2025
Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025
2024
Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bound.
CoRR, 2024
2023
Range Avoidance, Remote Point, and Hard Partial Truth Tables via Satisfying-Pairs Algorithms.
Electron. Colloquium Comput. Complex., 2023
Range Avoidance, Remote Point, and Hard Partial Truth Table via Satisfying-Pairs Algorithms.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Calibrate and Boost Logical Expressiveness of GNN Over Multi-Relational and Temporal Graphs.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Efficient Embeddings of Logical Variables for Query Answering over Incomplete Knowledge Graphs.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023