Compressed Communication Complexity of Longest Common Prefixes

  title={Compressed Communication Complexity of Longest Common Prefixes},
  author={Philip Bille and Mikko Berggren Ettienne and Roberto Grossi and Inge Li G{\o}rtz and Eva Rotenberg},
We consider the communication complexity of fundamental longest common prefix (Lcp) problems. In the simplest version, two parties, Alice and Bob, each hold a string, $A$ and $B$, and we want to determine the length of their longest common prefix $l=\text{Lcp}(A,B)$ using as few rounds and bits of communication as possible. We show that if the longest common prefix of $A$ and $B$ is compressible, then we can significantly reduce the number of rounds compared to the optimal uncompressed protocol… 

Compressed Communication Complexity of Hamming Distance

A randomized public-coin protocol for a joint computation of the Hamming distance of two strings represented by LZ77 without self-references is presented, which uses Crochemore's C-factorization and Rytter’s AVL-grammar.



Communication and Streaming Complexity of Approximate Pattern Matching

The first sublinear-space streaming algorithm for the approximate pattern matching problem is developed and the first deterministic one-way communication protocol that uses O(k √ n logn) bits is developed.

On data structures and asymmetric communication complexity

This paper considers two-party communication complexity, the ``asymmetric case'', when the input sizes of the two players differ significantly, and derives two generally applicable methods of proving lower bounds and obtain several applications.

Randomised Individual Communication Complexity

This paper establishes randomised protocols whose communication complexity is close to the information theoretical lower bound and shows trade-offs between the amount of communication and the number of rounds.

Some complexity questions related to distributive computing(Preliminary Report)

The quantity of interest, which measures the information exchange necessary for computing f, is the minimum number of bits exchanged in any algorithm.

Lower bounds for predecessor searching in the cell probe model

A strong round elimination lemma for communication complexity that enables a tight lower bound for the predecessor problem is proved and it is believed that this lemma is of independent interest and should have other applications.

Communication Complexity

This work will review the basic communication model and some of the classical results known for it, sometimes even with proofs, and consider a variant in which the players are allowed to flip fair unbiased coins.

Private vs. Common Random Bits in Communication Complexity

  • I. Newman
  • Computer Science
    Inf. Process. Lett.
  • 1991

A universal algorithm for sequential data compression

The compression ratio achieved by the proposed universal code uniformly approaches the lower bounds on the compression ratios attainable by block-to-variable codes and variable- to-block codes designed to match a completely specified source.

Computing with Noisy Information

This paper studies the depth of noisy decision trees in which each node gives the wrong answer with some constant probability, giving tight bounds for several problems.

The Sketching Complexity of Pattern Matching

It is shown that it is impossible to compress the text into a small sketch and use only the sketch to decide whether a given pattern occurs in the text.