Hi! I'm Alan (Zaoxing) Liu, currently a postdoc at Carnegie Mellon University working with Prof. Vyas Sekar (CMU) and Prof. Minlan Yu (Harvard). I obtained my Ph.D. in Computer Science from Johns Hopkins University, advised by Prof. Vladimir Braverman.
I'm broadly interested in systems and networking. I design, implement, evaluate systems and algorithmic tools for telemetry, in-network computing, data analytics, and network security.
I'm joining Boston University ECE as an Assistant Professor in Jan 2021. [Email] [CV]
Prospective Students: If you are interested in joining forces with me, feel free to drop me an email with your CV. May the force be with you!
05/2020 TEA work to appear in SIGCOMM'20. Congrats to the team. See you online!
10/2019 Lean algorithms to appear in APOCS'20 (held with SODA'20). See you in Salt Lake City!
10/2019 Interval-query work to appear in SIGMETRICS'20. Congrats to the team!
07/2019 Give an invited talk at USENIX ATC'19. See you in Seattle!
05/2019 NitroSketch work to appear in SIGCOMM'19. See you in Beijing!
12/2018 DistCache work to appear in FAST'19. (Update: Best Paper Award)
10/2018 Successfully defended my Ph.D. dissertation.
07/2018 Joining CMU/Harvard as a postdoctoral researcher (with Vyas Sekar and Minlan Yu).
07/2018 ASAP work to appear in OSDI'18.
06/2018 Summer internship at SF bay area, let's meet up!
04/2018 Attend NSDI'18, Renton, WA. Thanks a lot USENIX for the travel grant!
08/2016 Attend and present at SIGCOMM'16, Florianopolis, Brazil.
06/2016 Give an invited talk at NSF Algorithm in the Field Workshop for Software-defined Networking
05/2016 CS@JHU and UMD are hosting 2016 Capital Area Theory Day, please register to attend.
05/2016 UnivMon work to appear in SIGCOMM'16.
04/2016 Attend AT&T Research Academic Summit. Rethinking Network Flow Monitoring. (Update: Best Poster Award)
Enhancing the Privacy of Federated Learning with Sketching
Zaoxing Liu, Tian Li, Virginia Smith, Vyas Sekar
[arXiv]
[SIGCOMM'20] TEA: Enabling State-Intensive Network Functions on Programmable Switches
Daehyeok Kim, Zaoxing Liu, Yibo Zhu, Changhoon Kim, Jeongkeun Lee, Vyas Sekar, Srinivasan Seshan
to appear in ACM SIGCOMM 2020.
[APoCS'20] Memory-Efficient Performance Monitoring on Programmable Switches with Lean Algorithms
Zaoxing Liu, Samson Zhou, Ori Rottenstreich, Vladimir Braverman, Jennifer Rexford
in SIAM ACM APoCS 2020 (Co-held with SODA 2020).
[PDF]
[SIGMETRICS'20] I Know What You Did Last Summer: Network Monitoring using Interval Queries
Nikita Ivkin, Ran Ben Basat, Zaoxing Liu, Gil Einziger, Roy Friedman, Vladimir Braverman
in ACM SIGMETRICS 2020.
[PDF]
[SIGCOMM'19] NitroSketch: Robust and General Sketch-based Monitoring in Software Switches
Zaoxing Liu, Ran Ben-Basat, Gil Einziger, Yaron Kassner, Vladimir Braverman, Roy Friedman, Vyas Sekar
in ACM SIGCOMM 2019.
[PDF]
[Slides]
[Talk]
[FAST'19] DistCache: Provable Load Balancing for Large-Scale Storage Systems with Distributed Caching
Zaoxing Liu, Zhihao Bai, Zhenming Liu, Xiaozhou Li, Changhoon Kim, Vladimir Braverman, Xin Jin, Ion Stoica
in USENIX FAST 2019.
[PDF]
[Extended Version]
[Slides]
[Talk]
[Invited Talk]
Best Paper Award
[OSDI'18] ASAP: Fast, Approximate Pattern Mining at Scale
Anand Iyer*, Zaoxing Liu*, Xin Jin, Shivaram Venkataraman, Vladimir Braverman, Ion Stoica
in USENIX OSDI 2018.
(*Co-leading author)
[PDF][Blog:the morning paper]
[HotCloud'18] Towards Fast and Scalable Graph Pattern Mining
Anand Iyer*, Zaoxing Liu*, Xin Jin, Shivaram Venkataraman, Vladimir Braverman, Ion Stoica
in USENIX HotCloud 2018.
(*Co-leading author)
[PDF]
[SIGCOMM'16] One Sketch to Rule Them All: Rethinking Network Flow Monitoring with UnivMon
Zaoxing Liu, Antonis Manousis, Greg Vorsanger, Vyas Sekar, Vladimir Braverman
in ACM SIGCOMM 2016.
[PDF]
[Slides]
[Talk]
[Invited Talk]
Selected as Plenary Talk ("Best of Theory") at STOC 2018.
[HotNets'15] Enabling a "RISC" Approach for Software-Defined Monitoring using Universal Streaming
Zaoxing Liu, Greg Vorsanger, Vladimir Braverman, Vyas Sekar
in ACM HotNets 2015.
[PDF] [Slides]
Best Poster Award at AT&T Research Summit 2016.
[eScience'15] Streaming Algorithms for Halo Finders
Zaoxing Liu, Nikita Ivkin, Lin F. Yang, Mark Neyrinck, Gerard Lemson, Alexander S. Szalay, Vladimir Braverman, Tamas Budavari, Randal Burns, and Xin Wang
in IEEE eScience 2015.
[PDF]
[MFCS'15] New Bounds for the CLIQUE-GAP Problem using Graph Decomposition Theory
Vladimir Braverman, Zaoxing Liu*, Tejasvam Singh, N.V. Vinodchandran and Lin Yang (Alphabetical)
in MFCS 2015.
[PDF]
[Astro. & Comp.] Scalable Streaming Tools for Analyzing N-body Simulations: Finding Halos and Investigating Excursion Sets in One Pass
Nikita Ivkin, Zaoxing Liu, Lin F. Yang, Srinivas Suresh Kumara, Gerard Lemsona, Mark Neyrinckc, Alexander S. Szalay, Vladimir Bravermana, Tamas Budavari
in Astronomy and Computing 2018.
[PDF]
[Algorithmica] New Bounds for the CLIQUE-GAP Problem using Graph Decomposition Theory
Vladimir Braverman, Zaoxing Liu*, Tejasvam Singh, N.V. Vinodchandran and Lin Yang (Alphabetical)
in Algorithmica 2017.
[PDF]
EN600.463/663 Algorithms I. (Spring 2017, 2018)
EN600.463/663 Algorithms I. (Spring 2017, 2018)
EN600.363/463 Introduction to Algorithms/Algorithm I. (Spring 2015)
EN600.464/664 Randomized Algorithms. (Fall 2014)
Pending upload... [Slides]
Email: zaoxing AT cmu.edu >> GPG key
Address:
Office 2221
CyLab Security and Privacy Institute
Robert Mehrabian Collaborative Innovation Center (CIC)
4720 Forbes Avenue
Pittsburgh, PA 15213