Add to ORKGMost CONGEST lower bounds are proven by reduction from two-party communication complexity. In this tutorial/talk we will discuss some limitations of existing reductions, and ways in which they might potentially be overcome. In particular, we'll cover: - The two-party pointer-chasing lower bound of Nisan-Widgerson - A connection between the broadcast congested clique and number-on-forehead communication complexity - The basics of multi-party number-in - hand communication complexity.Non UBCUnreviewedAuthor affiliation: Tel-Aviv UniversityFacult
The congested clique model of distributed computing has been receiving attention as a model for dens...
We introduce the model of conservative one-way multiparty complexity and prove lower and upper bound...
We study the communication complexity of the SHIFT (equivalently, SUM-INDEX) function in a 3-party s...
AbstractWe derive a general technique for obtaining lower bounds on the multiparty communication com...
We show that the deterministic number-on-forehead communication complexity of set dis-jointness for ...
We consider the multiparty communication complexity of the pointer jumping function Jump_k"n. O...
We show that the deterministic number-on-forehead communication complexity of set dis-jointness for ...
. We introduce the model of conservative one-way multiparty complexity and prove lower and upper bou...
Consider the “Number in Hand” multiparty communication complexity model, where k players holding inp...
AbstractWe study the k-round two-party communication complexity of the pointer chasing problem for f...
Consider the Number in Hand multiparty communication complexity model, where k players P 1,...,P k...
We study the k-round two-party communication complexity of the pointer chasing problem for fixed k. ...
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the b...
This lecture covers the most important basic facts about deterministic and randomized communication ...
We introduce new models and new information theoretic measures for the study of communication comple...
The congested clique model of distributed computing has been receiving attention as a model for dens...
We introduce the model of conservative one-way multiparty complexity and prove lower and upper bound...
We study the communication complexity of the SHIFT (equivalently, SUM-INDEX) function in a 3-party s...
AbstractWe derive a general technique for obtaining lower bounds on the multiparty communication com...
We show that the deterministic number-on-forehead communication complexity of set dis-jointness for ...
We consider the multiparty communication complexity of the pointer jumping function Jump_k"n. O...
We show that the deterministic number-on-forehead communication complexity of set dis-jointness for ...
. We introduce the model of conservative one-way multiparty complexity and prove lower and upper bou...
Consider the “Number in Hand” multiparty communication complexity model, where k players holding inp...
AbstractWe study the k-round two-party communication complexity of the pointer chasing problem for f...
Consider the Number in Hand multiparty communication complexity model, where k players P 1,...,P k...
We study the k-round two-party communication complexity of the pointer chasing problem for fixed k. ...
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the b...
This lecture covers the most important basic facts about deterministic and randomized communication ...
We introduce new models and new information theoretic measures for the study of communication comple...
The congested clique model of distributed computing has been receiving attention as a model for dens...
We introduce the model of conservative one-way multiparty complexity and prove lower and upper bound...
We study the communication complexity of the SHIFT (equivalently, SUM-INDEX) function in a 3-party s...