‪Christopher Ye‬ - ‪Google Scholar‬

Get my own profile

Cited by

	All	Since 2019
Citations	6	6
h-index	1	1
i10-index	0	0

0

4

2

202320242 4

Co-authors

Barna SahaHarry E. Gruber Endowed Chair Professor, University of California San DiegoVerified email at ucsd.edu
Monika HenzingerProfessor of Computer Science, Institute of Science and Technology Austria (ISTA)Verified email at ist.ac.at
Martin P. SeyboldComputer Science, University of Vienna, AustriaVerified email at univie.ac.at

Christopher Ye

Christopher Ye

Student, UC San Diego

Verified email at ucsd.edu - Homepage

Algorithms and Complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	5	2023
Faster Approximate All Pairs Shortest Paths B Saha, C Ye Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024	1	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–4