A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Communication complexity and data compression
2013
2013 Information Theory and Applications Workshop (ITA)
A result of Ahlswede and Cai for the 2-party communication complexity of set intersection is generalized to a multiparty model. There are relations to several areas as to the direct-sum conjecture and amortized complexity in computational complexity or interactive communication in information theory as well as to wireless sensor networks and even quantum communication. The aim of the paper is mostly to survey these different applications and to draw the attention of researchers in one area to
doi:10.1109/ita.2013.6502978
dblp:conf/ita/Tamm13a
fatcat:n5ozduopi5h3reyh6gilobfvx4