关注
Paul Fermé
Paul Fermé
Phd student, Inria, LIP, ENS de Lyon
在 ens-lyon.fr 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
Tight approximation guarantees for concave coverage problems
S Barman, O Fawzi, P Fermé
arXiv preprint arXiv:2010.00970, 2020
182020
Multiple-access channel coding with non-signaling correlations
O Fawzi, P Fermé
IEEE Transactions on Information Theory, 2023
72023
Broadcast Channel Coding: Algorithmic Aspects and Non-Signaling Assistance
O Fawzi, P Fermé
IEEE Transactions on Information Theory, 2024
62024
Beating the sum-rate capacity of the binary adder channel with non-signaling correlations
O Fawzi, P Fermé
2022 IEEE International Symposium on Information Theory (ISIT), 2750-2755, 2022
62022
Approximation Algorithms for Channel Coding and Non-Signaling Correlations
P Fermé
ENS de Lyon, 2023
12023
Randomness extractors: Complexity and relaxations
P Fermé
Technical report, Department of Computing and Mathematical Sciences, Caltech, 2015
12015
Random Numbers from Bell inequalities: Eve’s Memory Matters
P Fermé
系统目前无法执行此操作，请稍后再试。
文章 1–7
共建清朗的网络空间,如遇有害信息,请举报。
本站数据皆整合自互联网公开资源索引,方便科研学术方面查询,并不存储相关数据资源;如对此有异议,请联系我们解决.
© 2023 学术资源搜索   @联系我们 | 申请短期会员 | 数据源提交