Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Nengkun Yu

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 Ala Shayeghi

> Home > Persons > Nengkun Yu

Publications

2021
[j15]
- view
  authority control:
- export record
  dblp key:
  - journals/tit/LeungNSTYY21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/LeungNSTYY21
Debbie W. Leung, Ashwin Nayak, Ala Shayeghi, Dave Touchette, Penghui Yao, Nengkun Yu:
Capacity Approaching Coding for Low Noise Interactive Quantum Communication Part I: Large Alphabets. IEEE Trans. Inf. Theory 67(8): 5443-5490 (2021)
2020
[i19]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2001-02818
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2001-02818
Debbie W. Leung, Ashwin Nayak, Ala Shayeghi, Dave Touchette, Penghui Yao, Nengkun Yu:
Capacity Approaching Coding for Low Noise Interactive Quantum Communication, Part I: Large Alphabets. CoRR abs/2001.02818 (2020)
2018
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/LeungNSTYY18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/LeungNSTYY18
Debbie W. Leung, Ashwin Nayak, Ala Shayeghi, Dave Touchette, Penghui Yao, Nengkun Yu:
Capacity approaching coding for low noise interactive quantum communication. STOC 2018: 339-352

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.