Dec 2018 DistCache work to appear in FAST'19.
Sep 2018 I successfully defended my Ph.D. dissertation.
July 2018 ASAP work to appear in OSDI'18.
Jun 2018 Summer internship at SF bay area, let's meet up!
Apr 2018 Attend NSDI'18, Renton, WA. Thanks a lot USENIX for the travel grant!
Jun 2017 Summer internship at Seattle, let's meet up!
Jun 2017 Attend and present at DIMACS Workshop on Algorithms for Data Center Networks.
Aug 2016 Attend and present at SIGCOMM'16, Florianopolis, Brazil.
Jun 2016 Give a talk at NSF Algorithm in the Field Workshop for Software-defined Networking
May 2016 CS@JHU and UMD are hosting 2016 Capital Area Theory Day, please register to attend.
May 2016 UnivMon work to appear in SIGCOMM'16.
Apr 2016 Attend AT&T Research Academic Summit. Rethinking Network Flow Monitoring (Update: Best Poster Award)
Hi! I am currently a postdoc researcher at CMU and Harvard working with Prof. Vyas Sekar and Prof. Minlan Yu. I obtained my PhD degree in 2018 from Department of Computer Science at Johns Hopkins University, where I was advised by Prof. Vladimir Braverman.
My research interests include systems and algorithms in networked and distributed settings. In particular, I work on efficient algorithmic and systematic design for SDNs, Datacenters, Programmable Networks, and "big data" Systems.
[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]
Best Paper Award
[OSDI'18] ASAP: Fast, Approximate Pattern Mining at Scale
Anand Iyer*, Zaoxing Liu*(*Co-first author); Xin Jin, Shivaram Venkataraman, Vladimir Braverman, Ion Stoica
in USENIX OSDI 2018.
[Astronomy and Computing] 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.
[HotCloud'18] Towards Fast and Scalable Graph Pattern Mining
Anand Padmanabha Iyer*, Zaoxing Liu*(*Co-first author); Xin Jin, Shivaram Venkataraman, Vladimir Braverman, Ion Stoica
in USENIX HotCloud 2018
[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
[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
Selected as Plenary Talk ("Best of others") at STOC 2018.
[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
[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
in MFCS 2015
Large-scale caching and data processing systems.
Universal network monitoring systems.
Clustering for Massive Datasets and Applications (project webpage)
Efficient streaming algorithms for analyzing high dimensional data from cosmological simulation
EN600.463/663 Algorithms I. (Spring 2017, 2018), Johns Hopkins University
EN600.363/463 Introduction to Algorithms/Algorithm I. (Spring 2015), Johns Hopkins University
EN600.464/664 Randomized Algorithms. (Fall 2014), Johns Hopkins University
Email: zaoxing AT cmu.edu
Secure Email Welcome >> GPG key