Rounds in communication complexity revisited
SIAM Journal on Computing
Communication 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
Selection and Sorting with Limited Storage
Selection and Sorting with Limited Storage
Communication Complexity with Synchronized Clocks
CCC '10 Proceedings of the 2010 IEEE 25th Annual Conference on Computational Complexity
| Hi-index | 0.00 |
The synchronized bit communication model, defined recently by Impagliazzo and Williams in [1], is a communication model which allows the participants to share a common clock. The main open problem posed in this paper was the following: does the synchronized bit model allow a logarithmic speed-up for all functions over the standard deterministic model of communication? We resolve this question in the negative by showing that the Median function, whose communication complexity is O(log n), does not admit polytime synchronized bit protocol with communication complexity O(log1-ε n) for any ε 0. Our results follow by a new round-communication trade-off for the Median function in the standard model, which easily translates to its hardness in the synchronized bit model.