暂无分享,去创建一个
[1] Kunal Talwar,et al. Mechanism Design via Differential Privacy , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[2] Satish Rao,et al. A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.
[3] Moni Naor,et al. Our Data, Ourselves: Privacy Via Distributed Noise Generation , 2006, EUROCRYPT.
[4] Tal Malkin,et al. How Should We Solve Search Problems Privately? , 2007, CRYPTO.
[5] Amos Beimel,et al. Private Approximation of Clustering and Vertex Cover , 2007, computational complexity.
[6] Cynthia Dwork,et al. Privacy, accuracy, and consistency too: a holistic solution to contingency table release , 2007, PODS.
[7] Joan Feigenbaum,et al. Secure multiparty computation of approximations , 2001, TALG.
[8] Tal Malkin,et al. How Should We Solve Search Problems Privately? , 2008, Journal of Cryptology.
[9] Cynthia Dwork,et al. Calibrating Noise to Sensitivity in Private Data Analysis , 2006, TCC.
[10] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[11] Sofya Raskhodnikova,et al. Smooth sensitivity and sampling in private data analysis , 2007, STOC '07.
[12] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956 .
[13] Cynthia Dwork,et al. Privacy-Preserving Datamining on Vertically Partitioned Databases , 2004, CRYPTO.
[14] Kamesh Munagala,et al. Local Search Heuristics for k-Median and Facility Location Problems , 2004, SIAM J. Comput..
[15] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[16] Ashwin Machanavajjhala,et al. Privacy: Theory meets Practice on the Map , 2008, 2008 IEEE 24th International Conference on Data Engineering.
[17] Robert Krauthgamer,et al. Private approximation of NP-hard functions , 2001, STOC '01.
[18] Cynthia Dwork,et al. Differential Privacy: A Survey of Results , 2008, TAMC.
[19] Adam D. Smith,et al. Efficient, Differentially Private Point Estimators , 2008, ArXiv.
[20] Moni Naor,et al. On the complexity of differentially private data release: efficient algorithms and hardness results , 2009, STOC '09.
[21] Haim Kaplan,et al. Private coresets , 2009, STOC '09.
[22] David P. Woodruff,et al. Polylogarithmic Private Approximations and Efficient Matching , 2006, TCC.
[23] Cynthia Dwork,et al. Differential Privacy , 2006, ICALP.
[24] Hoeteck Wee,et al. Toward Privacy in Public Databases , 2005, TCC.
[25] Piotr Indyk,et al. Algorithms for dynamic geometric problems over data streams , 2004, STOC '04.
[26] David R. Karger,et al. Global min-cuts in RNC, and other ramifications of a simple min-out algorithm , 1993, SODA '93.
[27] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..
[28] Aaron Roth,et al. A learning theory approach to noninteractive database privacy , 2011, JACM.
[29] Dorit S. Hochbaum,et al. Approximation Algorithms for the Set Covering and Vertex Cover Problems , 1982, SIAM J. Comput..
[30] Christos H. Papadimitriou,et al. On the Hardness of Being Truthful , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[31] Sofya Raskhodnikova,et al. What Can We Learn Privately? , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[32] Paz Carmi,et al. Private approximation of search problems , 2006, STOC '06.
[33] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..