Publication:
Communication complexity and data compression

Simple item page
dc.contributor.authorsTamm U.
dc.date.accessioned2022-03-15T02:09:53Z
dc.date.accessioned2026-01-11T13:22:54Z
dc.date.available2022-03-15T02:09:53Z
dc.date.issued2013
dc.description.abstractA 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 the results and applications in other areas. © 2013 IEEE.
dc.identifier.doi10.1109/ITA.2013.6502978
dc.identifier.urihttps://hdl.handle.net/11424/247341
dc.language.isoeng
dc.relation.ispartof2013 Information Theory and Applications Workshop, ITA 2013 - Conference Proceedings
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectamortized complexity
dc.subjectcommunication complexity
dc.subjectfunctions on direct sums
dc.subjectprefix codes
dc.titleCommunication complexity and data compression
dc.typeconferenceObject
dspace.entity.typePublication
oaire.citation.endPage385
oaire.citation.startPage381
oaire.citation.title2013 Information Theory and Applications Workshop, ITA 2013 - Conference Proceedings

Files

Collections

Araştırma Çıktıları