‪Christopher Ye‬ - ‪Google Scholar‬

Crea il mio profilo

Citata da

	Tutte	Dal 2019
Citazioni	6	6
Indice H	1	1
i10-index	0	0

0

4

2

202320242 4

Coautori

Barna SahaHarry E. Gruber Endowed Chair Professor, University of California San DiegoEmail verificata su ucsd.edu
Monika HenzingerProfessor of Computer Science, Institute of Science and Technology Austria (ISTA)Email verificata su ist.ac.at
Martin P. SeyboldComputer Science, University of Vienna, AustriaEmail verificata su univie.ac.at

Christopher Ye

Christopher Ye

Student, UC San Diego

Email verificata su ucsd.edu - Home page

Algorithms and Complexity


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
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

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–4