Within a long-term distributed systems project we repeatedly stumbled across the well-known yet difficult question to either implement from scratch or comprehend and adapt existin...
The capacity regions are investigated for two relay broadcast channels (RBCs), where relay links are incorporated into two-user broadcast channels to support user cooperation. In t...
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
We study the complexity of manipulation for a family of election systems derived from Copeland voting via introducing a parameter that describes how ties in head-to-head contests...
Piotr Faliszewski, Edith Hemaspaandra, Henning Sch...
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...