| Tight approximation guarantees for concave coverage problems S Barman, O Fawzi, P Fermé arXiv preprint arXiv:2010.00970, 2020 | 15 | 2020 |
| 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 | 5 | 2022 |
| Multiple-access channel coding with non-signaling correlations O Fawzi, P Fermé IEEE Transactions on Information Theory, 2023 | 2 | 2023 |
| Approximation Algorithms for Channel Coding and Non-Signaling Correlations P Fermé ENS de Lyon, 2023 | 1 | 2023 |
| Randomness extractors: Complexity and relaxations P Fermé Technical report, Department of Computing and Mathematical Sciences, Caltech, 2015 | 1 | 2015 |
| Broadcast Channel Coding: Algorithmic Aspects and Non-Signaling Assistance O Fawzi, P Fermé arXiv preprint arXiv:2310.05515, 2023 | | 2023 |
| Random Numbers from Bell inequalities: Eve’s Memory Matters P Fermé | | |
Omar FawziInria, ENS LyonVerified email at ens-lyon.fr
