z-logo
open-access-imgOpen Access
Scalable k-anonymous Microaggregation: Exploiting the Tradeoff between Computational Complexity and Information Loss
Author(s) -
Florian Thaeter,
Rüdiger Reischuk
Publication year - 2021
Language(s) - English
Resource type - Conference proceedings
DOI - 10.5220/0010536600870098
Subject(s) - computer science , scalability , computational complexity theory , distributed computing , computer network , database , algorithm

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom