"Solving the Top-K problem for sequence counting using differential privacy."

Sergiu Costea, Nicolae Tapus (2015)

> Home

Details and statistics

DOI: 10.1109/ROEDUNET.2015.7311996

access: closed

type: Conference or Workshop Paper

metadata version: 2022-01-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/roedunet/CosteaT15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/roedunet/CosteaT15
Sergiu Costea, Nicolae Tapus:
Solving the Top-K problem for sequence counting using differential privacy. RoEduNet 2015: 208-213

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.