"Answering n2+o(1) Counting Queries with Differential Privacy is ..."

Jonathan R. Ullman (2016)

> Home

Details and statistics

DOI: 10.1137/130928121

access: closed

type: Journal Article

metadata version: 2020-10-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/Ullman16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/Ullman16
Jonathan R. Ullman:
Answering n^2+o(1) Counting Queries with Differential Privacy is Hard. SIAM J. Comput. 45(2): 473-496 (2016)

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.