暂无分享,去创建一个
[1] Noga Alon,et al. The space complexity of approximating the frequency moments , 1996, STOC '96.
[2] Joseph T. Chang,et al. Conditioning as disintegration , 1997 .
[3] Wei Hong,et al. Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks , 2022 .
[4] S. Muthukrishnan,et al. Data streams: algorithms and applications , 2005, SODA '03.
[5] Cynthia Dwork,et al. Calibrating Noise to Sensitivity in Private Data Analysis , 2006, TCC.
[6] Graham Cormode,et al. Algorithms for distributed functional monitoring , 2008, SODA '08.
[7] Moni Naor,et al. Sketching in adversarial environments , 2008, STOC.
[8] Toniann Pitassi,et al. The Limits of Two-Party Differential Privacy , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[9] 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.
[10] Tim Roughgarden,et al. Interactive privacy via the median mechanism , 2009, STOC '10.
[11] David P. Woodruff,et al. On the Power of Adaptivity in Sparse Recovery , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[12] Atri Rudra,et al. Recovering simple signals , 2012, 2012 Information Theory and Applications Workshop.
[13] Moni Naor,et al. The Privacy of the Analyst and the Power of the State , 2012, FOCS.
[14] David P. Woodruff,et al. Reusable low-error compressive sampling schemes through privacy , 2012, 2012 IEEE Statistical Signal Processing Workshop (SSP).
[15] Sudipto Guha,et al. Graph sketches: sparsification, spanners, and subgraphs , 2012, PODS.
[16] Sudipto Guha,et al. Analyzing graph structure via linear measurements , 2012, SODA.
[17] David P. Woodruff,et al. Lower Bounds for Adaptive Sparse Recovery , 2012, SODA.