Route shepherd: stability hints for the control plane. - Alexander J. T. Gurney; Xianglong Han; Yang Li 025; Boon Thau Loo (SIGCOMM, 2012)

Distributed Time-aware Provenance. - Wenchao Zhou; Suyog Mapara; Yiqing Ren; Yang Li 025; Andreas Haeberlen; Zachary G. Ives; Boon Thau Loo; Micah Sherr (Proc. VLDB Endow., 2012)

Towards dynamic pricing-based collaborative optimizations for green data centers. - Yang Li 025; David Chiu 001; Changbin Liu; Linh T. X. Phan; Tanveer Gill; Sanchit Aggarwal; Zhuoyao Zhang; Boon Thau Loo; David Maier 001; Bart McManus (ICDE Workshops, 2013)

Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches. - Sepehr Assadi; Sanjeev Khanna; Yang Li 025; Val Tannen (FSTTCS, 2015)

Tight Bounds for Linear Sketches of Approximate Matchings. - Sepehr Assadi; Sanjeev Khanna; Yang Li 025; Grigory Yaroslavtsev (CoRR, 2015)

Algorithms for Provisioning Queries and Analytics. - Sepehr Assadi; Sanjeev Khanna; Yang Li 025; Val Tannen (ICDT, 2016)

Rapid convergence versus policy expressiveness in interdomain routing. - Alexander J. T. Gurney; Sanjeev Khanna; Yang Li 025 (INFOCOM, 2016)

Network functions virtualization with soft real-time guarantees. - Yang Li 025; Linh Thi Xuan Phan; Boon Thau Loo (INFOCOM, 2016)

Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model. - Sepehr Assadi; Sanjeev Khanna; Yang Li 025; Grigory Yaroslavtsev (SODA, 2016)

The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm. - Sepehr Assadi; Sanjeev Khanna; Yang Li 025 (EC, 2017)

On Estimating Maximum Matching Size in Graph Streams. - Sepehr Assadi; Sanjeev Khanna; Yang Li 025 (SODA, 2017)

Fast Convergence in the Double Oral Auction. - Sepehr Assadi; Sanjeev Khanna; Yang Li 025; Rakesh Vohra (ACM Trans. Economics and Comput., 2017)

The Stochastic Matching Problem with (Very) Few Queries. - Sepehr Assadi; Sanjeev Khanna; Yang Li 025 (ACM Trans. Economics and Comput., 2019)

Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem. - Sepehr Assadi; Sanjeev Khanna; Yang Li 025 (SIAM J. Comput., 2021)

Generative Modeling of Dependencies for Features, Instances and Distributions. - Yang Li 025 (2022)