暂无分享,去创建一个
[1] Guy N. Rothblum,et al. Boosting and Differential Privacy , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[2] Guy N. Rothblum,et al. A Multiplicative Weights Mechanism for Privacy-Preserving Data Analysis , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[3] Salil P. Vadhan,et al. The Complexity of Differential Privacy , 2017, Tutorials on the Foundations of Cryptography.
[4] Elaine Shi,et al. Private and Continual Release of Statistics , 2010, TSEC.
[5] Samir Khuller,et al. Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs , 2010, RECOMB.
[6] Aaron Roth,et al. Privately releasing conjunctions and the statistical query barrier , 2010, STOC '11.
[7] Aristides Gionis,et al. Mining Dense Subgraphs with Similar Edges , 2020, ECML/PKDD.
[8] Divesh Srivastava,et al. Dense subgraph maintenance under streaming edge weight updates for real-time story identification , 2012, The VLDB Journal.
[9] Cynthia Dwork,et al. Calibrating Noise to Sensitivity in Private Data Analysis , 2006, TCC.
[10] David D. Jensen,et al. Accurate Estimation of the Degree Distribution of Private Networks , 2009, 2009 Ninth IEEE International Conference on Data Mining.
[11] Andrew V. Goldberg,et al. Finding a Maximum Density Subgraph , 1984 .
[12] Ravi Kumar,et al. Discovering Large Dense Subgraphs in Massive Graphs , 2005, VLDB.
[13] Johannes Gehrke,et al. Towards Privacy for Social Networks: A Zero-Knowledge Based Definition of Privacy , 2011, TCC.
[14] Ryan A. Rossi,et al. The Network Data Repository with Interactive Graph Analytics and Visualization , 2015, AAAI.
[15] Moni Naor,et al. Differential privacy under continual observation , 2010, STOC '10.
[16] Avrim Blum,et al. Differentially private data analysis of social networks via restricted sensitivity , 2012, ITCS '13.
[17] Kunal Talwar,et al. Mechanism Design via Differential Privacy , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[18] Sofya Raskhodnikova,et al. Analyzing Graphs with Node Differential Privacy , 2013, TCC.
[19] Tim Roughgarden,et al. Interactive privacy via the median mechanism , 2009, STOC '10.
[20] Richard Peng,et al. Flowless: Extracting Densest Subgraphs Without Flow Computations , 2019, WWW.
[21] Samir Khuller,et al. On Finding Dense Subgraphs , 2009, ICALP.
[22] Sofya Raskhodnikova,et al. Smooth sensitivity and sampling in private data analysis , 2007, STOC '07.
[23] Saurabh Sawlani,et al. Near-optimal fully dynamic densest subgraph , 2019, STOC.
[24] Aaron Roth,et al. The Algorithmic Foundations of Differential Privacy , 2014, Found. Trends Theor. Comput. Sci..
[25] Sofya Raskhodnikova,et al. Private analysis of graph structure , 2011, Proc. VLDB Endow..
[26] Moses Charikar,et al. Greedy approximation algorithms for finding dense components in a graph , 2000, APPROX.
[27] Aaron Roth,et al. Differentially private combinatorial optimization , 2009, SODA '10.
[28] Salil P. Vadhan,et al. Differential Privacy on Finite Computers , 2017, ITCS.
[29] Aaron Roth,et al. Iterative Constructions and Private Data Release , 2011, TCC.
[30] Moni Naor,et al. On the complexity of differentially private data release: efficient algorithms and hardness results , 2009, STOC '09.
[31] Ashwin Lall,et al. Dense Subgraphs on Dynamic Networks , 2012, DISC.