Lingling Zhang

Orcid: 0000-0001-8810-4995

Affiliations:
  • Beijing Institute of Technology, School of Machinery and Vehicles, Beijing, China
  • Huazhong University of Science and Technology, School of Computer Science and Technology, Wuhan National Laboratory for Optoelectronics, Wuhan, China


According to our database1, Lingling Zhang authored at least 13 papers between 2018 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Efficiently estimating node influence through group sampling over large graphs.
World Wide Web (WWW), March, 2024

Influence Maximization in Hypergraphs by Stratified Sampling for Efficient Generation of Reverse Reachable Sets.
CoRR, 2024

2023
Efficiently Counting Triangles for Hypergraph Streams by Reservoir-Based Sampling.
IEEE Trans. Knowl. Data Eng., November, 2023

HyperISO: Efficiently Searching Subgraph Containment in Hypergraphs.
IEEE Trans. Knowl. Data Eng., August, 2023

Efficiently Sampling and Estimating Hypergraphs By Hybrid Random Walk.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

2022
Random walk on node cliques for high-quality samples to estimate large graphs with high accuracies and low costs.
Knowl. Inf. Syst., 2022

2020
DRaWS: A dual random-walk based sampling method to efficiently estimate distributions of degree and clique size over social networks.
Knowl. Based Syst., 2020

Reservoir-based sampling over large graph streams to estimate triangle counts and node degrees.
Future Gener. Comput. Syst., 2020

2019
Non-sequential striping encoder from replication to erasure coding for distributed storage system.
Frontiers Comput. Sci., 2019

2-Hopper: Accurately Estimate Individual and Social Attributes of Social Networks With Fewer Repeats via Random Walk.
IEEE Access, 2019

T-Sample: A Dual Reservoir-Based Sampling Method for Characterizing Large Graph Streams.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

2018
A communication-reduced and computation-balanced framework for fast graph computation.
Frontiers Comput. Sci., 2018

Host-based scheduling: Achieving near-optimal transport for datacenter networks.
Comput. Networks, 2018


  Loading...