Anonymizing Tables

This publication has 13 references indexed in Scilit:

• On the complexity of optimal K-anonymity
  Published by Association for Computing Machinery (ACM) ,2004
• Privacy-Preserving Datamining on Vertically Partitioned Databases
  Published by Springer Nature ,2004
• Secure Computation of the k th -Ranked Element
  Published by Springer Nature ,2004
• Efficient Private Matching and Set Intersection
  Published by Springer Nature ,2004
• Limiting privacy breaches in privacy preserving data mining
  Published by Association for Computing Machinery (ACM) ,2003
• Revealing information while preserving privacy
  Published by Association for Computing Machinery (ACM) ,2003
• Privacy Preserving Data Mining
  Published by Springer Nature ,2000
• Privacy-preserving data mining
  Published by Association for Computing Machinery (ACM) ,2000
• Maximum bounded H-matching is MAX SNP-complete
  Information Processing Letters, 1994
• General factors of graphs
  Journal of Combinatorial Theory, Series B, 1988