default search action
Lingling Zhang 0006
Person information
- affiliation: Beijing Institute of Technology, School of Machinery and Vehicles, Beijing, China
- affiliation: Huazhong University of Science and Technology, School of Computer Science and Technology, Wuhan National Laboratory for Optoelectronics, Wuhan, China
Other persons with the same name
- Lingling Zhang — disambiguation page
- Lingling Zhang 0001
— University of Chinese Academy of Sciences, School of Management, Beijing, China (and 1 more)
- Lingling Zhang 0002
- Lingling Zhang 0003
- Lingling Zhang 0004
- Lingling Zhang 0005
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Lingling Zhang, Zhiping Shi, Zhiwei Zhang, Ye Yuan, Guoren Wang:
Efficiently estimating node influence through group sampling over large graphs. World Wide Web (WWW) 27(2): 18 (2024) - [i1]Lingling Zhang, Hong Jiang, Ye Yuan, Guoren Wang:
Influence Maximization in Hypergraphs by Stratified Sampling for Efficient Generation of Reverse Reachable Sets. CoRR abs/2406.01911 (2024) - 2023
- [j9]Lingling Zhang
HyperISO: Efficiently Searching Subgraph Containment in Hypergraphs. IEEE Trans. Knowl. Data Eng. 35(8): 8112-8125 (2023) - [j8]Lingling Zhang
Efficiently Counting Triangles for Hypergraph Streams by Reservoir-Based Sampling. IEEE Trans. Knowl. Data Eng. 35(11): 11328-11341 (2023) - [c2]Lingling Zhang, Zhiwei Zhang, Guoren Wang, Ye Yuan:
Efficiently Sampling and Estimating Hypergraphs By Hybrid Random Walk. ICDE 2023: 1273-1285 - 2022
- [j7]Lingling Zhang
Random walk on node cliques for high-quality samples to estimate large graphs with high accuracies and low costs. Knowl. Inf. Syst. 64(7): 1909-1935 (2022) - 2020
- [j6]Lingling Zhang, Hong Jiang, Fang Wang, Dan Feng, Yanwen Xie:
Reservoir-based sampling over large graph streams to estimate triangle counts and node degrees. Future Gener. Comput. Syst. 108: 244-255 (2020) - [j5]Lingling Zhang, Hong Jiang, Fang Wang, Dan Feng:
DRaWS: A dual random-walk based sampling method to efficiently estimate distributions of degree and clique size over social networks. Knowl. Based Syst. 198: 105891 (2020)
2010 – 2019
- 2019
- [j4]Lingling Zhang
2-Hopper: Accurately Estimate Individual and Social Attributes of Social Networks With Fewer Repeats via Random Walk. IEEE Access 7: 139827-139838 (2019) - [j3]Yanwen Xie, Dan Feng, Fang Wang, Lingling Zhang:
Non-sequential striping encoder from replication to erasure coding for distributed storage system. Frontiers Comput. Sci. 13(6): 1356-1358 (2019) - [c1]Lingling Zhang, Hong Jiang, Fang Wang, Dan Feng, Yanwen Xie:
T-Sample: A Dual Reservoir-Based Sampling Method for Characterizing Large Graph Streams. ICDE 2019: 1674-1677 - 2018
- [j2]Weibin Xie
Host-based scheduling: Achieving near-optimal transport for datacenter networks. Comput. Networks 143: 49-61 (2018) - [j1]Yongli Cheng, Fang Wang, Hong Jiang, Yu Hua, Dan Feng, Lingling Zhang, Jun Zhou:
A communication-reduced and computation-balanced framework for fast graph computation. Frontiers Comput. Sci. 12(5): 887-907 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-06-08 15:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: