Christopher Ye

According to our database, Christopher Ye authored at least 15 papers between 2023 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Approximate Replicability in Learning.

Max Hopkins, Russell Impagliazzo, Christopher Ye

CoRR, October, 2025

Distribution Testing in the Presence of Arbitrarily Dominant Noise with Verification Queries.

Hadley Black, Christopher Ye

CoRR, September, 2025

From Generative to Episodic: Sample-Efficient Replicable Reinforcement Learning.

Max Hopkins, Sihan Liu, Christopher Ye, Yuichi Yoshida

CoRR, July, 2025

Replicable Distribution Testing.

Ilias Diakonikolas, Jingyi Gao, Daniel M. Kane, Sihan Liu, Christopher Ye

CoRR, July, 2025

Subquadratic Algorithms and Hardness for Attention with Any Temperature.

Shreya Gupta, Boyang Huang, Barna Saha, Yinzhan Xu, Christopher Ye

CoRR, May, 2025

Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence.

Jakob Nogler, Adam Polak, Barna Saha, Virginia Vassilevska Williams, Yinzhan Xu, Christopher Ye

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Fine-Grained Optimality of Partially Dynamic Shortest Paths and More.

Barna Saha, Virginia Vassilevska Williams, Yinzhan Xu, Christopher Ye

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

The Computational Complexity of Factored Graphs.

Shreya Gupta, Boyang Huang, Russell Impagliazzo, Stanley Woo, Christopher Ye

Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

2024

The I/O Complexity of Attention, or How Optimal is Flash Attention?

Barna Saha, Christopher Ye

CoRR, 2024

Faster Approximate All Pairs Shortest Paths.

Barna Saha, Christopher Ye

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Replicable Uniformity Testing.

Sihan Liu, Christopher Ye

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

On the Complexity of Algorithms with Predictions for Dynamic Graph Problems.

Monika Henzinger, Barna Saha, Martin P. Seybold, Christopher Ye

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

I/O Complexity of Attention, or How Optimal is FlashAttention?

Barna Saha, Christopher Ye

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Replicability in High Dimensional Statistics.

Max Hopkins, Russell Impagliazzo, Daniel M. Kane, Sihan Liu, Christopher Ye

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

On the Complexity of Algorithms with Predictions for Dynamic Graph Problems.

Monika Henzinger, Andrea Lincoln, Barna Saha, Martin P. Seybold, Christopher Ye

CoRR, 2023