Fixed-parameter tractability of anonymizing data by suppressing entries (Q849143): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-009-9253-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2797479689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for Generating Set Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial problem in database security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:20, 2 July 2024

scientific article
Language Label Description Also known as
English
Fixed-parameter tractability of anonymizing data by suppressing entries
scientific article

    Statements

    Fixed-parameter tractability of anonymizing data by suppressing entries (English)
    0 references
    0 references
    0 references
    0 references
    24 February 2010
    0 references
    0 references
    privacy
    0 references
    parameterized complexity
    0 references
    kernelization
    0 references
    0 references