Related papers: Comparing Channel Restrictions of Communicating St…
A dominant cost for query evaluation in modern massively distributed systems is the number of communication rounds. For this reason, there is a growing interest in single-round multiway join algorithms where data is first reshuffled over…
The performance gain by allowing half-duplex source cooperation is studied for Gaussian interference channels. The source cooperation is {\em in-band}, meaning that each source can listen to the other source's transmission, but there is no…
Information theoretically secure multi-party computation (MPC) is a central primitive of modern cryptography. However, relatively little is known about the communication complexity of this primitive. In this work, we develop powerful…
Compositional methods are central to the development and verification of software systems. They allow to break down large systems into smaller components, while enabling reasoning about the behaviour of the composed system. For concurrent…
Session-types specify communication protocols for communicating processes, and session-typed languages are often specified using substructural operational semantics given by multiset rewriting systems. We give an observed communication…
We study cost-effective communication strategies that can be used to improve the performance of distributed learning systems in resource-constrained environments. For distributed learning in sequential decision making, we propose a new…
Information flow control type systems statically restrict the propagation of sensitive data to ensure end-to-end confidentiality. The property to be shown is noninterference, asserting that an attacker cannot infer any secrets from made…
We analyze different aspects of multiparty communication over quantum memoryless channels and generalize some of key results known from bipartite channels to that of multiparty scenario. In particular, we introduce multiparty versions of…
Bell inequality violating entangled states are the working horse for many potential quantum information processing applications, including secret sharing, cryptographic key distribution and communication complexity reduction in distributed…
In this paper, we derive information-theoretic performance limits for three classes of two-user state-dependent discrete memoryless broadcast channels, with noncausal side-information at the encoder. The first class of channels comprises a…
We formulate a model for intermittent communication that can capture bursty transmissions or a sporadically available channel, where in either case the receiver does not know a priori when the transmissions will occur. Focusing on the…
We introduce new methods and tools to study and characterise classical and quantum correlations emerging from prepare-and-measure experiments with informationally restricted communication. We consider the most general kind of…
In this work, we expand the cooperative multi-task semantic communication framework (CMT-SemCom) introduced in [1], which divides the semantic encoder on the transmitter side into a common unit (CU) and multiple specific units (SUs), to a…
Future wireless communications systems are expected to support multi-service operation, i.e. especially multi-rate as well as multi-level quality of service (QoS) requirements. This evolution is mainly driven by the success of the Internet…
Semi-quantum protocols that allow some of the users to remain classical are proposed for a large class of problems associated with secure communication and secure multiparty computation. Specifically, first time semi-quantum protocols are…
We present and explore a model of stateless and self-stabilizing distributed computation, inspired by real-world applications such as routing on today's Internet. Processors in our model do not have an internal state, but rather interact by…
We look into the task of differentiating between any two quantum channels and reconstructing them from the obtained measurement statistics with possibly limited information about the experimental set-up. We employ the communication matrix…
We consider fundamental limits for communicating over a compound channel when the state of the channel needs to be masked. Our model is closely related to an area of study known as covert communication that is a setting in which the…
In this paper, we investigate problems of communication over physically degraded, state-dependent broadcast channels (BCs) with cooperating decoders. Two different setups are considered and their capacity regions are characterized. First,…
A communicating system is $k$-synchronizable if all of the message sequence charts representing the executions can be divided into slices of $k$ sends followed by $k$ receptions. It was previously shown that, for a fixed given $k$, one…