Author:
Du Wenliang,Eppstein David,Goodrich Michael T.,Lueker George S.
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Lecture Notes in Computer Science;G. Aggarwal,2005
2. Bayardo, R.J., Agrawal, R.: Data privacy through optimal k-anonymization. In: Proc. of 21st Int. Conf. on Data Engineering (ICDE), pp. 217–228. IEEE Computer Society Press, Los Alamitos (2005)
3. Lecture Notes in Computer Science;J.-W. Byun,2007
4. Coffman Jr., E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey. In: Approximation algorithms for NP-hard problems, pp. 46–93. PWS Publishing Co., Boston (1997)
5. Domingo-Ferrer, J., Torra, V.: A critique of k-anonymity and some of its enhancements. In: ARES 2008: Proceedings of the, Third International Conference on Availability, Reliability and Security, Washington, DC, USA, pp. 990–993. IEEE Computer Society Press, Los Alamitos (2008)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献