Privacy in Elections: k-Anonymizing Preference Orders

DOI10.1007/978-3-319-22177-9_23zbMath1436.68148OpenAlexW1120680786WikidataQ62039075 ScholiaQ62039075MaRDI QIDQ2947888

Nimrod Talmon

Publication date: 29 September 2015

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-22177-9_23

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Voting theory (91B12) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Unnamed Item
• Fundamentals of parameterized complexity
• On the complexity of crossings in permutations
• Clustering to minimize the maximum intercluster distance
• Pattern-guided \(k\)-anonymity
• The effect of homogeneity on the computational complexity of combinatorial data anonymization
• Parametrized complexity theory.
• Integer Programming with a Fixed Number of Variables
• The Algorithmic Foundations of Differential Privacy
• k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
• The Complexity of Degree Anonymization by Vertex Addition
• A Refined Complexity Analysis of Degree Anonymization in Graphs