Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Sean Peisert

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Sachin Kadam

> Home > Persons > Sean Peisert

Publications

2023
[c46]
- view
  authority control:
- export record
  dblp key:
  - conf/smartnets/KadamSRPLS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/smartnets/KadamSRPLS23
Sachin Kadam, Anna Scaglione, Nikhil Ravi, Sean Peisert, Brent Lunghino, Aram Shumavon:
Optimum Noise Mechanism for Probabilistic Differentially Private Queries in Discrete Finite Sets. SmartNets 2023: 1-6
2022
[j30]
- view
  authority control:
- export record
  dblp key:
  - journals/tsg/RaviSKGPLLS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tsg/RaviSKGPLLS22
Nikhil Ravi, Anna Scaglione, Sachin Kadam, Reinhard Gentz, Sean Peisert, Brent Lunghino, Emmanuel Levijarvi, Aram Shumavon:
Differentially Private -Means Clustering Applied to Meter Data Analysis and Synthesis. IEEE Trans. Smart Grid 13(6): 4801-4814 (2022)
2021
[i13]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2111-11661
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2111-11661
Sachin Kadam, Anna Scaglione, Nikhil Ravi, Sean Peisert, Brent Lunghino, Aram Shumavon:
Optimum Noise Mechanism for Differentially Private Queries in Discrete Finite Sets. CoRR abs/2111.11661 (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.