Author of the publication

Approximately Counting Butterflies in Large Bipartite Graph Streams.

, , , , , , , and . IEEE Trans. Knowl. Data Eng., 34 (12): 5621-5635 (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Efficiently Estimating Subgraph Statistics of Large Networks in the Dark., , , , , and . CoRR, (2013)Design of Efficient Sampling Methods on Hybrid Social-Affiliation Networks., , , , and . CoRR, (2014)A Peep on the Interplays between Online Video Websites and Online Social Networks, , , , and . CoRR, (2013)Unbiased Characterization of Node Pairs over Large Graphs., , , , and . ACM Trans. Knowl. Discov. Data, 9 (3): 22:1-22:27 (2015)I/O-efficient calculation of H-group closeness centrality over disk-resident graphs., , , , and . Inf. Sci., (2017)An Effective and Differentially Private Protocol for Secure Distributed Cardinality Estimation., , , , , , and . CoRR, (2023)Multi-Action Dialog Policy Learning from Logged User Feedback., , , , , , , and . AAAI, page 13976-13983. AAAI Press, (2023)Sampling node pairs over large graphs., , , , and . ICDE, page 781-792. IEEE Computer Society, (2013)LogLog Filter: Filtering Cold Items within a Large Range over High Speed Data Streams., , , , , and . ICDE, page 804-815. IEEE, (2021)Practical characterization of large networks using neighborhood information., , , , , and . Knowl. Inf. Syst., 58 (3): 701-728 (2019)