关注
Christopher Ye
Christopher Ye
Student, UC San Diego
在 ucsd.edu 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
On the Complexity of Algorithms with Predictions for Dynamic Graph Problems
M Henzinger, A Lincoln, B Saha, MP Seybold, C Ye
arXiv preprint arXiv:2307.16771, 2023
62023
Faster Approximate All Pairs Shortest Paths
B Saha, C Ye
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
22024
Replicability in High Dimensional Statistics
M Hopkins, R Impagliazzo, D Kane, S Liu, C Ye
arXiv preprint arXiv:2406.02628, 2024
2024
The I/O Complexity of Attention, or How Optimal is Flash Attention?
B Saha, C Ye
arXiv preprint arXiv:2402.07443, 2024
2024
A Direct Sum Theorem for Deterministic Compression under Uncertain Priors
C Ye
2021
系统目前无法执行此操作,请稍后再试。
文章 1–5