↓ Skip to main content

Fundamentals of Computation Theory

Overview of attention for book
Cover of 'Fundamentals of Computation Theory'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 How to Guard the Guards Themselves
  3. Altmetric Badge
    Chapter 2 Alternating Weighted Automata
  4. Altmetric Badge
    Chapter 3 Maintaining Arrays of Contiguous Objects
  5. Altmetric Badge
    Chapter 4 The k -Anonymity Problem Is Hard
  6. Altmetric Badge
    Chapter 5 Independence Results for n -Ary Recursion Theorems
  7. Altmetric Badge
    Chapter 6 Depletable Channels: Dynamics and Behaviour
  8. Altmetric Badge
    Chapter 7 Noise-Resilient Group Testing: Limitations and Constructions
  9. Altmetric Badge
    Chapter 8 Martingales on Trees and the Empire Chromatic Number of Random Trees
  10. Altmetric Badge
    Chapter 9 Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
  11. Altmetric Badge
    Chapter 10 Combinatorial Queries and Updates on Partial Words
  12. Altmetric Badge
    Chapter 11 The Longest Haplotype Reconstruction Problem Revisited
  13. Altmetric Badge
    Chapter 12 Earliest Query Answering for Deterministic Nested Word Automata
  14. Altmetric Badge
    Chapter 13 Multiway In-Place Merging
  15. Altmetric Badge
    Chapter 14 On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs
  16. Altmetric Badge
    Chapter 15 On Random Betweenness Constraints
  17. Altmetric Badge
    Chapter 16 Directed Graphs of Entanglement Two
  18. Altmetric Badge
    Chapter 17 Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies
  19. Altmetric Badge
    Chapter 18 Computing Role Assignments of Chordal Graphs
  20. Altmetric Badge
    Chapter 19 Three-Valued Abstractions of Markov Chains: Completeness for a Sizeable Fragment of PCTL
  21. Altmetric Badge
    Chapter 20 Closure Operators for Order Structures
  22. Altmetric Badge
    Chapter 21 Correcting Sorted Sequences in a Single Hop Radio Network
  23. Altmetric Badge
    Chapter 22 A Local Distributed Algorithm to Approximate MST in Unit Disc Graphs
  24. Altmetric Badge
    Chapter 23 Small-Space Analogues of Valiant’s Classes
  25. Altmetric Badge
    Chapter 24 Small Weakly Universal Turing Machines
  26. Altmetric Badge
    Chapter 25 Open Maps Bisimulations for Higher Dimensional Automata Models
  27. Altmetric Badge
    Chapter 26 Decision Version of the Road Coloring Problem Is NP-Complete
  28. Altmetric Badge
    Chapter 27 NP-Completeness of st -Orientations for Plane Graphs
  29. Altmetric Badge
    Chapter 28 Equivalence of Deterministic Nested Word to Word Transducers
  30. Altmetric Badge
    Chapter 29 Reachability in K 3,3 -Free Graphs and K 5 -Free Graphs Is in Unambiguous Log-Space
  31. Altmetric Badge
    Chapter 30 Energy Complexity and Depth of Threshold Circuits
  32. Altmetric Badge
    Chapter 31 1-Local 17/12-Competitive Algorithm for Multicoloring Hexagonal Graphs
Attention for Chapter 4: The k -Anonymity Problem Is Hard
Altmetric Badge

Readers on

mendeley
9 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
The k -Anonymity Problem Is Hard
Chapter number 4
Book title
Fundamentals of Computation Theory
Published in
ADS, September 2009
DOI 10.1007/978-3-642-03409-1_4
Book ISBNs
978-3-64-203408-4, 978-3-64-203409-1
Authors

Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Bonizzoni, Paola, Della Vedova, Gianluca, Dondi, Riccardo

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 9 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Italy 1 11%
Germany 1 11%
Unknown 7 78%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 4 44%
Professor > Associate Professor 2 22%
Researcher 1 11%
Unknown 2 22%
Readers by discipline Count As %
Computer Science 7 78%
Biochemistry, Genetics and Molecular Biology 1 11%
Engineering 1 11%