Nadim Ghaddar

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 Jiantao Jiao

> Home > Persons > Nadim Ghaddar

Publications

2024
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/jsait/ZhuWGJW24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsait/ZhuWGJW24
Banghua Zhu, Ziao Wang, Nadim Ghaddar, Jiantao Jiao, Lele Wang:
Noisy Computing of the OR and MAX Functions. IEEE J. Sel. Areas Inf. Theory 5: 302-313 (2024)
2023
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/isit/ZhuWGJW23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isit/ZhuWGJW23
Banghua Zhu, Ziao Wang, Nadim Ghaddar, Jiantao Jiao, Lele Wang:
On the Optimal Bounds for Noisy Computing. ISIT 2023: 1788-1793
[i4]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2306-11951
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2306-11951
Banghua Zhu, Ziao Wang, Nadim Ghaddar, Jiantao Jiao, Lele Wang:
On the Optimal Bounds for Noisy Computing. CoRR abs/2306.11951 (2023)
[i3]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2309-03986
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2309-03986
Banghua Zhu, Ziao Wang, Nadim Ghaddar, Jiantao Jiao, Lele Wang:
Noisy Computing of the OR and MAX Functions. CoRR abs/2309.03986 (2023)

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.