Host-based scheduling: Achieving near-optimal transport for datacenter networks. - Weibin Xie; Fang Wang 001; Dan Feng 001; Lingling Zhang 006; Tingwei Zhu; Qingyu Shi 001 (Comput. Networks, 2018)

A communication-reduced and computation-balanced framework for fast graph computation. - Yongli Cheng; Fang Wang 001; Hong Jiang 001; Yu Hua 001; Dan Feng 001; Lingling Zhang 006; Jun Zhou (Frontiers Comput. Sci., 2018)

T-Sample: A Dual Reservoir-Based Sampling Method for Characterizing Large Graph Streams. - Lingling Zhang 006; Hong Jiang 001; Fang Wang 001; Dan Feng 001; Yanwen Xie (ICDE, 2019)

2-Hopper: Accurately Estimate Individual and Social Attributes of Social Networks With Fewer Repeats via Random Walk. - Lingling Zhang 006; Hong Jiang 001; Fang Wang 001; Dan Feng 001 (IEEE Access, 2019)

Non-sequential striping encoder from replication to erasure coding for distributed storage system. - Yanwen Xie; Dan Feng 001; Fang Wang 001; Lingling Zhang 006 (Frontiers Comput. Sci., 2019)

Reservoir-based sampling over large graph streams to estimate triangle counts and node degrees. - Lingling Zhang 006; Hong Jiang 001; Fang Wang 001; Dan Feng 001; Yanwen Xie (Future Gener. Comput. Syst., 2020)

DRaWS: A dual random-walk based sampling method to efficiently estimate distributions of degree and clique size over social networks. - Lingling Zhang 006; Hong Jiang 001; Fang Wang 001; Dan Feng 001 (Knowl. Based Syst., 2020)

Random walk on node cliques for high-quality samples to estimate large graphs with high accuracies and low costs. - Lingling Zhang 006; Fang Wang 001; Hong Jiang 001; Dan Feng 001; Yanwen Xie; Zhiwei Zhang; Guoren Wang (Knowl. Inf. Syst., 2022)

Efficiently Sampling and Estimating Hypergraphs By Hybrid Random Walk. - Lingling Zhang 006; Zhiwei Zhang; Guoren Wang; Ye Yuan 001 (ICDE, 2023)

HyperISO: Efficiently Searching Subgraph Containment in Hypergraphs. - Lingling Zhang 006; Zhiwei Zhang; Guoren Wang; Ye Yuan 001; Shuai Zhao; Jianliang Xu (IEEE Trans. Knowl. Data Eng., 2023)

Efficiently Counting Triangles for Hypergraph Streams by Reservoir-Based Sampling. - Lingling Zhang 006; Zhiwei Zhang; Guoren Wang; Ye Yuan 001; Zhao Kang 001 (IEEE Trans. Knowl. Data Eng., 2023)

Influence Maximization in Hypergraphs by Stratified Sampling for Efficient Generation of Reverse Reachable Sets. - Lingling Zhang 006; Hong Jiang 001; Ye Yuan 001; Guoren Wang (CoRR, 2024)

Efficiently estimating node influence through group sampling over large graphs. - Lingling Zhang 006; Zhiping Shi 002; Zhiwei Zhang; Ye Yuan 001; Guoren Wang (World Wide Web (WWW), 2024)