Sophie H. Yu

According to our database, Sophie H. Yu authored at least 10 papers between 2021 and 2026.

Collaborative distances:

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

2026

Detection of local geometry in random graphs: information-theoretic and computational limits.

Jinho Bok, Shuangping Li, Sophie H. Yu

CoRR, March, 2026

A uniformity principle for spatial matching.

Taha Ameen, Flore Sentenac, Sophie H. Yu

CoRR, January, 2026

Online Metric Matching: Beyond the Worst Case.

Mingwei Yang, Sophie H. Yu

Oper. Res., 2026

2025

Achieving constant regret for dynamic matching via state-independent policies.

Süleyman Kerimov, Mingwei Yang, Sophie H. Yu

CoRR, March, 2025

From Signaling to Interviews in Random Matching Markets.

Maxwell Allman, Itai Ashlagi, Amin Saberi, Sophie H. Yu

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

2024

Stochastic Online Metric Matching: Adversarial Is No Harder Than Stochastic.

Amin Saberi, Mingwei Yang, Sophie H. Yu

Proceedings of the Web and Internet Economics - 20th International Conference, 2024

2023

Matching in networks: fundamental limits and efficient algorithms.

Sophie H. Yu

PhD thesis, 2023

Random Graph Matching at Otter's Threshold via Counting Chandeliers.

Cheng Mao, Yihong Wu, Jiaming Xu, Sophie H. Yu

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Constant Regret Primal-Dual Policy for Multi-way Dynamic Matching.

Yehua Wei, Jiaming Xu, Sophie H. Yu

Proceedings of the Abstract Proceedings of the 2023 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2023

2021

Settling the Sharp Reconstruction Thresholds of Random Graph Matching.

Yihong Wu, Jiaming Xu, Sophie H. Yu

Proceedings of the IEEE International Symposium on Information Theory, 2021