Multiparty communication complexity of vector---valued and sum---type functions

Authors:
Ulrich Tamm
Affiliations:
German Language Department of Business Informatics, Marmara University, Istanbul, Turkey
Venue:
Information Theory, Combinatorics, and Search Theory
Year:
2013

Citing 13
Cited 0

Inequalities for code pairs

European Journal of Combinatorics
A general 4-words inequality with consequences for 2-way communication complexity

Advances in Applied Mathematics
Communication complexity of sum-type functions invariant under translation

Information and Computation
Amortized Communication Complexity

SIAM Journal on Computing
Deterministic communication complexity of set intersection

Discrete Applied Mathematics
Communication complexity and parallel computing

Communication complexity and parallel computing
Communication complexity

Communication complexity
Code pairs with specified parity of the Hamming distances

Discrete Mathematics
The space complexity of approximating the frequency moments

Journal of Computer and System Sciences
Some complexity questions related to distributive computing(Preliminary Report)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Complexity classes in communication complexity theory

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Partition arguments in multiparty communication complexity

Theoretical Computer Science
On communication complexity of vector-valued functions

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Rudolf Ahlswede's work on communication complexity dealt with functions defined on direct sums: vector---valued functions and sum---type functions. He was interested in single---letter characterizations and provided several lower bound techniques to this aim. In this paper we shall review these lower bounds and extend them to the "number in hand" multiparty model of communication complexity.