Huacheng Yu
Princeton CS · Assistant Professor
Research focus: data structures · streaming algorithms · communication complexity · graph algorithms
保护编号 3 的自动审核：申请人应展示 data structures 的理论强度，以及流式/半流式/突发 chi 的生成能力，以及 graph algorithms、communication complexity 或严格的算法下界/上界。
Who this advisor fits / 什么情况下适合你
- Applicants should show theory strength in data structures, streaming/sketching, graph algorithms, communication complexity, or rigorous algorithmic lower/upper bounds.
- 申请人应展示理论能力，在 data structures 方面具备强理论基础；在 chi 方面需具备流式/时序建模能力；在 graph algorithms 和 communication complexity 方面需具备严谨的算法下界与上界。
Public evidence as of 2026-06-10
These are decision-support signals compiled from public evidence (faculty pages, publications, lab sites) to help you ask better questions — not a ranking, rating, or allegation about this advisor. / 以上为基于公开信息整理的择校参考，帮助你提出更好的问题，并非排名、评分或对该导师的指控。
Ask a verified 学长学姐 / 同校 .edu 认证点评
The thing applicants say only 师兄师姐 can tell you — current & former students of this lab, verified by their school .edu. Open the full dossier to read or add a verified note.