Pages that link to "Item:Q2435706"
From MaRDI portal
The following pages link to The effect of homogeneity on the computational complexity of combinatorial data anonymization (Q2435706):
Displaying 5 items.
- \(k\)-attribute-anonymity is hard even for \(k=2\) (Q477690) (← links)
- Pattern-guided \(k\)-anonymity (Q1736590) (← links)
- Using patterns to form homogeneous teams (Q2346970) (← links)
- A refined complexity analysis of degree anonymization in graphs (Q2347809) (← links)
- Privacy in Elections: k-Anonymizing Preference Orders (Q2947888) (← links)