Zhengyu Liao

Orcid: 0009-0004-4748-0782

According to our database1, Zhengyu Liao authored at least 7 papers between 2019 and 2024.

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

Timeline

2019
2020
2021
2022
2023
2024
0
1
2
3
4
2
1
1
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
DBTable: Leveraging Discriminative Bitsets for High-Performance Packet Classification.
IEEE/ACM Trans. Netw., December, 2024

PT-Tree: A Cascading Prefix Tuple Tree for Packet Classification in Dynamic Scenarios.
IEEE/ACM Trans. Netw., February, 2024

DI-Tree: A Dual-ended Interval Tree for Efficient Event Matching in Content-based Pub/Sub Systems.
Proceedings of the 30th IEEE International Conference on Parallel and Distributed Systems, 2024

2023
An Information Bottleneck Approach to Secrecy-Preserving Gaussian Mixture Classification.
CoRR, 2023

BOP: A Bitset-based Optimization Paradigm for Content-based Event Matching Algorithms (S).
Proceedings of the 35th International Conference on Software Engineering and Knowledge Engineering, 2023

2021
BMTP: Combining Backward Matching with Tree-Based Pruning for Large-Scale Content-Based Pub/Sub Systems.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2021

2019
PhSIH: A Lightweight Parallelization of Event Matching in Content-based Pub/Sub Systems.
Proceedings of the 48th International Conference on Parallel Processing, 2019


  Loading...