Gibbs measures induced by random factor graphs play a prominent role in computer science, combinatorics and physics. A key problem is to calculate the typical value of the partiti...
We study internal compression of communication protocols to their internal entropy, which is the entropy of the transcript from the players’ perspective. We provide two internal...
Users of cloud computing services are offered rapid access to computing resources via the Internet. Cloud providers use different pricing options such as (i) time slot reservati...
Lin Chen, Nicole Megow, Roman Rischke, Leen Stougi...
The subcube partition model of computation is at least as powerful as decision trees but no separation between these models was known. We show that there exists a function whose d...
Robin Kothari, David Racicot-Desloges, Miklos Sant...
The problem of finding a maximum cardinality stable matching in the presence of ties and unacceptable partners, called MAX SMTI, is a well-studied NP-hard problem. The MAX SMTI i...
An instance of the 2-Lin(2) problem is a system of equations of the form “xi + xj = b (mod 2)”. Given such a system in which it’s possible to satisfy all but an fraction of ...