Pages that link to "Item:Q3587455"
From MaRDI portal
The following pages link to Resolving the Complexity of Some Data Privacy Problems (Q3587455):
Displaying 14 items.
- Parameterized complexity of \(k\)-anonymity: hardness and tractability (Q358665) (← links)
- The \(l\)-diversity problem: tractability and approximability (Q392037) (← links)
- Publishing anonymous survey rating data (Q408666) (← links)
- \(k\)-attribute-anonymity is hard even for \(k=2\) (Q477690) (← links)
- Constrained obfuscation of relational databases (Q508612) (← links)
- Clustering with lower-bounded sizes. A general graph-theoretic framework (Q722539) (← links)
- Data disclosure limitation as a decision problem (Q957719) (← links)
- Pattern-guided \(k\)-anonymity (Q1736590) (← links)
- Using patterns to form homogeneous teams (Q2346970) (← links)
- The effect of homogeneity on the computational complexity of combinatorial data anonymization (Q2435706) (← links)
- Parameterized Complexity of k-Anonymity: Hardness and Tractability (Q3000512) (← links)
- The Effect of Homogeneity on the Complexity of k-Anonymity (Q3088269) (← links)
- Addressing Complexity in a Privacy Expert System (Q3164161) (← links)
- Discovery Science (Q5464537) (← links)
