Zaoxing (Alan) Liu


PhD in CS

News


  • Sep 2018     I successfully defended my Ph.D. dissertation.

  • July 2018     I will be joining CMU/Harvard as a postdoc researcher (with Vyas Sekar and Minlan Yu).

  • July 2018     ASAP work to appear in OSDI 2018.

  • 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)

About


Hi! I am currently a PhD student in Computer Science at Johns Hopkins University working with Prof. Vladimir Braverman.

My research interests include practical systems and algorithms for networking and distributed systems. In particular, I work on streaming and sublinear algorithms for ``big-data'' systems.

Publications


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.
[PDF]

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]

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
[PDF]

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]

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.
[PDF]

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]

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]

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
[PDF]

Projects


  • Faster big data processing systems.

  • Universal monitoring system based on programmable switches

  • Clustering for Massive Datasets and Applications (project webpage)

  • Efficient streaming algorithms for analyzing high dimensional data from cosmological simulation

Teaching Assistant


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)


Contact Me


Email: zaoxing AT jhu.edu


Secure Email Welcome >> GPG key