"POkA: identifying pareto-optimal k-anonymous nodes in a domain hierarchy ..."

Rinku Dewri et al. (2009)

> Home

Details and statistics

DOI: 10.1145/1645953.1646085

access: closed

type: Conference or Workshop Paper

metadata version: 2020-02-11

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cikm/DewriRRW09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cikm/DewriRRW09
Rinku Dewri, Indrajit Ray, Indrakshi Ray, L. Darrell Whitley:
POkA: identifying pareto-optimal k-anonymous nodes in a domain hierarchy lattice. CIKM 2009: 1037-1046

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.