DBScholar

Back to papers

Efficient and Effective Biclique Counting with Local Differential Privacy

Summary: Edge-LDP (p,q)-biclique counting in bipartite graphs. Key novelty: moment-based Multi-round Common Neighbor estimator with variance reduction and pruning, yielding unbiased counts without explicit motif enumeration; substantially better utility/scalability than naive randomized-response. (summarized by gpt-5.4-mini on Apr 11 2026)

Paper ID
7659
Venue
SIGMOD
Year
2026
Pagerank
5.093636e-05
Overall Rank
10,446 | 28.34%
DOI
10.1145/3786642

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{he_sigmod26,
        title = {{Efficient and Effective Biclique Counting with Local Differential Privacy}},
        author = {He, Yizhang and Zhang, Wenjie and Wang, Kai and Lin, Xuemin and Zhang, Ying and Ni, Wei},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3786642},
        url = {https://dl.acm.org/doi/10.1145/3786642},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 15 of 15 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers