Compressed Communication Complexity of Longest Common Prefixes

Research output: Research - peer-reviewArticle in proceedings – Annual report year: 2018

View graph of relations

We consider the communication complexity of fundamental longest common prefix $$({{\mathrm{\textsc {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 $$\ell ={{\mathrm{\textsc {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, while achieving the same (or fewer) bits of communication. Namely, if the longest common prefix has an LZ77 parse of z phrases, only $$O(\lg z)$$ rounds and $$O(\lg \ell )$$ total communication is necessary. We extend the result to the natural case when Bob holds a set of strings $$B_1, \ldots , B_k$$ , and the goal is to find the length of the maximal longest prefix shared by A and any of $$B_1, \ldots , B_k$$ . Here, we give a protocol with $$O(\log z)$$ rounds and $$O(\lg z \lg k + \lg \ell )$$ total communication. We present our result in the public-coin model of computation but by a standard technique our results generalize to the private-coin model. Furthermore, if we view the input strings as integers the problems are the greater-than problem and the predecessor problem.
Original languageEnglish
Title of host publicationString Processing and Information Retrieval
PublisherSpringer
Publication date2018
Pages74-87
ISBN (Print)9783030004798
DOIs
StatePublished - 2018
Event25th International Symposium on String Processing and Information Retrieval - Lima, Peru
Duration: 9 Oct 201811 Oct 2018

Conference

Conference25th International Symposium on String Processing and Information Retrieval
CountryPeru
CityLima
Period09/10/201811/10/2018
SeriesLecture Notes in Computer Science
Volume11147
ISSN0302-9743
CitationsWeb of Science® Times Cited: No match on DOI

    Research areas

  • Communication complexity, LZ77, Compression Upper bound, Output sensitive , Longest common prefix, Predecessor
Download as:
Download as PDF
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
Word

ID: 154951202