Pages that link to "Item:Q358665"
From MaRDI portal
The following pages link to Parameterized complexity of \(k\)-anonymity: hardness and tractability (Q358665):
Displaying 10 items.
- The \(l\)-diversity problem: tractability and approximability (Q392037) (← links)
- \(k\)-attribute-anonymity is hard even for \(k=2\) (Q477690) (← links)
- Anonymizing binary and small tables is hard to approximate (Q543515) (← links)
- Fixed-parameter tractability of anonymizing data by suppressing entries (Q849143) (← links)
- Pattern-guided \(k\)-anonymity (Q1736590) (← links)
- Hardness of \(k\)-anonymous microaggregation (Q1983125) (← links)
- A refined complexity analysis of degree anonymization in graphs (Q2347809) (← links)
- The effect of homogeneity on the computational complexity of combinatorial data anonymization (Q2435706) (← links)
- Error Detection and Correction of Gene Trees (Q4992761) (← links)
- Database Theory - ICDT 2005 (Q5316598) (← links)