Follow
Christopher Ye
Christopher Ye
Student, UC San Diego
Verified email at ucsd.edu - Homepage
Title
Cited by
Cited by
Year
On the complexity of algorithms with predictions for dynamic graph problems
M Henzinger, B Saha, MP Seybold, C Ye
arXiv preprint arXiv:2307.16771, 2023
72023
Faster Approximate All Pairs Shortest Paths
B Saha, C Ye
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
22024
Replicable Uniformity Testing
S Liu, C Ye
arXiv preprint arXiv:2410.10892, 2024
2024
The Computational Complexity of Factored Graphs
S Gupta, B Huang, R Impagliazzo, S Woo, C Ye
arXiv preprint arXiv:2407.19102, 2024
2024
Fine-Grained Optimality of Partially Dynamic Shortest Paths and More
B Saha, VV Williams, Y Xu, C Ye
arXiv preprint arXiv:2407.09651, 2024
2024
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
The system can't perform the operation now. Try again later.
Articles 1–8