Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Answering n^{2+o(1)} Counting Queries with Differential Privacy is Hard"

Jonathan R. Ullman (2012)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2020-10-27

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-1207-6945
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1207-6945
Jonathan R. Ullman:
Answering n^{2+o(1)} Counting Queries with Differential Privacy is Hard. CoRR abs/1207.6945 (2012)

a service of

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.