"Answering n{2+o(1)} counting queries with differential privacy ..."

Jonathan R. Ullman (2013)

> Home

Details and statistics

DOI: 10.1145/2488608.2488653

access: closed

type: Conference or Workshop Paper

metadata version: 2020-10-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/Ullman13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/Ullman13
Jonathan R. Ullman:
Answering n_{2+o(1)} counting queries with differential privacy is hard. STOC 2013: 361-370

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.