Sophie H. Yu

University of Pennsylvania — United States

Computer Science · Physical Sciences

7h-index161citations21works1.12yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Graph Theory and Algorithms(7), Optimization and Search Problems(5), Complex Network Analysis Techniques(4), Advanced Queuing Theory Analysis(4), Data Management and Algorithms(4)

Publications21 total

A uniformity principle for spatial matching
ArXiv.org·2026Open Access
A uniformity principle for spatial matching
arXiv (Cornell University)·2026Open Access
Stochastic Online Metric Matching: Adversarial Is No Harder Than Stochastic
Lecture notes in computer science·2026
Online Metric Matching: Beyond the Worst Case
Operations Research·2025
From Signaling to Interviews in Random Matching Markets
2025· 1 cited
Random Graph Matching at Otter’s Threshold via Counting Chandeliers
Operations Research·2025
Availability is all you need: achieving optimal regret with minimal information for dynamic matching
ArXiv.org·2025Open Access
From signaling to interviews in random matching markets
arXiv (Cornell University)·2025· 1 citedOpen Access
Online Resource Allocation without Re-solving: The Effectiveness of Primal-Dual Policies
SSRN Electronic Journal·2025· 1 citedOpen Access
Testing network correlation efficiently via counting trees
The Annals of Statistics·2024· 8 cited
Testing correlation of unlabeled random graphs
The Annals of Applied Probability·2023· 20 cited
Constant Regret Primal-Dual Policy for Multi-way Dynamic Matching
ACM SIGMETRICS Performance Evaluation Review·2023· 1 cited
Constant Regret Primal-Dual Policy for Multi-way Dynamic Matching
2023· 2 cited
Random Graph Matching at Otter’s Threshold via Counting Chandeliers
2023· 29 cited
Constant Regret Primal-Dual Policy for Multi-Way Dynamic Matching
SSRN Electronic Journal·2023· 4 citedOpen Access
Random graph matching at Otter's threshold via counting chandeliers
arXiv (Cornell University)·2022· 1 citedOpen Access
Settling the Sharp Reconstruction Thresholds of Random Graph Matching
IEEE Transactions on Information Theory·2022· 52 cited
Testing network correlation efficiently via counting trees
arXiv (Cornell University)·2021· 17 citedOpen Access
Settling the Sharp Reconstruction Thresholds of Random Graph Matching
2021· 9 cited
Settling the Sharp Reconstruction Thresholds of Random Graph Matching
arXiv (Cornell University)·2021· 5 citedOpen Access
page 1 of 2Next →

Frequent Co-authors

Jiaming Xu(14), Yihong Wu(10), Cheng Mao(4), Yehua Wei(3), Mingwei Yang(3), Maxwell Allman(2), Itai Ashlagi(2), Taha Ameen(2), Flore Sentenac(2), Siqi He(1), Yehua Dennis Wei(1), A. Saberi(1), Amin Saberi(1), Cheng Mao(1), Amin Saberi(1), Süleyman Kerimov(1), Pengyu Qian(1)