Yang Zhou

Orcid: 0000-0002-3082-7872

Affiliations:
  • Harvard University, Cambridge, MA, USA
  • Peking University, Department of Computer Science and Technology, Beijing, China (former)


According to our database1, Yang Zhou authored at least 18 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
DINT: Fast In-Kernel Distributed Transactions with eBPF.
Proceedings of the 21st USENIX Symposium on Networked Systems Design and Implementation, 2024

SmartNIC Security Isolation in the Cloud with S-NIC.
Proceedings of the Nineteenth European Conference on Computer Systems, 2024

2023
On the Evolutionary of Bloom Filter False Positives - An Information Theoretical Approach to Optimizing Bloom Filter Parameters.
IEEE Trans. Knowl. Data Eng., July, 2023

Electrode: Accelerating Distributed Protocols with eBPF.
Proceedings of the 20th USENIX Symposium on Networked Systems Design and Implementation, 2023

2022
Pyramid Family: Generic Frameworks for Accurate and Fast Flow Size Measurement.
IEEE/ACM Trans. Netw., 2022

Carbink: Fault-Tolerant Far Memory.
Proceedings of the 16th USENIX Symposium on Operating Systems Design and Implementation, 2022

Evolvable Network Telemetry at Facebook.
Proceedings of the 19th USENIX Symposium on Networked Systems Design and Implementation, 2022

2019
Fast and accurate stream processing by filtering the cold.
VLDB J., 2019

Adaptive Measurements Using One Elastic Sketch.
IEEE/ACM Trans. Netw., 2019

2018
Accelerating network measurement in software.
Comput. Commun. Rev., 2018

A Comparison of Performance and Accuracy of Measurement Algorithms in Software.
Proceedings of the Symposium on SDN Research, 2018

Cold Filter: A Meta-Framework for Faster and More Accurate Stream Processing.
Proceedings of the 2018 International Conference on Management of Data, 2018

Elastic sketch: adaptive and fast network-wide measurements.
Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication, 2018

Accurate per-flow measurement with bloom sketch.
Proceedings of the IEEE INFOCOM 2018, 2018

Single Hash: Use One Hash Function to Build Faster Hash Based Data Structures.
Proceedings of the 2018 IEEE International Conference on Big Data and Smart Computing, 2018

2017
Pyramid Sketch: a Sketch Framework for Frequency Estimation of Data Streams.
Proc. VLDB Endow., 2017

One Memory Access Sketch: A More Accurate and Faster Sketch for Per-Flow Measurement.
Proceedings of the 2017 IEEE Global Communications Conference, 2017

ABC: A practicable sketch framework for non-uniform multisets.
Proceedings of the 2017 IEEE International Conference on Big Data (IEEE BigData 2017), 2017


  Loading...