On the Complexity of Optimal K-Anonymity

Adam Meyerson, Ryan Williams. On the Complexity of Optimal K-Anonymity. In Alin Deutsch, editor, Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 14-16, 2004, Paris, France. pages 223-228, ACM, 2004. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.