Anonymizing tables
From MaRDI portal
Recommendations
Cited in
(21)- Pattern-guided k-anonymity
- \(k\)-anonymous microdata release via post randomisation method
- A practical approximation algorithm for optimal \(k\)-anonymity
- Generalized bucketization scheme for flexible privacy settings
- Reidentification and \(k\)-anonymity: a model for disclosure risk in graphs
- The effect of homogeneity on the computational complexity of combinatorial data anonymization
- Achieving anonymity via clustering
- Parameterized complexity of \(k\)-anonymity: hardness and tractability
- The effect of homogeneity on the complexity of \(k\)-anonymity
- On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem
- The k-Anonymity Problem Is Hard
- Weak k-Anonymity: A Low-Distortion Model for Protecting Privacy
- Parameterized complexity of \(k\)-anonymity: hardness and tractability
- The l-diversity problem: tractability and approximability
- Finding all maximally-matchable edges in a bipartite graph
- \(k\)-attribute-anonymity is hard even for \(k=2\)
- On distributed \(k\)-anonymization
- Pattern-guided \(k\)-anonymity
- Anonymizing binary and small tables is hard to approximate
- Privacy problems with anonymized transaction databases
- Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries
This page was built for publication: Anonymizing tables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5316598)