Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Lower and Upper Bounds on the Randomness Complexity of Private ..."

Eyal Kushilevitz et al. (2021)

> Home

Details and statistics

DOI: 10.1137/20M1314197

access: closed

type: Journal Article

metadata version: 2022-12-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamdm/KushilevitzOPRT21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/KushilevitzOPRT21
Eyal Kushilevitz, Rafail Ostrovsky, Emmanuel Prouff, Adi Rosén, Adrian Thillard, Damien Vergnaud:
Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND. SIAM J. Discret. Math. 35(1): 465-484 (2021)

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.