Differential Privacy from Locally Adjustable Graph Algorithms: k-Core Decomposition, Low Out-Degree Ordering, and Densest Subgraphs-Reference-Cited by-同舟云学术

Differential Privacy from Locally Adjustable Graph Algorithms: k-Core Decomposition, Low Out-Degree Ordering, and Densest Subgraphs

Published:2022-10 Issue: Volume: Page:
ISSN:
Container-title:2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
language:
Short-container-title:

Author:

Dhulipala Laxman¹,Liu Quanquan C.²,Raskhodnikova Sofya³,Shi Jessica⁴,Shun Julian¹,Yu Shangdi¹

Affiliation:

1. University of Maryland, College Park,Department of Computer Science,College Park,USA

2. Northwestern University,Department of Computer Science,Evanston,USA

3. Boston University,Department of Computer Science,Boston,USA

4. Massachusetts Institute of Technology,CSAIL,Cambridge,USA

Funder

Google

Publisher

IEEE

Link

Reference81 articles.

4. Differentially private densest subgraph detection;nguyen;Proceedings of the 38th International Conference on Machine Learning,2021

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

2. Butterfly Counting over Bipartite Graphs with Local Differential Privacy;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

4. Parallel Algorithms for Hierarchical Nucleus Decomposition;Proceedings of the ACM on Management of Data;2024-03-12

5. Node-Differentially Private Estimation of the Number of Connected Components;Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2023-06-18