Name
Affiliation
Papers
ZAOXING LIU
Johns Hopkins Univ, Dept Comp Sci, Baltimore, MD 21218 USA
22
Collaborators
Citations 
PageRank 
66
104
9.79
Referers 
Referees 
References 
368
394
203
Search Limit
100394
Title
Citations
PageRank
Year
SketchLib: Enabling Efficient Sketch-based Monitoring on Programmable Switches00.342022
Enabling Efficient and General Subpopulation Analytics in Multidimensional Data Streams.00.342022
Enabling Efficient and General Subpopulation Analytics in Multidimensional Data Streams.00.342022
Precise error estimation for sketch-based flow measurement20.372021
SecDeep - Secure and Performant On-device Deep Learning Inference Framework for Mobile and IoT Devices.00.342021
Telemetry Retrieval Inaccuracy in Programmable Switches: Analysis and Recommendations10.362021
CocoSketch: high-performance sketch-based measurement over arbitrary partial key query20.372021
Jaqen: A High-Performance Switch-Native Approach for Detecting and Mitigating Volumetric DDoS Attacks with Programmable Switches00.342021
Sketchy With a Chance of Adoption: Can Sketch-Based Telemetry Be Ready for Prime Time?00.342021
Memory-Efficient Performance Monitoring on Programmable Switches with Lean Algorithms.10.362020
TEA: Enabling State-Intensive Network Functions on Programmable Switches50.412020
DISCOvering the heavy hitters with disaggregated sketches00.342020
Joltik: Enabling Energy-Efficient "Future-Proof" Analytics on Low-Power Wide-Area Networks00.342020
Joltik: Enabling Energy-Efficient "Future-Proof" Analytics on Low-Power Wide-Area Networks00.342020
Nitrosketch - robust and general sketch-based monitoring in software switches.100.472019
Attack Time Localization using Interval Queries.00.342019
Towards Fast and Scalable Graph Pattern Mining.00.342018
ASAP: Fast, Approximate Graph Pattern Mining at Scale.20.362018
One Sketch to Rule Them All: Rethinking Network Flow Monitoring with UnivMon.782.252016
Streaming Algorithms for Halo Finders10.342015
Enabling a RISC Approach for Software-Defined Monitoring using Universal Streaming20.432015
New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory00.342015