Xifan Yu

According to our database, Xifan Yu authored at least 6 papers between 2023 and 2025.

Collaborative distances:

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

2025

Statistical Inference of a Ranked Community in a Directed Graph.

Dmitriy Kunisky, Daniel A. Spielman, Alexander S. Wein, Xifan Yu

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

2024

Inference of rankings planted in random tournaments.

Dmitriy Kunisky, Daniel A. Spielman, Xifan Yu

CoRR, 2024

Counting Stars is Constant-Degree Optimal For Detecting Any Planted Subgraph.

Xifan Yu, Ilias Zadik, Peiyuan Zhang

CoRR, 2024

Computational Hardness of Detecting Graph Lifts and Certifying Lift-Monotone Properties of Random Regular Graphs.

Dmitriy Kunisky, Xifan Yu

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

Counting Stars is Constant-Degree Optimal For Detecting Any Planted Subgraph: Extended Abstract.

Xifan Yu, Ilias Zadik, Peiyuan Zhang

Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023

A Degree 4 Sum-Of-Squares Lower Bound for the Clique Number of the Paley Graph.

Dmitriy Kunisky, Xifan Yu

Proceedings of the 38th Computational Complexity Conference, 2023