Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Sébastien Gambs

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 Sofiane Azogagh

> Home > Persons > Sébastien Gambs

Publications

2023
[i29]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2309-10890
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2309-10890
Sofiane Azogagh, Zelma Aubin Birba, Sébastien Gambs, Marc-Olivier Killijian:
Crypto'Graph: Leveraging Privacy-Preserving Distributed Link Prediction for Robust Graph Learning. CoRR abs/2309.10890 (2023)
2022
[c52]
- view
  authority control:
- export record
  dblp key:
  - conf/ccs/AzogaghDGK22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ccs/AzogaghDGK22
Sofiane Azogagh, Victor Delfour, Sébastien Gambs, Marc-Olivier Killijian:
PROBONITE: PRivate One-Branch-Only Non-Interactive decision Tree Evaluation. WAHC@CCS 2022: 23-33
[i21]
- view
  - electronic edition @ iacr.org (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/iacr/AzogaghDGK22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iacr/AzogaghDGK22
Sofiane Azogagh, Victor Delfour, Sébastien Gambs, Marc-Olivier Killijian:
PROBONITE : PRivate One-Branch-Only Non-Interactive decision Tree Evaluation. IACR Cryptol. ePrint Arch. 2022: 936 (2022)

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.