12 citations · 24 across the 2 of their papers we have counts for
3 papers
cs.IT2023★ 12 cited
Broadcast Channel Coding: Algorithmic Aspects and Non-Signaling Assistance
Omar Fawzi, Paul Fermé
We address the problem of coding for classical broadcast channels, which entails maximizing the success probability that can be achieved by sending a fixed number of messages over…
cs.IT2022★ 12 cited
Multiple-Access Channel Coding with Non-Signaling Correlations
Omar Fawzi, Paul Fermé
We address the problem of coding for classical multiple-access channels (MACs) with the assistance of non-signaling correlations between parties. It is well-known that non-signalin…
cs.DS2020
Tight Approximation Guarantees for Concave Coverage Problems
Siddharth Barman, Omar Fawzi, Paul Fermé
In the maximum coverage problem, we are given subsets of a universe along with an integer and the objective is to find a subset of si…