Communication Complexity and Data Compression

被引：0
|
作者：
Tamm, Ulrich [1 ]
机构：
[1] Univ Appl Sci, Dept Econ, Bielefeld, Germany
来源：
2013 INFORMATION THEORY AND APPLICATIONS WORKSHOP (ITA) | 2013年
关键词：
prefix codes; communication complexity; amortized complexity; functions on direct sums;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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 the results and applications in other areas.
引用
收藏
页数：4
相关论文
共 50 条
  • [1] Orbit complexity and data compression
    Galatolo, S
    DISCRETE AND CONTINUOUS DYNAMICAL SYSTEMS, 2001, 7 (03) : 477 - 486
  • [2] Reconciling data compression and Kolmogorov complexity
    Bienvenu, Laurent
    Merkle, Wolfgang
    AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2007, 4596 : 643 - +
  • [3] On data mining, compression, and Kolmogorov complexity
    Christos Faloutsos
    Vasileios Megalooikonomou
    Data Mining and Knowledge Discovery, 2007, 15 : 3 - 20
  • [4] On data mining, compression, and Kolmogorov complexity
    Faloutsos, Christos
    Megalooikonomou, Vasileios
    DATA MINING AND KNOWLEDGE DISCOVERY, 2007, 15 (01) : 3 - 20
  • [5] Haptic Data Compression and Communication
    Steinbach, Eckehard
    Hirche, Sandra
    Kammerl, Julius
    Vittorias, Iason
    Chaudhari, Rahul
    IEEE SIGNAL PROCESSING MAGAZINE, 2011, 28 (01) : 87 - 96
  • [6] On data structures and asymmetric communication complexity
    Miltersen, PB
    Nisan, N
    Safra, S
    Wigderson, A
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1998, 57 (01) : 37 - 49
  • [7] Complexity of preprocessor in MPM data compression system
    Kieffer, J
    Yang, EH
    Park, T
    Yakowitz, S
    DCC '98 - DATA COMPRESSION CONFERENCE, 1998, : 554 - 554
  • [8] Scalability and communication in parallel low-complexity lossless compression
    Cinque L.
    de Agostino S.
    Lombardi L.
    Mathematics in Computer Science, 2010, 3 (4) : 391 - 406
  • [9] A direct sum theorem in communication complexity via message compression
    Jain, R
    Radhakrishnan, J
    Sen, P
    AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2003, 2719 : 300 - 315
  • [10] LOSSLESS QUANTUM DATA COMPRESSION AND QUANTUM KOLMOGOROV COMPLEXITY
    Rogers, Caroline
    Nagarajan, Rajagopal
    INTERNATIONAL JOURNAL OF QUANTUM INFORMATION, 2011, 9 (02) : 637 - 650
12345