On Data Structures and Asymmetric Communication Complexity

In this paper we consider two-party communication complexity, the “asymmetric case”, when the input sizes of the two players differ significantly. Most of previous work on communication complexity only considers the total number of bits sent, but we study trade-offs between the number of bits the first player sends and the number of bits the second sends. These types of questions are closely related to the complexity of static data structure problems in the cell probe model. We derive two generally applicable methods of proving lower bounds and obtain several applications. These applications include new lower bounds for data structures in the cell probe model. Of particular interest is our “round elimination” lemma, which is interesting also for the usual symmetric communication case. This lemma generalizes and abstracts in a very clean form the “round reduction” techniques used in many previous lower bound proofs.

[1]  Zvi Galil,et al.  Lower bounds on communication complexity , 1984, STOC '84.

[2]  Mihalis Yannakakis,et al.  On monotone formulae with restricted depth , 1984, STOC '84.

[3]  Arne Andersson,et al.  Sublogarithmic searching without multiplications , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[4]  Vladimiro Sassone.  Strong Concatenable Processes: An Approach to the Category of Petri Net Computations , 1994 .

[5]  L. Aceto.  CPO Models for GSOS Languages - Part I: Compact GSOS Languages , 1994 .

[6]  Miklós Ajtai,et al.  A lower bound for finding predecessors in Yao's cell probe model , 1988, Comb..

[7]  Avi Wigderson,et al.  Monotone circuits for connectivity require super-logarithmic depth , 1990, STOC '88.

[8]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[9]  Noam Nisan,et al.  Rounds in communication complexity revisited , 1991, STOC '91.

[10]  B. Xiao.  New bounds in cell probe model , 1992 .

[11]  Ivan Damgård,et al.  Enhancing the Strength of Conventional Cryptosystems , 1994 .

[12]  Peter Bro Miltersen.  On the Cell Probe Complexity of Polynomial Evaluation , 1995, Theor. Comput. Sci..

[13]  Kurt Mehlhorn,et al.  Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract) , 1982, STOC '82.

[14]  Ronald L. Rivest,et al.  Partial-Match Retrieval Algorithms , 1976, SIAM J. Comput..

[15]  János Komlós,et al.  Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[16]  G. Winskel,et al.  A Compositional Proof System for the Modal mu-Calculus , 1994 .

[17]  Arne Andersson,et al.  On the Difficulty of Range Searching , 1995, WADS.

[18]  Ivan Damgård,et al.  Hashing Functions can Simplify Zero-Knowledge Protocol Design (too) , 1994 .

[19]  Rüdiger Reischuk,et al.  On different modes of communication , 1988, STOC '88.

[20]  Peter Bro Miltersen.  The Bit Probe Complexity Measure Revisited , 1993, STACS.

[21]  Gerth Stølting Brodal,et al.  Partially Persistent Data Structures of Bounded Degree with Constant Update Time , 1994, Nord. J. Comput..

[22]  Alexander Aiken,et al.  Decidability of Systems of Set Constraints with Negative Constraints , 1994, Inf. Comput..

[23]  Bernard Chazelle,et al.  Lower bounds for orthogonal range searching: I. The reporting case , 1990, JACM.

[24]  Alexander A. Razborov,et al.  On provably disjoint NP-pairs , 1994, Electron. Colloquium Comput. Complex..

[25]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[26]  Noam Nisan,et al.  Symmetric Logspace is Closed Under Complement , 1994 .

[27]  Andrew Chi-Chih Yao,et al.  Should Tables Be Sorted? , 1981, JACM.

[28]  N. Nisan.  The communication complexity of threshold gates , 1993 .

[29]  Michael L. Fredman,et al.  Surpassing the Information Theoretic Bound with Fusion Trees , 1993, J. Comput. Syst. Sci..

[30]  Peter Bro Miltersen.  Lower bounds for union-split-find related problems on random access machines , 1994, STOC '94.

[31]  Dan E. Willard,et al.  Log-logarithmic worst-case range queries are possible in space ⊕(N) , 1983 .

[32]  Peter Bro Miltersen,et al.  On data structures and asymmetric communication complexity , 1994, STOC '95.

[33]  Andrew C. Yao,et al.  Lower bounds by probabilistic arguments , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).