We show the existence of a non{constant gap between the communication complexity of a function and the logarithm of the rank of its input matrix. We consider the following problem: each of twoâ€¦ (More)

Relaxing the total orders of the preference lists of an instance of the stable marriage problem to arbitrary pose& we show after adjusting the notion of stability to the new problem that the set ofâ€¦ (More)

We consider the following game: Two players independently choose a chain in a partially ordered set. How many bits of information have to be communicated until at least one of the players knowsâ€¦ (More)