Ulrich Tamm. Multiparty Communication Complexity of Vector-Valued and Sum-Type Functions. In Harout K. Aydinian, Ferdinando Cicalese, Christian Deppe, editors, Information Theory, Combinatorics, and Search Theory - In Memory of Rudolf Ahlswede. Volume 7777 of Lecture Notes in Computer Science, pages 451-462, Springer, 2013. [doi]
@inproceedings{Tamm13-0,
title = {Multiparty Communication Complexity of Vector-Valued and Sum-Type Functions},
author = {Ulrich Tamm},
year = {2013},
doi = {10.1007/978-3-642-36899-8_21},
url = {http://dx.doi.org/10.1007/978-3-642-36899-8_21},
researchr = {https://researchr.org/publication/Tamm13-0},
cites = {0},
citedby = {0},
pages = {451-462},
booktitle = {Information Theory, Combinatorics, and Search Theory - In Memory of Rudolf Ahlswede},
editor = {Harout K. Aydinian and Ferdinando Cicalese and Christian Deppe},
volume = {7777},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-36898-1},
}