Elements of information theory
Elements of information theory
Rounds in communication complexity revisited
SIAM Journal on Computing
Communication complexity and quasi randomness
SIAM Journal on Discrete Mathematics
Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
Journal of Computer and System Sciences
Boolean Circuits, Tensor Ranks, and Communication Complexity
SIAM Journal on Computing
Communication complexity and parallel computing
Communication complexity and parallel computing
Communication complexity
Some bounds on multiparty communication complexity of pointer jumping
Computational Complexity
The BNS-chung criterion for multi-party communication complexity
Computational Complexity
The communication complexity of pointer chasing
Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Information Theory Methods in Communication Complexity
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Communication Complexity of Simultaneous Messages
SIAM Journal on Computing
An information statistics approach to data stream and communication complexity
Journal of Computer and System Sciences - Special issue on FOCS 2002
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Optimal Collapsing Protocol for Multiparty Pointer Jumping
Theory of Computing Systems
| Hi-index | 0.00 |
We prove a lower bound on the communication complexity of pointer jumping for multiparty one-way protocols in the number on the forehead model that satisfy a certain information theoretical restriction: We consider protocols for which the ith player may only reveal information about the first i+1 inputs. To this end we extend the information complexity approach of Chakrabarti, Shi, Wirth, and Yao (2001) and Bar-Yossef, Jayram, Kumar, and Sivakumar (2004) to our restricted version of the multiparty number on the forehead model. The best currently known multiparty protocol for pointer jumping by Damm, Jukna, and Sgall (1998) works in this model.